Answers are grounded in this paper and cite their sources.
This article presents a review of Majority-Inverter Graphs (MIGs) and their practical use in various applications within logic synthesis. MIGs are directed acyclic graphs consisting of three-input majority nodes and regular/complemented edges. They represent a paradigm shift in representing and optimizing logic using only majority (MAJ) and inversion (INV) functions. In this article, we review different optimization algorithms that work on MIGs, including algebraic, Boolean, and exact methods. We also describe different applications of MIGs in logic synthesis: From classical CMOS-based synthesis to their use for theoretical results and emerging technologies.
No takes yet. Share an insight, caveat, or question.
Testa et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: