On the Fixed-Point Accuracy Analysis of FFT Algorithms

DOI10.1109/TSP.2008.924637zbMATH Open1390.94122MaRDI QIDQ4569099FDOQ4569099

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)

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

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)