Abstract
This paper examines the structure of the prime length discrete Fourier transform algorithms that are developed by Winograd's approach. It is shown that those algorithms have considerable structure, and this can be exploited to develop a straightforward design procedure which does not use the Chinese remainder theorem and which includes any allowed permutations. This structure also allows the design of real-data programs and the improvement of the data transfer properties of the prime factor algorithm.
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.
