A NEW IIR ALGORITHM-BASED ON THE OVERLAP-SAVE APPROACH

In this brief, a new IIR algorithm is presented, It is based on a bloc k implementation method for IIR filters, and has two stages, First, a circular convolution is used to transform the input into intermediate results, Second, a correction circuit transforms the intermediate resu lt into the correct output. Because the correction circuit uses part o f the previous output to correct the current intermediate result, our approach is an overlap-save based algorithm, The multiplicative comple xity of this algorithm is shown to be 2 log(kn)+8 log(n)+12/k+1 real m ultiplications per output point, for a block of size kn, where n is th e order of the filter and k greater than or equal to 2, is a constant, This complexity is much less (by more than 50%) than other known algo rithms. Another advantage of this algorithm is that it is easily paral lelizable.