Abstract
The number of real operations and memory is presented for three efficient Fortran algorithms which compute the mixed radix discrete Fourier transform (DFT). It is shown that Singleton's mixed radix algorithm (MFFT) is the most flexible and uses the least memory, while the Winograd Fourier transform algorithm (WFTA) and Kolba-Parks prime factor algorithm (PFA) are the most efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
