Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse

DOI10.1109/78.875476zbMath1013.68003OpenAlexW2139269844MaRDI QIDQ2734424

Ching-Hsien Chang, Yu-Tai Chang, Chin-Liang Wang

Publication date: 9 July 2003

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

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

zbMATH Keywords

discrete Fourier transformVLSI architectures

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Numerical methods for discrete and fast Fourier transforms (65T50) Mathematical problems of computer architecture (68M07)

Related Items (3)

Calculation scheme based on a weighted primitive: application to image processing transforms ⋮ Hardware efficient fast computation of the discrete Fourier transform ⋮ Triple-matrix product-based 2D systolic implementation of discrete Fourier transform

This page was built for publication: Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse