Design of multiplierless FIR filters with an adder depth versus filter order trade-off

Authors:
Kenny Johansson;Linda S. DeBrunner;Oscar Gustafsson;Victor DeBrunner
Affiliations:
Department of Electrical and Computer Engineering, Florida State University, Tallahassee, FL;Department of Electrical and Computer Engineering, Florida State University, Tallahassee, FL;Department of Electrical Engineering, Linköping University, Linköping, Sweden;Department of Electrical and Computer Engineering, Florida State University, Tallahassee, FL
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 3
Cited 1

Multiplierless multiple constant multiplication

ACM Transactions on Algorithms (TALG)
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A new algorithm for elimination of common subexpressions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

An Algorithm for Jointly Optimizing Quantization and Multiple Constant Multiplication

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, the trade-offs in FIR filter design are studied. This includes the adder depth for the constant filter coefficients, the number of adders, and the number of delay elements, i.e., the filter order. It is shown that the proposed design algorithm can be used to decrease both the overall arithmetic complexity and the adder depth, possibly with a small penalty in delay elements. This is achieved by selecting coefficients that can be realized at a lower depth, i.e., the lengths of the logic paths are reduced. Hence, this directly translates into decreased power consumption due to reduced glitch propagation and increased throughput due to a shorter critical path.