.png){kind=icon}
Return
An extended split-radix FFT algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/97.917698.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An extended split-radix fast Fourier transform (FFT) algorithm is proposed. The extended split-radix FFT algorithm hits the same asymptotic arithmetic complexity as the conventional split-radix FFT algorithm. Moreover, this algorithm has the advantage of fewer loads and stores than either the conventional split-radix FFT algorithm or the radix-4 FFT algorithm.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave