Fixed point error analysis of the normalized ladder algorithm
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper, an attempt is made to analyze the fixed point error performance of the normalized ladder algorithm for autoregressive system identification, assuming rounding arithmetic. The paper contains two main results; i) A simplified theoretical expression for predicting the average bias in the estimated reflection coefficients at any stage, and ii) a recursive relation for the average error, arising from finite precision arithmetic, in the squared residuals. The second result illustrates how the errors made in one stage affect the errors in the succeeding stages. Simulations are performed to check the theorical predictions.Keywords
This publication has 4 references indexed in Scilit:
- Recursive least squares ladder estimation algorithmsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Effect of correlation between transactions errors on fixed-point fast Fourier transform analysisIEEE Transactions on Circuits and Systems, 1980
- Fixed-point fast Fourier transform error analysisIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Effects of finite register length in digital filtering and the fast Fourier transformProceedings of the IEEE, 1972