Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm
2002 (English)In: IEEE transactions on circuits and systems. 2, Analog and digital signal processing (Print), ISSN 1057-7130, E-ISSN 1558-125X, Vol. 49, no 3, 196-203 p.Article in journal (Refereed) Published
In this work, a new algorithm called nonrecursive signed common subexpression elimination (NR-SCSE) is discussed, and several Applications in the area of multiplierless finite-impulse response (FIR) filters are developed. While the recursive utilization of a common subexpression generates a high logic depth into the digital structure, the NR-SCSE algorithm allows the designer to overcome this problem by using each subexpression once. The paper presents a complete description of the algorithm, and a comparison with two other well-known options: the graph synthesis, and the classical common subexpression elimination technique. Main results show that the NR-SCSE implementations of several benchmark circuits offer the best relation between occupied area and logic depth respect to the previous values published in the technical literature.
Place, publisher, year, edition, pages
2002. Vol. 49, no 3, 196-203 p.
Common subexpression elimination, Finite-impulse response (FIR) filtering, Multiplierless algorithm
National CategoryNatural Sciences
IdentifiersURN: urn:nbn:se:liu:diva-47078DOI: 10.1109/TCSII.2002.1013866OAI: oai:DiVA.org:liu-47078DiVA: diva2:267974