Integer fast Fourier transform

DOI10.1109/78.984749zbMath1369.65189OpenAlexW2091477520MaRDI QIDQ5353579

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

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

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

Related Items (7)

Fixed wordsize implementation of lifting schemes ⋮ Quantum circuit for the fast Fourier transform ⋮ An integer approximation method for discrete sinusoidal transforms ⋮ Fourier transform bounded Kolmogorov complexity ⋮ 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 ⋮ Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization

This page was built for publication: Integer fast Fourier transform