Efficient VLSI Architectures for the Arithmetic Fourier Transform (AFT)

DOI10.1109/TSP.1993.193152MaRDI QIDQ4034648zbMATH OpenFDO

Authors Brian T. Kelley, Vijay Madisetti

Publication date 16 May 1993

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

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

Mathematics Subject Classification ID

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

Cited in

(2)

• Dirichlet characters, Gauss sums and arithmetic Fourier transforms
• The Möbius inversion and Fourier coefficients.

This page was built for publication: Efficient VLSI Architectures for the Arithmetic Fourier Transform (AFT)

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