DocumentCode
2992341
Title
The unbiased least-squares lattice
Author
Swanson, David C. ; Symons, Frank W.
Author_Institution
The Pennsylvania State University, Pennsylvania
Volume
10
fYear
1985
fDate
31138
Firstpage
1189
Lastpage
1192
Abstract
A modification to both the unnormalized and normalized least-squares lattice algorithms is presented which produces unbiased estimates of the lattice parameters without a significant increase in algorithm complexity. Unbiased parameter estimation is very useful for improving the numerical precision of the least-squares lattice algorithm because the parameters representing statistical estimates remain essentially constant in magnitude for stationary input data. In the unnormalized algorithm the large magnitudes of the cross-correlation and covariance parameters are avoided while in the normalized algorithm the decreasing magnitudes of the error signals are kept at unity variance (not less than unity) through appropriate scaling of the lattice recursions. Both unbiased algorithms require an additional integer parameter representing the number of data observations used in the parameter estimates at each stage.
Keywords
Autocorrelation; Dynamic range; Educational institutions; Hardware; Laboratories; Lattices; Mathematics; Parameter estimation; Recursive estimation; State estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.
Type
conf
DOI
10.1109/ICASSP.1985.1168250
Filename
1168250
Link To Document