A New Variable Regularized QR Decomposition-Based Recursive Least M-Estimate Algorithm—Performance Analysis and Acoustic Applications

2013 ◽  
Vol 21 (5) ◽  
pp. 907-922 ◽  
Author(s):  
S. C. Chan ◽  
Y. J. Chu ◽  
Z. G. Zhang ◽  
K. M. Tsui
2008 ◽  
Vol 54 (3) ◽  
pp. 1124-1138 ◽  
Author(s):  
Mohammad Ali Maddah-Ali ◽  
Mehdi Ansari Sadrabadi ◽  
Amir K. Khandani

2011 ◽  
Vol 181-182 ◽  
pp. 109-112
Author(s):  
Xian Min Wei

This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.


Sign in / Sign up

Export Citation Format

Share Document