Running FIR and IIR filtering using multirate filter banks
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 36 (5) , 730-738
- https://doi.org/10.1109/29.1582
Abstract
The computational complexity of running FIR (finite-impulse response) and IIR (infinite-impulse response) filtering using multirate filter banks is considered. No restrictions are put on signal, filter, or block lengths. It is shown how to map long running convolutions into smaller ones by using filter banks based on aperiodic convolution algorithms and short-time Fourier transforms. With the proposed approach, good tradeoffs among computational complexity, system architecture, and input-output delay are achieveKeywords
This publication has 13 references indexed in Scilit:
- Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- A theory of multirate filter banksIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- Fast block data processing via a new IIR digital filter structureIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- New quadrature mirror filter structuresIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982
- Frequency domain analysis of wraparound error in fast convolution algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Block implementation of recursive digital filters--New structures and propertiesIEEE Transactions on Circuits and Systems, 1978
- TDM-FDM Transmultiplexer: Digital Polyphase and FFTIEEE Transactions on Communications, 1974
- Block realization of digital filtersIEEE Transactions on Audio and Electroacoustics, 1972
- High-speed convolution and correlationPublished by Association for Computing Machinery (ACM) ,1966