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

DOI10.1007/S11265-006-7510-9zbMath1101.65120OpenAlexW2070853931MaRDI QIDQ2505083

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 examplesfast Fourier transformerror analysisdiscrete Fourier transformdigital signal processingdiscrete cosine transformrandom search algorithmdiscrete 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

• Unnamed Item
• Unnamed Item
• The integer transforms analogous to discrete trigonometric transforms
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Split vector-radix fast Fourier transform
• On the Computation of the Discrete Cosine Transform
• Integer DCTs and fast algorithms
• Integer fast Fourier transform

This page was built for publication: Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations