Abstract
Effective common subexpression extraction has become an eminent means to eliminate redundant computations in multiple constant multiplication problems. Prevailing common subexpression elimination (CSE) algorithms use horizontal common subexpressions predominantly due to the symmetry of linear phase FIR filters. This paper presents a new contention resolution algorithm (CRA), called the I/sup 2/CRA that exploits both the intra- and inter-coefficient redundancy to reduce the logic depth and logic complexity further. Unlike the statistical based CSE, I/sup 2/CRA allows a selected common subexpressions to be freed in case of conflicts. By endowing the basic CRA with the prowess to handle common subexpressions in both dimensions in a comprehensive manner, the essentiality of vertical and oblique common subexpressions has been manifested.
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.
