Abstract
A unified set of algorithms is presented to define the intraconnection and phase rotation structure of flow graphs for arbitrary fast Fourier transforms (FFTs). The same set of basic equations is applied to arbitrary-length FFTs; mixed-radix FFTs; either decimation-in-time or decimation-in-frequency FFTs; and FFTs with ordered inputs, ordered outputs, or both. These equations, which define input and output point indexing of each FFT stage and the twiddle factors used in each stage, are based on forward and backward products of radixes. The same basic products of radixes can be used to represent a wide variety of FFT structures. These equations also permit HOL (high-order language) specification of FFTs for programming signal processors.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 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.
