Fast and precise Fourier transforms

DOI10.1109/18.817519zbMath0998.65145OpenAlexW2098544052MaRDI QIDQ4503499

Volker Stemann, Joe P. Buhler, Mohammad Amin Shokrollahi

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

algorithmfast Fourier transformserror analysiscontinued fractionscyclotomic fieldsinteger linear programmingsignal processingcyclotomic unitscomputational noiseprediction filtersresidue number systemsChinese remainderingeffective Chebotarev theorem

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (1)

Quantization and Finite Frames

Uses Software

• PARI/GP

This page was built for publication: Fast and precise Fourier transforms