Efficient Partitioning of Algorithms for Long Convolutions and their Mapping onto Architectures
Journal of VLSI Signal Processing Systems - Special issue on systematic trade-off analysis in signal processing systems design
Integrated Computer-Aided Engineering
Hi-index | 35.68 |
By using block processing, partitioning, and fast Fourier transforms (FFTs), large filters perform efficiently in the frequency domain. For small processing delay the complexity can still be too large for implementation on a digital signal processor (DSP). A solution is to partition the filter into unequal-length subfilters. Application in adaptive filtering yields the nonuniform partitioned block frequency domain adaptive filter (NU-PBFDAF)