Fast discrete Fourier transform computations using the reduced adder graph technique

DOI10.1155/2007/67360MaRDI QIDQ838581zbMATH OpenOpenAlexFDO

Authors Hariharan Natarajan, Andrew G. Dempster, Uwe Meyer-Bäse

Publication date 1 September 2009

Published in EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2007/67360

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• Fast DFT algorithms for length \(N=q*2^m\)
• On computation of certain discrete Fourier transforms using binary calculus
• Hardware efficient fast computation of the discrete Fourier transform

Cites work

• Constant integer multiplication using minimum adders
• Index mappings for multidimensional formulation of the DFT and convolution
• Multiplierless implementation of rotators and FFTs
• Partial column FFT pipelines
• Use of minimum-adder multiplier blocks in FIR digital filters

Cited in

(3)

• Computationally efficient methods for analysis and synthesis of real signals using FFT and IFFT
• Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
• The regularized fast Hartley transform. Optimal formulation of real-data fast Fourier transform for silicon-based implementation in resource-constrained environments.

This page was built for publication: Fast discrete Fourier transform computations using the reduced adder graph technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838581)