DocumentCode
1623604
Title
Efficient computation of the DFT for some transform lengths that are not integral powers of two
Author
Sundararajan, D. ; Ahmad, M.O.
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
2
fYear
1996
Firstpage
777
Abstract
In this paper, it is shown that radix-2 discrete Fourier transform algorithms can be designed for some transform lengths that are not integral powers of two. These algorithms reduce the overhead operations significantly compared with the mixed-radix algorithms. A specific algorithm is described in detail and its computational complexity and run-time performance are compared with the corresponding mixed-radix algorithm
Keywords
computational complexity; digital arithmetic; discrete Fourier transforms; DFT computation; computational complexity; mixed-radix algorithms; overhead operations; radix-2 discrete Fourier transform algorithms; run-time performance; transform lengths; Algorithm design and analysis; Arithmetic; Computational complexity; Discrete Fourier transforms; Fourier transforms; Power engineering computing; Runtime; Signal processing algorithms; Software algorithms; Software performance;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996., IEEE 39th Midwest symposium on
Conference_Location
Ames, IA
Print_ISBN
0-7803-3636-4
Type
conf
DOI
10.1109/MWSCAS.1996.588024
Filename
588024
Link To Document