Efficient Shift-Add Implementation of FIR Filters Using Variable Partition Hybrid Form Structures

Single constant multiplication (SCM) and multiple constant multiplications (MCM) are among the most popular schemes used for low-complexity shift-add implementation of finite impulse response (FIR) filters. While SCM is used in the direct form realization of FIR filters, MCM is used in the transposed direct form structures. Very often, the hybrid form FIR filters where the sub-sections are implemented by fixed-size MCM blocks provide better area, time, and power efficiency than those of traditional MCM and SCM based implementations. To have an efficient hybrid form filter, in this paper, we have performed a detailed complexity analysis in terms of the hardware and time consumed by the hybrid form structures. We find that the existing hybrid form structures lead to an undesirable increase of complexity in the structural-adder block. Therefore, to have a more efficient implementation, a variable size partitioning approach is proposed in this paper. It is shown that the proposed approach consumes less area and provides nearly 11% reduction of critical path delay, 40% reduction of power consumption, 15% reduction of area-delay product, 52% reduction of energy-delay product, and 42% reduction of power-area product, on an average, over the state-of-the-art methods.

[1]  Chip-Hong Chang,et al.  Novel Design Algorithm for Low Complexity Programmable FIR Filters Based on Extended Double Base Number System , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Martin Kumm.  Multiple constant multiplication optimizations for field programmable gate arrays , 2016 .

[3]  Mathias Faust,et al.  Optimization of structural adders in fixed coefficient transposed direct form FIR filters , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[4]  Zhan Yu,et al.  Design of optimal hybrid form FIR filter , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

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

[6]  Qiang Zhang,et al.  A Novel Hybrid Monotonic Local Search Algorithm for FIR Filter Coefficients Optimization , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  K. Azadet,et al.  Low-power equalizer architectures for high speed modems , 1998 .

[8]  Ghassem Jaberipur,et al.  FIR Filter Realization via Deferred End-Around Carry Modular Addition , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Peter Zipf,et al.  Optimization of Constant Matrix Multiplication with Low Power and High Throughput , 2017, IEEE Transactions on Computers.

[10]  S. Vijaya Laxmi,et al.  FINE-GRAINED CRITICAL PATH ANALYSIS AND OPTIMIZATION FOR AREA-TIME EFFICIENT REALIZATION OF MULTIPLE CONSTANT MULTIPLICATIONS , 2016 .

[11]  Mathias Faust,et al.  On “A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters” , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  José C. Monteiro,et al.  An improved synthesis method for low power hardwired FIR filters , 2004, Proceedings. SBCCI 2004. 17th Symposium on Integrated Circuits and Systems Design (IEEE Cat. No.04TH8784).

[13]  Dong Shi,et al.  Design of Linear Phase FIR Filters With High Probability of Achieving Minimum Number of Adders , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[14]  Xin Lou,et al.  Analysis and Optimization of Product-Accumulation Section for Efficient Implementation of FIR Filters , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[15]  Mathias Faust,et al.  Tap Delay-and-Accumulate Cost Aware Coefficient Synthesis Algorithm for the Design of Area-Power Efficient FIR Filters , 2018, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  D. Goodman,et al.  Nine digital filters for decimation and interpolation , 1977 .

[17]  Lars Wanhammar.  DSP integrated circuits , 1999 .

[18]  Chip-Hong Chang,et al.  Hypergraph Based Minimum Arborescence Algorithm for the Optimization and Reoptimization of Multiple Constant Multiplications , 2016, IEEE Transactions on Circuits and Systems I: Regular Papers.

[19]  Mathias Faust,et al.  Pipelined adder graph optimization for high speed multiple constant multiplication , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[20]  Meher.  Arithmetic Circuits for DSP Applications , 2017 .

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

[22]  Mohammed Bakiri,et al.  Multiple Constant Multiplication Algorithm for High-Speed and Low-Power Design , 2016, IEEE Transactions on Circuits and Systems II: Express Briefs.

[23]  O. Gustafsson,et al.  Low-complexity hybrid form FIR filters using matrix multiple constant multiplication , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[24]  Chip-Hong Chang,et al.  A New Paradigm of Common Subexpression Elimination by Unification of Addition and Subtraction , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Levent Aksoy,et al.  A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures , 2014, Circuits Syst. Signal Process..

[26]  P. Flores,et al.  An Exact Breadth-First Search Algorithm for the Multiple Constant Multiplications Problem , 2008, 2008 NORCHIP.

[27]  Mathias Faust,et al.  Efficient structural adder pipelining in transposed form FIR filters , 2015, 2015 IEEE International Conference on Digital Signal Processing (DSP).

[28]  Ya Jun Yu,et al.  Novel Structure for Area-Efficient Implementation of FIR Filters , 2017, IEEE Transactions on Circuits and Systems II: Express Briefs.

[29]  Mohammed Bakiri,et al.  Design of high-speed, low-power, and area-efficient FIR filters , 2018, IET Circuits Devices Syst..

[30]  Ya Jun Yu,et al.  Design of Low-Power Multiplierless Linear-Phase FIR Filters , 2017, IEEE Access.

[31]  Xin Lou,et al.  New Approach to the Reduction of Sign-Extension Overhead for Efficient Implementation of Multiple Constant Multiplications , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.

[32]  David Bull,et al.  Primitive operator digital filters , 1991 .

[33]  Ya Jun Yu,et al.  Lower Bound Analysis and Perturbation of Critical Path for Area-Time Efficient Multiple Constant Multiplications , 2017, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[34]  Chip-Hong Chang,et al.  A New Cost-Aware Sensitivity-Driven Algorithm for the Design of FIR Filters , 2017, IEEE Transactions on Circuits and Systems I: Regular Papers.