Linear Convolution Using Skew-Cyclic Convolutions

It is shown that the linear convolution required in block filtering can be decomposed into a sum of skew-cyclic convolutions. Such convolutions can be realized efficiently with half-length complex transforms when the signals are real. This method results in computational savings over the traditional overlap-add and overlap-save algorithms. It is also more economical than fast parallel finite impulse response (FIR) filter structures for longer filter lengths