Proceedings ArticleDOI
Fast computation of the two-dimensional discrete Fourier transform
D. Sundararajan,M.O. Ahmad +1 more
- Vol. 2, pp 759-762
TLDR
In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented that uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix 1-D algorithm.Abstract:
In this paper, a new radix-2 2-D decimation-in-time discrete Fourier transform algorithm is presented. This algorithm uses an approach employing vectorized data to reduce the structural overhead of the algorithm compared with the Cooley-Tukey radix-2 2-D algorithm. Computational complexity and run-time comparison of the algorithm are also provided.read more
Citations
More filters
Journal ArticleDOI
Vector computation of the discrete Fourier transform
TL;DR: A generalized version of a new family of DFT algorithms is developed by decomposing a form of the DFT relation in which the input data and transform quantities are represented as vectors, which makes it easier to deduce a large family of algorithms with different features.
References
More filters
Proceedings ArticleDOI
FFT implementation on DSP-chips-theory and practice
R. Meyer,K. Schwarz +1 more
TL;DR: The problem of comparing different algorithms for the execution of the fast Fourier transform (FFT) is considered by using the necessary number of instruction cycles for an FFT implementation on different digital signal processors (DSPs) as a measure.
Proceedings ArticleDOI
Equivalent relationship and unified indexing of FFT algorithm
TL;DR: It is shown that the multidimensional (M-D) FFT can be represented by the same vector-matrix form as the 1-D FFT.