• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/
Menu

A New Constant Modulus Algorithm based on Minimum Euclidian Distance Criterion for Blind Channel Equalization


Nam-Yong Kim, Journal of Internet Computing and Services, Vol. 10, No. 6, pp. 19-26, Dec. 2009
Full Text:
Keywords: PDF, CMA, Euclidian Distance, Blind Equalization, ITL

Abstract

In this paper, a minimum Euclidian distance criterion between error PDF and Dirac delta function is introduced and a constant modulus type blind equalizer algorithm based on the criterion is proposed. The proposed algorithm using constant modulus error in place of actual error term of the criterion has superior convergence and steady state MSE performance, and the error signal of the proposed algorithm exhibits more concentrated density function in blind equalization environments. Simulation results indicate that the proposed method can be a reliable candidate for blind equalizer algorithms for multipoint communications.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
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
[APA Style]
Kim, N. (2009). A New Constant Modulus Algorithm based on Minimum Euclidian Distance Criterion for Blind Channel Equalization. Journal of Internet Computing and Services, 10(6), 19-26.

[IEEE Style]
N. Kim, "A New Constant Modulus Algorithm based on Minimum Euclidian Distance Criterion for Blind Channel Equalization," Journal of Internet Computing and Services, vol. 10, no. 6, pp. 19-26, 2009.

[ACM Style]
Nam-Yong Kim. 2009. A New Constant Modulus Algorithm based on Minimum Euclidian Distance Criterion for Blind Channel Equalization. Journal of Internet Computing and Services, 10, 6, (2009), 19-26.