Integer fast Fourier transform

DOI10.1109/78.984749MaRDI QIDQ5353579zbMATH OpenOpenAlexFDO

Authors Soontorn Oraintara, Ying-Jui Chen, Truong Q. Nguyen

Publication date 8 September 2017

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

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

Mathematics Subject Classification ID

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

Cited in

(8)

• A global method for invertible integer DCT and integer wavelet algorithms
• Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
• Quantum circuit for the fast Fourier transform
• An integer approximation method for discrete sinusoidal transforms
• Fourier transform bounded Kolmogorov complexity
• Multiple radix fast Fourier transformation based on number theoretic transforms
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
• Fixed wordsize implementation of lifting schemes

This page was built for publication: Integer fast Fourier transform

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