Title :
Fast biased polynomial transforms for 2D prime length discrete Fourier transforms
Author :
Wu, Ja-Ling ; Pei, Soo-Chang
Author_Institution :
Tatung Institute of Technology, Department of Electrical Engineering, Taipei, Republic of China
Abstract :
The fast biased polynomial transform (FBPT) is defined directly over a ZN ¿ 1 ring instead of the conventional cyclotomic polynomial rings. For N prime, these FBPTs can be used for the efficient evaluation of the 2D prime length DFT.
Keywords :
fast Fourier transforms; polynomials; 2D prime length DFT; FBPTs; discrete Fourier transforms; fast biased polynomial transform;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19840634
