Characteristic Analysis of Normalized D-QR-RLS Algorithm (Ⅰ) 


Vol. 32,  No. 8, pp. 782-787, Aug.  2007


PDF
  Abstract

This paper presents the D(Diagonal)-QR-RLS algorithm which normalizes the fast algorithm minimizes the MSE by using Givens rotated inputs and analyzes its characteristic. This proposed one has computational complexity of O(N) and the merit that it obtains the coefficients of TDL filter directly. Although this proposed normalized algorithm has the similar form to NLMS algorithm, we can see that D-QR-RLS has superior convergence characteristic to NLMS by computer simulation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

B. Ahn, J. Hwang, J. Cho, "Characteristic Analysis of Normalized D-QR-RLS Algorithm (Ⅰ)," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 782-787, 2007. DOI: .

[ACM Style]

Bong-Man Ahn, JeeWon Hwang, and Juphil Cho. 2007. Characteristic Analysis of Normalized D-QR-RLS Algorithm (Ⅰ). The Journal of Korean Institute of Communications and Information Sciences, 32, 8, (2007), 782-787. DOI: .

[KICS Style]

Bong-Man Ahn, JeeWon Hwang, Juphil Cho, "Characteristic Analysis of Normalized D-QR-RLS Algorithm (Ⅰ)," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 782-787, 8. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880