Abstract

Starting from an index mapping for one to multi-dimensions, a general in-place and in-order prime factor FFT algorithm is proposed in this paper. In comparing with existing prime factor FFT algorithms, this algorithm saves about half of the required storage capacity and possesses a higher efficiency. In addition, this algorithm can easily implement the DFT and IDFT in a single subroutine.

Full Text

Published Version

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 call

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.