A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM
نویسندگان
چکیده
منابع مشابه
The Cooley - Tukey Fast Fourier Transform Algorithm ∗
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so years that followed, various extensions and modi cations were made to the original algorithm [6]. By the early 1970's the practical programs were basically in the form used today. The standard develo...
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملUsing a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملAn Equivariant Fast Fourier Transform Algorithm
This paper presents a generalization of the Cooley-Tukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount of memory used. The symmetries accommodated by the algorithm include all of the crystallographic...
متن کاملCooley - Tukey FFT on the Connection
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make e ective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Korean Journal of Mathematics
سال: 2011
ISSN: 1976-8605
DOI: 10.11568/kjm.2011.19.3.243