Block realization of digital filters

Different forms of block recursive digital filters are formulated using a matrix representation of convolution. These approaches have the same relation to recursive filters that fast convolution does to nonrecursive filters. The multiplication efficiencies are calculated and compared, showing that the block realization can become more efficient for filters with orders exceeding approximately 25. The general improvements on stability and sensitivity to roundoff error and coefficient accuracy are discussed.