TL;DR
This paper introduces the MPC algorithm for synthesizing majority logic functions, optimizing for minimal levels, gates, inverters, and inputs, and compares its performance with the existing exact_mig algorithm.
Contribution
The paper presents a novel MPC algorithm that improves majority logic synthesis by considering additional cost criteria and outperforming the existing exact_mig algorithm in many cases.
Findings
MPC achieves optimal solutions for all 3-input functions.
MPC improves 66% of 4-input functions over exact_mig.
MPC improves 48% of 5-input functions in a sample.
Abstract
Due to technology advancements and circuits miniaturization, the study of logic systems that can be applied to nanotechnology has been progressing steadily. Among the creation of nanoeletronic circuits reversible and majority logic stand out. This paper proposes the MPC (Majority Primitives Combination) algorithm, used for majority logic synthesis. The algorithm receives a truth table as input and returns a majority function that covers the same set of minterms. The formulation of a valid output function is made with the combination of previously optimized functions. As cost criteria the algorithm searches for a function with the least number of levels, followed by the least number of gates, inverters, and gate inputs. In this paper it's also presented a comparison between the MPC and the exact_mig, currently considered the best algorithm for majority synthesis. The exact_mig encode the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
