Boolean Optimization: MIGs and Majority Gates

This lecture covers the optimization of Boolean functions using Majority-Inverter Graphs (MIGs) and Majority Gates. It explains the technology-independent logic representation in MIGs, the properties of MIGs, MIG Boolean Algebra, algebraic optimization, and exact synthesis of MIGs. The lecture also delves into Boolean rewriting, Majority-n functions, and the transformation of n-argument majority functions into 3-input majorities. It concludes with references on MIGs and their applications in logic optimization.