Sign-Extension Avoidance and Word-Length Optimization by Positive-Offset Representation for FIR Filter Design

This brief proposes a new approach to utilizing positive-offset representation for sign-extension avoidance in shift-and-add implementation of a finite-impulse response filter. Affine arithmetic is used to model the excess offsets in order to curtail the word-length (WL) expansion problem. Tighter probabilistically justified WL bounds are determined to enable further offset to be removed from each tap. The approach is applicable even after the redundant adders in the multiplier block of the filter have been minimized. Our simulation results show an average power reduction of about 19% over and above the savings achieved by sharing of adders in multiple constant multiplication.

[1]  Sungho Kang,et al.  New distributed arithmetic algorithm for low-power FIR filter implementation , 2004, IEEE Signal Process. Lett..

[2]  Chip-Hong Chang,et al.  Contention Resolution—A New Approach to Versatile Subexpressions Sharing in Multiple Constant Multiplications , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Yong Ching Lim,et al.  Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  Shing-Chow Chan,et al.  The design and multiplier-less realization of software radio receivers with reduced system delay , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[6]  Oscar Gustafsson,et al.  A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[7]  Levent Aksoy,et al.  Effect of Number Representation on the Achievable Minimum Number of Operations in Multiple Constant Multiplications , 2007, 2007 IEEE Workshop on Signal Processing Systems.

[8]  Levent Aksoy,et al.  Search algorithms for the multiple constant multiplications problem: Exact and approximate , 2010, Microprocess. Microsystems.

[9]  Rob A. Rutenbar,et al.  Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[10]  Linda S. DeBrunner,et al.  Techniques for avoiding sign-extension in multiple constant multiplication , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[11]  Chip-Hong Chang,et al.  Information Theoretic Approach to Complexity Reduction of FIR Filter Design , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Markus Püschel,et al.  Multiplierless multiple constant multiplication , 2007, TALG.

[13]  Heinrich Klar,et al.  General algorithms for a simplified addition of 2's complement numbers , 1995, IEEE J. Solid State Circuits.

[14]  Tzi-Dar Chiueh,et al.  A Low-Power Digit-Based Reconfigurable FIR Filter , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[15]  Douglas L. Maskell.  Design of efficient multiplierless FIR filters , 2007, IET Circuits Devices Syst..

[16]  Chip-Hong Chang,et al.  Design of Low-Complexity FIR Filters Based on Signed-Powers-of-Two Coefficients With Reusable Common Subexpressions , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  H. Samueli,et al.  A 200-MHz all-digital QAM modulator and demodulator in 1.2- mu m CMOS for digital radio applications , 1991 .