Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICASSP
2011
IEEE

favoriteEmaildiscussreport

214views Signal Processing» more ICASSP 2011»

The Centered Discrete Fourier Transform and a parallel implementation of the FFT

12 years 8 months ago

The Centered Discrete Fourier Transform and a parallel implementation of the FFT

Download mirlab.org

This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the Centered DFT to provide an FFT that requires no complex multiplications and which allows a highly parallel implementation.

Dale H. Mugler

Real-time Traffic

Centered Dft | Complex Multiplications | Discrete Fourier Transform | ICASSP 2011 | Signal Processing |

claim paper

Related Content

» Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling

» Parallel FFT with Eden Skeletons

» Small Discrete Fourier Transforms on GPUs

» Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data

» New algorithms for computing directional discrete Fourier transforms

» Generating high performance pruned FFT implementations

» Parallel FFT computation with a CDMAbased networkonchip

» FFTC Fastest Fourier Transform for the IBM Cell Broadband Engine

» A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Anal...

Post Info
More Details (n/a)

Added	21 Aug 2011
Updated	21 Aug 2011
Type	Journal
Year	2011
Where	ICASSP
Authors	Dale H. Mugler

Comments (0)