Concurrent Equalizer with Squared Error Weight-Based Tap Coefficients Update 


Vol. 36,  No. 3, pp. 157-162, Mar.  2011


PDF
  Abstract

For blind equalization of communication channels, concurrent equalization is useful to improve convergence characteristics. However, the concurrent equalization will result in limited performance enhancement by continuing concurrent adaptation with two algorithms after the equalizer converges to steady-state. In this paper, to improve the convergence characteristics and steady-state performance of the concurrent equalization, proposed is a new concurrent equalization technique with variable step-size parameter and weight-based tap coefficients update. The proposed concurrent vsCMA+DD equalization calculates weight factors using error signals of the variable step-size CMA (vsCMA) and DD (decision-directed) algorithm, and then updates the two equalizers based on the weights respectively. The proposed method, first, improves the error performance of the CMA by the vsCMA, and enhances the steady-state performance as well as the convergence speed further by the weight-based tap coefficients update. The performance improvement by the proposed scheme is verified through simulations.

  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]

K. N. Oh, "Concurrent Equalizer with Squared Error Weight-Based Tap Coefficients Update," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 3, pp. 157-162, 2011. DOI: .

[ACM Style]

Kil Nam Oh. 2011. Concurrent Equalizer with Squared Error Weight-Based Tap Coefficients Update. The Journal of Korean Institute of Communications and Information Sciences, 36, 3, (2011), 157-162. DOI: .

[KICS Style]

Kil Nam Oh, "Concurrent Equalizer with Squared Error Weight-Based Tap Coefficients Update," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 3, pp. 157-162, 3. 2011.