Computationally efficient systolic architecture for computing the discrete Fourier transform

DOI10.1109/TSP.2005.859216MaRDI QIDQ5355909zbMATH OpenFDO

Authors J. Greg Nash

Publication date 20 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2005.859216

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Cited in

(4)

• Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
• Efficient DFT Architectures Based Upon Symmetries
• Systolic implementation of real-valued discrete transforms via algebraic integer quantization
• Triple-matrix product-based 2D systolic implementation of discrete Fourier transform

This page was built for publication: Computationally efficient systolic architecture for computing the discrete Fourier transform

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