Open AccessDOI
An Economical Method for Calculating the Discrete Fourier Transform
Reads0
Chats0
TLDR
The Cooley-Tukey Algorithm as discussed by the authors was developed to compute the Discrete Fourier Transform for a large number of input points in relatively reasonable times, however, for certain uses a demand developed for computing the Fourier transform in a very short time or even in real time.Abstract:
With the advent of digital computers it became possible to compute the Discrete Fourier Transform for a large number of input points in relatively reasonable times. However, for certain uses a demand developed to compute the Discrete Fourier Transform in a very short time or even in real time. Also, a demand developed for computing the Fourier Transform for a very large number of input points. These demands resulted in a requirement for computing the Fourier Transform in the fastest time possible. A very economical way for computing the Fourier Transform was developed a few years ago and is known as the Cooley-Tukey Algorithm. This article describes another algorithm for computing the Discrete Fourier Transform where the required number of additions and subtractions is the same as in the Cooley-Tukey Algorithm; but the required number of multiplications is only one half of that in the Cooley-Tukey Algorithm.read more
Citations
More filters
Journal ArticleDOI
End-to-End Energy Modeling and Analysis of Long-Haul Coherent Transmission Systems
Bipin Sankar Gopalakrishna Pillai,Behnam Sedighi,Kyle Guan,N. Prasanth Anthapadmanabhan,William Shieh,Kerry Hinton,Rodney S. Tucker +6 more
TL;DR: It is found that receiver energy consumption dominates in transmission systems that use electronic dispersion compensation over long transmission distances, and for short transmission distances where hard-decision decoding is adequate for both modulation formats, DP-16-QAM is more energy efficient than DP-QPSK.
Journal ArticleDOI
Cache-efficient numerical algorithms using graphics hardware
TL;DR: The approach achieves high memory performance on GPUs by tiling the computation and thereby improving the cache-efficiency, and uses this approach to improve the performance of GPU-based sorting, fast Fourier transform and dense matrix multiplication algorithms.
Book ChapterDOI
The tangent FFT
TL;DR: The tangent FFT is presented, a straightforward in-place cache-friendly DFT algorithm having exactly the same operation counts as Van Buskirk's algorithm, and it is pinpoints how the tangentFFT saves time compared to the split-radix FFT.
Dissertation
Development of a New Transform:MRT
TL;DR: An approach of grouping data on the basis of the corresponding phase of the exponential kernel of the DFT is exploited to introduce a new digital signal transform, named the M-dimensional Real Transform (MRT), for l-D and 2-D signals.
Journal ArticleDOI
World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s
TL;DR: This paper presents the fastest fast Fourier transform (FFT) hardware architectures so far based on a fully parallel implementation of the FFT algorithm, and shows that it is possible to break the barrier of 100 GS/s for FFT calculation.
References
More filters
Journal ArticleDOI
End-to-End Energy Modeling and Analysis of Long-Haul Coherent Transmission Systems
Bipin Sankar Gopalakrishna Pillai,Behnam Sedighi,Kyle Guan,N. Prasanth Anthapadmanabhan,William Shieh,Kerry Hinton,Rodney S. Tucker +6 more
TL;DR: It is found that receiver energy consumption dominates in transmission systems that use electronic dispersion compensation over long transmission distances, and for short transmission distances where hard-decision decoding is adequate for both modulation formats, DP-16-QAM is more energy efficient than DP-QPSK.
Journal ArticleDOI
Cache-efficient numerical algorithms using graphics hardware
TL;DR: The approach achieves high memory performance on GPUs by tiling the computation and thereby improving the cache-efficiency, and uses this approach to improve the performance of GPU-based sorting, fast Fourier transform and dense matrix multiplication algorithms.
Book ChapterDOI
The tangent FFT
TL;DR: The tangent FFT is presented, a straightforward in-place cache-friendly DFT algorithm having exactly the same operation counts as Van Buskirk's algorithm, and it is pinpoints how the tangentFFT saves time compared to the split-radix FFT.
Dissertation
Development of a New Transform:MRT
TL;DR: An approach of grouping data on the basis of the corresponding phase of the exponential kernel of the DFT is exploited to introduce a new digital signal transform, named the M-dimensional Real Transform (MRT), for l-D and 2-D signals.
Journal ArticleDOI
World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s
TL;DR: This paper presents the fastest fast Fourier transform (FFT) hardware architectures so far based on a fully parallel implementation of the FFT algorithm, and shows that it is possible to break the barrier of 100 GS/s for FFT calculation.