On the Complex-Valued Recursive Least Squares Escalator Algorithm with Reduced Computational Complexity 


Vol. 34,  No. 5, pp. 521-526, May  2009


PDF
  Abstract

In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.

  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]

N. Kim, "On the Complex-Valued Recursive Least Squares Escalator Algorithm with Reduced Computational Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 5, pp. 521-526, 2009. DOI: .

[ACM Style]

Namyong Kim. 2009. On the Complex-Valued Recursive Least Squares Escalator Algorithm with Reduced Computational Complexity. The Journal of Korean Institute of Communications and Information Sciences, 34, 5, (2009), 521-526. DOI: .

[KICS Style]

Namyong Kim, "On the Complex-Valued Recursive Least Squares Escalator Algorithm with Reduced Computational Complexity," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 5, pp. 521-526, 5. 2009.