Recursive digital filter structures using new high speed convolution algorithms

This paper applies some of the new high speed convolution algorithms that are based on factoring polynomials to recursive filters by using block structures. Various schemes that use a minimum number of multiplications are considered. It is found that it is always possible to reduce the required multiplies below that required by a canonical realization and the new algorithms are better than the FFT for orders below about 100.