Vetterli, Martin2005-04-182005-04-182005-04-18198810.1109/29.1582https://infoscience.epfl.ch/handle/20.500.14299/212863The 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 achievedChannel bank filtersIIR filtersHardwareFourier transformsFinite impulse response filterFilteringFilter bankDelayConvolutionComputational complexitydigital filtersfiltering and prediction theoryIIR filtershort-time Fourier transformsrunning FIR filtermultirate filter bankslong running convolutionsaperiodic convolution algorithmstext::journal::journal article::research article