Computational structures for fast implementation of L-path and L-block digital filters

One of the major problems in the multi-DSP (digital signal processor) implementation of L-path and L-block digital filters is the hardware complexity-throughput rate tradeoff. The author presents computational structures based on the theory of fast algorithms for short linear convolutions, which are suitable for the implementation of these types of digital filters. He also compares the performance of the structures with two previously published ones. The comparison shows that the schemes proposed here are faster and that the complexity-throughput tradeoffs can easily be controlled by the designer.<
>