This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Fifth Advanced International Conference on Telecommunications
QRD-LSL Adaptive Alogrithms Suitable for Fixed-Point Implementation
Venice/Mestre, Italy
May 24-May 28
ISBN: 978-0-7695-3611-8
In a previous study we proposed a modified version of the recursive least-square (RLS) adaptive algorithm suitable for fixed-point implementation. Using an asymptotically unbiased estimator for the algorithm's cost function we reduced the dynamic range of this parameter. In this paper, we extend the procedure for the case of QR-decomposition-based least-squares lattice (QRD-LSL) adaptive algorithm, a "fast" member of RLS family, with good numerical properties. The reduced dynamics of the algorithm’s parameters leads to facility for fixed-point implementation. The simulations performed on a fixed-point digital signal processor (DSP) sustain the practical aspects of the theoretical findings.
Index Terms:
adaptive filters, fixed-point implementation, QR-decomposition-based least-squares lattice (QRD-LSL) algorithm
Citation:
Constantin Paleologu, Andrei Alexandru Enescu, Silviu Ciochina, Felix Albu, "QRD-LSL Adaptive Alogrithms Suitable for Fixed-Point Implementation," aict, pp.163-167, 2009 Fifth Advanced International Conference on Telecommunications, 2009
Usage of this product signifies your acceptance of the Terms of Use.