Low- Cost Parallel FIR Filter Structures With 2-Stage Parallelism
Authors:
- 12 February 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 54 (2) , 280-290
Abstract
Based on recently published low-complexity parallel finite-impulse response (FIR) filter structures, this paper proposes a new parallel FIR Filter structure with less hardware complexity. The subfilters in the previous parallel FIR structures are replaced by a second stage parallel FIR filter. The proposed 2-stage parallel FIR filter structures can efficiently reduce the number of required multiplications and additions at the expense of delay elements. For a 32-parallel 1152-tap FIR filter, the proposed structure can save 5184 multiplications (67%), 2612 additions (30%), compared to previous parallel FIR structures, at the expense of 10089 delay elements (-133%). The proposed structures will lead to significant hardware savings because the hardware cost of a delay element is only a small portion of that of a multiplier, not including the savings in the number of additionsKeywords
This publication has 10 references indexed in Scilit:
- Further Complexity Reduction of Parallel FIR Filters2005
- Hardware Efficient Fast Parallel FIR Filter Structures Based on Iterated Short ConvolutionIEEE Transactions on Circuits and Systems I: Regular Papers, 2004
- Frequency Spectrum Based Low-Area Low-Power Parallel FIR Filter DesignEURASIP Journal on Advances in Signal Processing, 2002
- Low-Area/Power Parallel FIR Digital Filter ImplementationsJournal of Signal Processing Systems, 1997
- Overlapped block digital filteringIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1996
- Short-length FIR filters and their use in fast nonrecursive filteringIEEE Transactions on Signal Processing, 1991
- Computational structures for fast implementation of L-path and L-block digital filtersIEEE Transactions on Circuits and Systems, 1989
- Fast Fourier Transform and Convolution Algorithms1982
- New algorithms for digital convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976