A new set of minimum-add small-n rotated DFT modules
From MaRDI portal
Publication:1098609
DOI10.1016/0021-9991(88)90106-4zbMath0637.65146OpenAlexW1984156273MaRDI QIDQ1098609
Publication date: 1988
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(88)90106-4
algorithmdiscrete Fourier transformWinograd's algorithmmutually prime number of dataself-sorting, in-place Fourier transform
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A new matrix approach to real FFTs and convolutions of length \(2^k\) ⋮ Nesting strategies for prime factor FFT algorithms
Cites Work
- Self-sorting mixed-radix fast Fourier transforms
- A note on prime factor FFT algorithms
- Fast mixed-radix real Fourier transforms
- Implementation of a self-sorting in-place prime factor FFT algorithm
- A self-sorting in-place prime factor real/half-complex FFT algorithm
- Implementation of a prime factor FFT algorithm on CRAY-1
- An in-place, in-order prime factor FFT algorithm
- Implementation of the in-order prime factor transform for variable sizes
- On Computing the Discrete Fourier Transform
This page was built for publication: A new set of minimum-add small-n rotated DFT modules
