Paper Info
Title
A Fast Algorithm Based on SRFFT for Length DFTs
Abstract
In this brief, we present a fast algorithm for computing length- q×2m discrete Fourier transforms (DFT). The algorithm divides a DFT of size- N = q×2m decimation in frequency into one length- N/2 DFT and two length- N/4 DFTs. The length- N/2 sub-DFT is recursively decomposed decimation in frequency, and the two size- N/4 sub-DFTs are transformed into two dimension and the terms with the same rotating factor are arranged in a column. Thus, the scaled DFTs (SDFTs) are obtained, simplifying the real multiplications of the proposed algorithm. A further improvement can be achieved by the application of radix-2/8, modified split-radix FFT (MSRFFT), and Wang's algorithm for computing its length- 2m and length- q sub-DFTs. Compared with the related algorithms, a substantial reduction of arithmetic complexity and more accurate precision are obtained.
Year
DOI
Venue
2014
10.1109/TCSII.2013.2291098
Circuits and Systems II: Express Briefs, IEEE Transactions  
Keywords
DocType
Volume
digital arithmetic,discrete Fourier transforms,MSRFFT,SDFT,Wang algorithm,arithmetic complexity,modified split-radix FFT,radix-2/8 split-radix FFT,real multiplications,recursively decomposed decimation,rotating factor,scaled discrete Fourier transforms,Fast Fourier transform (FFT),modified split-radix FFT (MSRFFT),radix 2/8 FFT algorithm,scaled discrete Fourier transform (SDFT),split-radix FFT (SRFFT)
Journal
61
Issue
ISSN
Citations 
2
1549-7747
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Weihua Zheng1173.39
Kenli Li21389124.28
Keqin Li3284.83