An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions
暂无分享，去创建一个
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. >
[1] H. Nussbaumer,et al. Fast polynomial transform algorithms for digital convolution , 1980 .
[2] Trieu-Kien Truong,et al. On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution , 1981 .
[3] Paolo Corsini,et al. Properties of the Multidimensional Generalized Discrete Fourier Transform , 1979, IEEE Transactions on Computers.
[4] P.J.W. Rayner,et al. Efficient transforms for multidimensional convolutions , 1979 .