DocumentCode
302623
Title
Vector split-radix algorithm for DFT computation
Author
Sundararajan, D. ; Ahmad, M.O.
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
2
fYear
1996
fDate
12-15 May 1996
Firstpage
532
Abstract
Recently, a new family of DFT algorithms, designated as the PM family of DFT algorithms, with improved structural complexity has been reported. In these algorithms, a better performance is achieved by using an approach employing vectorized data. In the present paper, a new split-radix algorithm for DFT computation using this approach is developed
Keywords
computational complexity; discrete Fourier transforms; mathematics computing; DFT algorithms; DFT computation; PM family; structural complexity; vector split-radix algorithm; vectorized data; Algorithm design and analysis; Arithmetic; Computational complexity; Discrete Fourier transforms; Equations; Pressing; Software algorithms; Time domain analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location
Atlanta, GA
Print_ISBN
0-7803-3073-0
Type
conf
DOI
10.1109/ISCAS.1996.541779
Filename
541779
Link To Document