Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
From MaRDI portal
Publication:2505083
Recommendations
- Multiplierless implementation of rotators and FFTs
- Novel design of multiplier-less FFT processors
- Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
- Modified FFTs for Fused Multiply-Add Architectures
- Simple FFT and DCT algorithms with reduced number of operations.
Cites work
- scientific article; zbMATH DE number 43706 (Why is no real title available?)
- scientific article; zbMATH DE number 1033191 (Why is no real title available?)
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- Integer DCTs and fast algorithms
- Integer fast Fourier transform
- On the Computation of the Discrete Cosine Transform
- Split vector-radix fast Fourier transform
- The integer transforms analogous to discrete trigonometric transforms
This page was built for publication: Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505083)