An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions
T. K. Truong, D. Y. Pei, I.S. Reed, Y.F. Chu, I. S. Hsu · IEEE Transactions on Acoustics Speech and Signal Processing · 1988
The fast polynomial transform (FPT) for computing 2-D cyclic convolutions is modularized into identical modules. In the new method, the 1-D cyclic polynomial convolution is decomposed into cycle convolutions of polynomials, all of the same length. Thus, only FPTs and FFT's of the same length are required. As a consequence, the architecture is more regular and naturally suitable for a VLSI implementation.>