A VLSI architecture for simplified arithmetic Fourier transform algorithm
From MaRDI portal
Recommendations
Cited in
(13)- A multiplication-free algorithm and a parallel architecture for affine transformation
- The arithmetic Fourier transform and real neural networks: Summability by primes
- Dirichlet characters, Gauss sums and arithmetic Fourier transforms
- Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
- scientific article; zbMATH DE number 3896293 (Why is no real title available?)
- An integer approximation method for discrete sinusoidal transforms
- Dirichlet characters, Gauss sums, and inverse Z transform
- scientific article; zbMATH DE number 1206037 (Why is no real title available?)
- A VLSI architecture for the real time computation of discrete trigonometric transforms
- scientific article; zbMATH DE number 2172639 (Why is no real title available?)
- scientific article; zbMATH DE number 922636 (Why is no real title available?)
- scientific article; zbMATH DE number 2188853 (Why is no real title available?)
- A VLSI array architecture for realization of DFT, DHT, DCT and DST
This page was built for publication: A VLSI architecture for simplified arithmetic Fourier transform algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4008684)