.png){kind=icon}
.png){kind=icon}
Return
Split Radix Algorithm for Length 6m DFT
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2013.2243143.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Discrete Fourier transform (DFT) is widespread used in many fields of science and engineering. DFT is implemented with efficient algorithms categorized as fast Fourier transform. A fast algorithm is proposed for computing a length-N = 6(m) DFT. The proposed algorithm is a blend of radix-3 and radix-6 FFT. It is a variant of split radix and can be flexibly implemented a length 2(r) x 3(m) DFT. Novel order permutation of sub-DFTs and reduction of the number of arithmetic operations enhance the practicability of the proposed algorithm. It inherently provides a wider choice of accessible FFT's lengths.
Keywords:
Discrete Fourier transform (DFT)
fast Fourier transform (FFT)
general split radix
radix 6
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W