On the Fixed-Point Accuracy Analysis of FFT Algorithms

DOI10.1109/TSP.2008.924637MaRDI QIDQ4569099zbMATHFDO

Authors Wei-Hsin Chang, Truong Q. Nguyen

Publication date 27 June 2018

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

Mathematics Subject Classification ID

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

Cited in

(10)

• scientific article; zbMATH DE number 2147607 (Why is no real title available?)
• Roundoff error analysis of the recursive moving window discrete Fourier transform
• Fixed-Point Analysis and Parameter Optimization of the Radix-<formula formulatype="inline"><tex Notation="TeX">$2^{k}$</tex> </formula> Pipelined FFT Processor
• Analysis of error in the fixed-point implementation of two-dimensional discrete wavelet transforms
• Componentwise error analysis for FFTs with applications to fast Helmholtz solvers
• Some results in fixed point error analysis of the Bruun-FTT algorithm
• scientific article; zbMATH DE number 5521053 (Why is no real title available?)
• Improved FFT approximations of probability functions based on modified quadrature rules
• scientific article; zbMATH DE number 4104354 (Why is no real title available?)
• Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions

This page was built for publication: On the Fixed-Point Accuracy Analysis of FFT Algorithms

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