Computationally efficient bank of rectangular digital filters
Abstract
A computationally efficient scheme for forming a bank of identical continguous rectangular digital filters is described. The data processing is organized in a sequential form allowing use of the FFT algorithm as the first stage. An example is given in which a bank of 256 rectangular filters is formed using only a few percent of the number of complex multiples required by straightforward procedures. The steepness of cutoff is unaltered and the inband ripple is only slightly affected, but the sidelobe level suffers some degradation.
- Publication:
-
IEEE Transactions on Aerospace Electronic Systems
- Pub Date:
- March 1975
- DOI:
- 10.1109/TAES.1975.308062
- Bibcode:
- 1975ITAES..11..229Z
- Keywords:
-
- Algorithms;
- Digital Filters;
- Fast Fourier Transformations;
- Run Time (Computers);
- Signal Processing;
- Data Sampling;
- Frequency Division Multiplexing;
- Frequency Response;
- Sidelobes;
- Transfer Functions;
- Electronics and Electrical Engineering