Efficient VLSI Architectures for the Arithmetic Fourier Transform (AFT)
From MaRDI portal
Publication:4034648
DOI10.1109/TSP.1993.193152zbMath0825.94291MaRDI QIDQ4034648
Vijay Madisetti, Brian T. Kelley
Publication date: 16 May 1993
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items (2)
The Möbius inversion and Fourier coefficients. ⋮ Dirichlet characters, Gauss sums and arithmetic Fourier transforms
This page was built for publication: Efficient VLSI Architectures for the Arithmetic Fourier Transform (AFT)