Abstract
We continue the program, initiated by the authors ( IEEE Trans. Acoust. Speech Signal Process., in press), of designing multiplicative FFT algorithms with highly structured data flow. In this paper, we take up the cases of transform sizes N, N = p 2 and p k , p an odd prime. These algorithms have operational counts close to the Winograd algorithm, but they have a better structure, which simplifies their implementation. Two algorithms are given in this paper for N = p 2. The first is suited for parallel computing. The second has a better operational count and is suited for conventional serial machines.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
