This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Networking (icn 2008)
Square-Root-Free QRD-LSL Adaptive Algorithm with Improved Numerical Robustness
April 13-April 18
ISBN: 978-0-7695-3106-9
The QR-decomposition-based least-squares lattice (QRD-LSL) algorithm is one of the most attractive choices for adaptive filters applications, mainly due to its fast convergence rate and good numerical properties. In practice, the square-root-free QRD-LSL (SRF-QRD-LSL) algorithms are frequently employed, especially when fixed-point digital signal processors (DSPs) are used for implementation. In this context, there are some major limitations regarding the large dynamic range of the algorithm’s cost functions. Consequently, hard scaling operations are required, which further reduce the precision of numerical representation and lead to performance degradation. In this paper we propose a SRF-QRD-LSL algorithm based on a modified update of the cost functions, which offers improved numerical robustness. Simulations performed in fixed-point and logarithmic number system (LNS) implementation support the theoretical findings.
Index Terms:
Adaptive filters, fixed-point arithmetic, logarithmic number system (LNS), QR-decomposition-based least-squares lattice (QRD-LSL)
Citation:
Constantin Paleologu, Felix Albu, Andrei Alexandru Enescu, Silviu Ciochina, "Square-Root-Free QRD-LSL Adaptive Algorithm with Improved Numerical Robustness," icn, pp.572-577, Seventh International Conference on Networking (icn 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.