Abstract
Constant multiplication circuits can be realized multiplierless by using additions, subtractions, and bit-shifts. The problem of finding a multiplication circuit with minimum adders and subtractors for a given constant (set of constants) is known as single (multiple) constant multiplication (SCM, MCM) problem. This brief proposes a novel integer linear programming (ILP) formulation to optimally solve SCM and MCM problems. In contrast to previous ILP approaches, none of the possible intermediate constants have to be pre-computed as all additions are directly evaluated. This leads to fewer ILP variables and more compact models. Due to the flexibility of ILP, the proposed model can be extended to several other (secondary) objectives. To demonstrate this, an extension for minimal SCM and MCM circuits using 3-input adders as well as an extension for minimizing the circuits' glitch path count for low power applications are provided. The experimental results show that the formulation is useful for practically relevant problem sizes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
