A VLSI architecture for simplified arithmetic Fourier transform algorithm

DOI10.1109/78.134475zbMath0755.65143OpenAlexW2116401656MaRDI QIDQ4008684

Ming-Tang Shih, Donald Winston Tufts, Ebbe Hendon, Irving S. Reed, Trieu-Kien Truong

Publication date: 27 September 1992

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

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

zbMATH Keywords

complexityarithmetic Fourier transformparallel processingVLSI architecturebutterfly structuredata-flow methods

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

An integer approximation method for discrete sinusoidal transforms ⋮ Dirichlet characters, Gauss sums, and inverse \(Z\) transform ⋮ Dirichlet characters, Gauss sums and arithmetic Fourier transforms

This page was built for publication: A VLSI architecture for simplified arithmetic Fourier transform algorithm