• Title/Summary/Keyword: PDF-distance minimization

Search Result 5, Processing Time 0.018 seconds

A PDF-distance minimization algorithm for blind equalization for underwater communication channels with multipath and impulsive noise (다중경로와 임펄스 잡음이 있는 수중 통신 채널의 블라인드 등화를 위한 확률분포-거리 최소화 알고리듬)

  • Kim, Nam-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.299-306
    • /
    • 2011
  • In this paper, a blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions is introduced and its superior robustness against impulsive noise and multipath characteristics of underwater communication channels is proved. The conventional CMA based on MSE has shown to be incapable of coping with impulsive noise, and correntropy blind algorithm has also revealed to yield not satisfying performance for the mission. On the other hand, the blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions has been proved to solve effectively the problem of impulsive noise and multipath characteristics of underwater communication channels through theoretical and simulation analysis.

Euclidian Distance Minimization of Probability Density Functions for Blind Equalization

  • Kim, Nam-Yong
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.399-405
    • /
    • 2010
  • Blind equalization techniques have been used in broadcast and multipoint communications. In this paper, two criteria of minimizing Euclidian distance between two probability density functions (PDFs) for adaptive blind equalizers are presented. For PDF calculation, Parzen window estimator is used. One criterion is to use a set of randomly generated desired symbols at the receiver so that PDF of the generated symbols matches that of the transmitted symbols. The second method is to use a set of Dirac delta functions in place of the PDF of the transmitted symbols. From the simulation results, the proposed methods significantly outperform the constant modulus algorithm in multipath channel environments.

Blind Equalization based on Maximum Cross-Correntropy Criterion using a Set of Randomly Generated Symbol (랜덤 심볼을 사용한 최대 코렌트로피 기준의 블라인드 등화)

  • Kim, Nam-Yong;Kang, Sung-Jin;Hong, Dae-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.33-39
    • /
    • 2010
  • Correntropy is a generalized correlation function that contains higher order moments of the probability density function (PDF) than the conventional moment expansions. The criterion maximizing cross-correntropy (MCC) of two different random variables has yielded superior performance particularly in nonlinear, non-Gaussian signal processing comparing to mean squared error criterion. In this paper we propose a new blind equalization algorithm based on cross-correntropy criterion which uses, as two variables, equalizer output PDF and Parzen PDF estimate of a set of randomly generated symbols that complies with the transmitted symbol PDF. The performance of the proposed algorithm based on MCC is compared with the Euclidian distance minimization.

PDF-Distance Minimizing Blind Algorithm based on Delta Functions for Compensation for Complex-Channel Phase Distortions (복소 채널의 위상 왜곡 보상을 위한 델타함수 기반의 확률분포거리 최소화 블라인드 알고리듬)

  • Kim, Nam-Yong;Kang, Sung-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5036-5041
    • /
    • 2010
  • This paper introduces the complex-version of an Euclidean distance minimization algorithm based on a set of delta functions. The algorithm is analyzed to be able to compensate inherently the channel phase distortion caused by inferior complex channels. Also this algorithm has a relatively small size of Gaussian kernel compared to the conventional method of using a randomly generated symbol set. This characteristic implies that the information potential between desired symbol and output is higher so that the algorithm forces output more strongly to gather close to the desired symbol. Based on 16 QAM system and phase distorted complex-channel models, mean squared error (MSE) performance and concentration performance of output symbol points are evaluated. Simulation results show that the algorithm compensates channel phase distortion effectively in constellation performance and about 5 dB enhancement in steady state MSE performance.

A New Criterion of Information Theoretic Optimization and Application to Blind Channel Equalization (새로운 정보이론적 최적기준에 의한 블라인드 등화)

  • Kim, Nam-Yong;Yang, Liuqing
    • Journal of Internet Computing and Services
    • /
    • v.10 no.1
    • /
    • pp.11-17
    • /
    • 2009
  • Blind equalization techniques have been used in multipoint communication on which the research on the internet has focused. In this paper, a criterion of minimizing Euclidian Distance between two PDFs for adaptive blind equalizers has been presented. In order for ED expressed with Parzen PDFs to be minimized, we propose to use a set of randomly generated desired symbols at the receiver so that the PDF of the generated symbols matches that of the transmitted symbols. From the simulation results, the proposed method has shown superior error performance even in severe channel environments in which CMA has shown severe performance degradation. This indicates that the proposed algorithm can be considered relatively insensitive to ESR variations compared to CMA. As a field of ITL, ED minimization using Parzen PDFs has shown possibilities of being successfully applied to blind equalization.

  • PDF