Logic synthesis for arithmetic circuits using the Reed-Muller representation
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-113
- https://doi.org/10.1109/edac.1992.205904
Abstract
A procedure for multi-level Reed-Muller minimization has been developed which introduces a Reed-Muller factored form, and uses algebraic algorithms for factorization, decomposition, resubstitution, collapsing, and extraction of common cubes and subexpressions. The procedure has been used to design some arithmetic circuits using a gate library containing a wide range of gates, and the resulting circuits were compared with some designed using MisII. The circuits designed using the Reed-Muller system were over 20 percent smaller and between 25 and 50 percent faster.Keywords
This publication has 8 references indexed in Scilit:
- An algorithm for the multi-level minimization of Reed-Muller representationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Module generation for AND/XOR-fields (XPLAs)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An improved algorithm for the minimization of mixed polarity Reed-Muller representationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient program for logic synthesis of mod-2 sum expressionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Multilevel logic synthesisProceedings of the IEEE, 1990
- Input irredundancy of mixed-polarity Reed-Muller equationsElectronics Letters, 1988
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- On Minimal Modulo 2 Sums of Products for Switching FunctionsIEEE Transactions on Electronic Computers, 1967