Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations

DOI10.1007/S11265-006-7510-9zbMATH Open1101.65120OpenAlexW2070853931MaRDI QIDQ2505083FDOQ2505083

Yanyan Li

Publication date: 29 September 2006

Published in: Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11265-006-7510-9

zbMATH Keywords

numerical exampleserror analysisdiscrete Fourier transformfast Fourier transformdiscrete cosine transformrandom search algorithmdigital signal processingdiscrete W transformmultiplier-less approximationsum-of-powers-of-two

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer fast Fourier transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• On the Computation of the Discrete Cosine Transform
• Split vector-radix fast Fourier transform
• Integer DCTs and fast algorithms
• The integer transforms analogous to discrete trigonometric transforms

   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. 👍 👎

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)