Hardware efficient fast computation of the discrete Fourier transform

DOI10.1007/S11265-005-4187-4MaRDI QIDQ2432132zbMATH OpenOpenAlexFDO

Authors Chao Cheng, Keshab K. Parhi

Publication date 25 October 2006

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11265-005-4187-4

zbMATH Keywords

discrete Fourier transformcyclic convolutionsystolic arrayWinograd Fourier Transform algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• On the structure of efficient DFT algorithms
• A novel approach to fast discrete Fourier transform
• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• An efficient design for one-dimensional discrete Hartley transform using parallel additions
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)

Cites work

• scientific article; zbMATH DE number 44502 (Why is no real title available?)
• A New Array Architecture for Prime-Length Discrete Cosine Transform
• A new systolic array for discrete Fourier transform
• A new systolic realization for the discrete Fourier transform
• A systolic array architecture for the discrete sine transform
• An introduction to programming the Winograd Fourier transform algorithm (WFTA)
• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• The efficient memory-based VLSI array designs for DFT and DCT

Cited in

(13)

• An efficient design for one-dimensional discrete Hartley transform using parallel additions
• A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
• Efficient matched filters for DFT based codes
• Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
• A new discrete Fourier transform algorithm using butterfly structure fast convolution
• scientific article; zbMATH DE number 4129958 (Why is no real title available?)
• Special purpose hardware for discrete Fourier transform implementation
• On the structure of efficient DFT algorithms
• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• Pruning fast Fourier transform algorithm design using group-based method
• Rapid Computation of the Discrete Fourier Transform
• Self-Sorting In-Place Fast Fourier Transforms
• Fast discrete Fourier transform computations using the reduced adder graph technique

This page was built for publication: Hardware efficient fast computation of the discrete Fourier transform

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