A Study on the Complex-Channel Blind Equalization Using ITL Algorithms 


Vol. 35,  No. 8, pp. 760-767, Aug.  2010


PDF
  Abstract

For complex channel blind equalization, this study presents the performance and characteristics of two complex blind information theoretic learning algorithms (ITL) which are based on minimization of Euclidian distance (ED) between probability density functions compared to constant modulus algorithm which is based on mean squared error (MSE) criterion. The complex-valued ED algorithm employing constant modulus error and the complex-valued ED algorithm using a self-generated symbol set are analyzed to have the fact that the cost function of the latter forces the output signal to have correct symbol values and compensate amplitude and phase distortion simultaneously without any phase compensation process. Simulation results through MSE convergence and constellation comparison for severely distorted complex channels show significantly enhanced performance of symbol-point concentration with no phase rotation.

  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, "A Study on the Complex-Channel Blind Equalization Using ITL Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 8, pp. 760-767, 2010. DOI: .

[ACM Style]

Namyong Kim. 2010. A Study on the Complex-Channel Blind Equalization Using ITL Algorithms. The Journal of Korean Institute of Communications and Information Sciences, 35, 8, (2010), 760-767. DOI: .

[KICS Style]

Namyong Kim, "A Study on the Complex-Channel Blind Equalization Using ITL Algorithms," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 8, pp. 760-767, 8. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880