Abstract
An input transformation based on EXOR gates is presented which enables efficient two-level AND/EXOR representations of adders to be constructed. In general, adders only have exponential two-level representations, but by using the input transformation the complexity decreases to O(n2) requiring only a linear hardware overhead. Exclusive sum-of-products (ESOP) and positive polarity Reed-Muller expression (PPRM) circuits are considered.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
