Abstract
It is well known that the discrete Fourier transformation (DFT) of a real-valued sequence contains some redundancies. More precisely, approximately half of the DFT coefficients suffice to completely determine the DFT. In this paper, it is shown that the choice of the set of (nonredundant) DFT coefficients to be calculated affects the efficiency of the resulting algorithm. One especially interesting choice is discussed in detail for the case of mixed radix-(2, 3) DFT algorithms. Algorithms for the DFT calculation of both one and more dimensional real-valued arrays are discussed.
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.
