Abstract
An algorithm for computing the large discrete Fourier transform (DFT) coefficients of a correlated data sequence is introduced. A novel formulation of the decimation-in-frequency (DIF) fast Fourier transform (FFT) algorithm is introduced which generalizes the decimation method FFT algorithm. The radix-2 DIF FFT algorithm is modified to introduce an efficient algorithm for computing the DFT coefficients larger than a given threshold. This algorithm significantly reduces the computations associated with the small coefficients. Results are extended to all the DIF-based FFT algorithms as well as the multidimensional FFT and the FFT-based fast discrete cosine transform algorithm.< <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 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.
