Title :
Modularised fast polynomial transform algorithms for two-dimensional digital signal processing
Author :
Wu, J.-L. ; Huang, Y.-M.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
8/1/1990 12:00:00 AM
Abstract :
Novel, modularised, fast polynomial transform (FPT) algorithms for computing 2-D convolutions and 2-D discrete Fourier transforms are presented. In these new methods, only fast polynomial transforms, fast Fourier transforms and number theoretic transforms of the same length are required. Consequently the modularity and regularity of the proposed algorithms make them of great practical value in the concurrent implementation of the parallel-pipeline FPT for 2-D digital signal-processing tasks
Keywords :
fast Fourier transforms; parallel algorithms; pipeline processing; polynomials; signal processing; transforms; 2-D convolutions; 2-D discrete Fourier transforms; DFT; FFT; fast Fourier transforms; fast polynomial transform algorithms; modularity; number theoretic transforms; parallel-pipeline FPT; regularity; two-dimensional digital signal processing;
Journal_Title :
Radar and Signal Processing, IEE Proceedings F
