Title :
Two-variable modularized fast polynomial transform algorithm for 2-D discrete Fourier transforms
Author :
WU, JA-LING ; Huang, Y.-M.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
3/1/1992 12:00:00 AM
Abstract :
A novel two-variable modularized fast polynomial transform (FPT) algorithm is presented. In this method, only fast polynomial transforms and fast Fourier transforms of the same length are required. The modularity, regularity, and easy extensibility of the proposed algorithm make it of great practical value in computing multidimensional discrete Fourier transforms (DFTs)
Keywords :
computerised signal processing; fast Fourier transforms; 2-D discrete Fourier transforms; FPT algorithm; digital signal processing; extensibility; fast Fourier transforms; fast polynomial transforms; modularity; multidimensional DFT; regularity; two-variable modularised fast polynomial transform algorithm; Convolution; Digital signal processing; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Multidimensional signal processing; Multidimensional systems; Polynomials; Signal processing algorithms; Very large scale integration;
Journal_Title :
Circuits and Systems for Video Technology, IEEE Transactions on
