Abstract
A new fast Fourier transform algorithm is presented. The decimation-in-time (DIT) and the decimation-in-frequency (DIF) FFT algorithms are combined to introduce a new FFT algorithm, decimation-in-time-frequency (DITF) FFT algorithm, which reduces the number of real multiplications and additions. The DITF FFT algorithm reduces the arithmetic complexity while using the same computational structure as the conventional Cooley-Tukey (CT) FFT algorithm. The algorithm is extended to radix-R FFT as well as the multidimensional FFT algorithm using the vector-radix FFT. >
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.
