DocumentCode :
3625373
Title :
Recursive Least-Squares Lattice Adaptive Algorithm Suitable for Fixed-Point Implementation
Author :
Constantin Paleologu;Andrei Alexandru Enescu;Silviu Ciochina
Author_Institution :
Department of Telecommunications, Politehnica University of Bucharest, Bucharest, Romania. pale@comm.pub.ro
fYear :
2006
Firstpage :
1105
Lastpage :
1108
Abstract :
This paper proposes a version of recursive least-squares lattice (RLSL) adaptive algorithm suitable for fixed-point implementation. It is based on a modified form of the cost function in order to obtain an asymptotically unbiased estimator of the mean-square error, reducing significantly the dynamic range of the algorithm´s parameters. Moreover, in order to achieve an enhanced numerical accuracy an error-feedback mechanism is employed. These improvements lead to facilities for fixed-point implementations.
Keywords :
"Lattices","Adaptive algorithm","Signal processing algorithms","Cost function","Dynamic range","Estimation error","Least squares approximation","Computational complexity","Least squares methods","Quantization"
Publisher :
ieee
Conference_Titel :
Electronics, Circuits and Systems, 2006. ICECS ´06. 13th IEEE International Conference on
Print_ISBN :
1-4244-0394-4
Type :
conf
DOI :
10.1109/ICECS.2006.379632
Filename :
4263564
Link To Document :
بازگشت