Fast discrete Fourier transform computations using the reduced adder graph technique

DOI10.1155/2007/67360zbMath1168.65432OpenAlexW2004624257MaRDI QIDQ838581

Hariharan Natarajan, Andrew G. Dempster, Uwe Meyer-Baese

Publication date: 1 September 2009

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

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)

Cites Work

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

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