• Title/Summary/Keyword: Correntropy

Search Result 12, Processing Time 0.025 seconds

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.

Complex-Channel Blind Equalization Using Cross-Correntropy (상호 코렌트로피를 이용한 복소 채널 블라인드 등화)

  • Kim, Nam-Yong
    • Journal of Internet Computing and Services
    • /
    • v.11 no.5
    • /
    • pp.19-26
    • /
    • 2010
  • The criterionmaximizing cross-correntropy (MCC) of two different random variables has yielded superior performance comparing to mean squared error criterion. In this paper we present a complex-valued blind equalizer algorithm for QAM and complex channel environments based on cross-correntropy criterion which uses, as two variables, equalizer output PDF and Parzen PDF estimate of a self-generated symbol set. Simulation results show significantly enhanced performance of symbol-point concentration with no phase rotation in complex-channel communication.

Step Size Normalization for Maximum Cross-Correntropy Algorithms (최대 상호코렌트로피 알고리듬을 위한 스텝사이즈 정규화)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.995-1000
    • /
    • 2016
  • The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

Practical Approach for Blind Algorithms Using Random-Order Symbol Sequence and Cross-Correntropy (랜덤오더 심볼열과 상호 코렌트로피를 이용한 블라인드 알고리듬의 현실적 접근)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.3
    • /
    • pp.149-154
    • /
    • 2014
  • The cross-correntropy concept can be expressed with inner products of two different probability density functions constructed by Gaussian-kernel density estimation methods. Blind algorithms based on the maximization of the cross-correntropy (MCC) and a symbol set of randomly generated N samples yield superior learning performance, but have a huge computational complexity in the update process at the aim of weight adjustment based on the MCC. In this paper, a method of reducing the computational complexity of the MCC algorithm that calculates recursively the gradient of the cross-correntropy is proposed. The proposed method has only O(N) operations per iteration while the conventional MCC algorithms that calculate its gradients by a block processing method has $O(N^2)$. In the simulation results, the proposed method shows the same learning performance while reducing its heavy calculation burden significantly.

A New Adaptive Kernel Estimation Method for Correntropy Equalizers (코렌트로피 이퀄라이져를 위한 새로운 커널 사이즈 적응 추정 방법)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.3
    • /
    • pp.627-632
    • /
    • 2021
  • ITL (information-theoretic learning) has been applied successfully to adaptive signal processing and machine learning applications, but there are difficulties in deciding the kernel size, which has a great impact on the system performance. The correntropy algorithm, one of the ITL methods, has superior properties of impulsive-noise robustness and channel-distortion compensation. On the other hand, it is also sensitive to the kernel sizes that can lead to system instability. In this paper, considering the sensitivity of the kernel size cubed in the denominator of the cost function slope, a new adaptive kernel estimation method using the rate of change in error power in respect to the kernel size variation is proposed for the correntropy algorithm. In a distortion-compensation experiment for impulsive-noise and multipath-distorted channel, the performance of the proposed kernel-adjusted correntropy algorithm was examined. The proposed method shows a two times faster convergence speed than the conventional algorithm with a fixed kernel size. In addition, the proposed algorithm converged appropriately for kernel sizes ranging from 2.0 to 6.0. Hence, the proposed method has a wide acceptable margin of initial kernel sizes.

Performance Analysis of Correntropy-Based Blind Algorithms Robust to Impulsive Noise (충격성 잡음에 강인한 코렌트로피 기반 블라인드 알고리듬의 성능분석)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2324-2330
    • /
    • 2015
  • In blind signal processing in impulsive noise environment the maximum cross-correntropy (MCC) algorithm shows superior performance compared to MSE-based algorithms. But optimum weight conditions of MCC algorithm and its properties related with robustness to impulsive noise have not been studied sufficiently. In this paper, through the analysis of the behavior of its optimum weight and the relationship with the MSE-based LMS algorithm, it is shown that the optimum weight of MCC and MSE-based LMS have an equal solution. Also the factor that keeps optimum weight of MCC undisturbed and stable under impulsive noise is proven to be the magnitude controlled input through simulation.

A Study on Kernel Size Adaptation for Correntropy-based Learning Algorithms (코렌트로피 기반 학습 알고리듬의 커널 사이즈에 관한 연구)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.2
    • /
    • pp.714-720
    • /
    • 2021
  • The ITL (information theoretic learning) based on the kernel density estimation method that has successfully been applied to machine learning and signal processing applications has a drawback of severe sensitiveness in choosing proper kernel sizes. For the maximization of correntropy criterion (MCC) as one of the ITL-type criteria, several methods of adapting the remaining kernel size ( ) after removing the term have been studied. In this paper, it is shown that the main cause of sensitivity in choosing the kernel size derives from the term and that the adaptive adjustment of in the remaining terms leads to approach the absolute value of error, which prevents the weight adjustment from continuing. Thus, it is proposed that choosing an appropriate constant as the kernel size for the remaining terms is more effective. In addition, the experiment results when compared to the conventional algorithm show that the proposed method enhances learning performance by about 2dB of steady state MSE with the same convergence rate. In an experiment for channel models, the proposed method enhances performance by 4 dB so that the proposed method is more suitable for more complex or inferior conditions.

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.

Robust transformer-based anomaly detection for nuclear power data using maximum correntropy criterion

  • Shuang Yi;Sheng Zheng;Senquan Yang;Guangrong Zhou;Junjie He
    • Nuclear Engineering and Technology
    • /
    • v.56 no.4
    • /
    • pp.1284-1295
    • /
    • 2024
  • Due to increasing operational security demands, digital and intelligent condition monitoring of nuclear power plants is becoming more significant. However, establishing an accurate and effective anomaly detection model is still challenging. This is mainly because of data characteristics of nuclear power data, including the lack of clear class labels combined with frequent interference from outliers and anomalies. In this paper, we introduce a Transformer-based unsupervised model for anomaly detection of nuclear power data, a modified loss function based on the maximum correntropy criterion (MCC) is applied in the model training to improve the robustness. Experimental results on simulation datasets demonstrate that the proposed Trans-MCC model achieves equivalent or superior detection performance to the baseline models, and the use of the MCC loss function is proven can obviously alleviate the negative effect of outliers and anomalies in the training procedure, the F1 score is improved by up to 0.31 compared to Trans-MSE on a specific dataset. Further studies on genuine nuclear power data have verified the model's capability to detect anomalies at an earlier stage, which is significant to condition monitoring.

Performance Analysis of Maximum Zero-Error Probability Algorithm for Blind Equalization in Impulsive Noise Channels (충격성 잡음 채널의 블라인드 등화를 위한 최대 영-확률 알고리듬에 대한 성능 분석)

  • Kim, Nam-Yong
    • Journal of Internet Computing and Services
    • /
    • v.11 no.5
    • /
    • pp.1-8
    • /
    • 2010
  • This paper presentsthe performance study of blind equalizer algorithms for impulsive-noise environments based on Gaussian kernel and constant modulus error(CME). Constant modulus algorithm(CMA) based on CME and mean squared error(MSE) criterion fails in impulsive noise environment. Correntropy blind method recently introduced for impulsive-noise resistance has shown in PAM system not very satisfying results. It is revealed in theoretical and simulation analysis that the maximization of zero-error probability based on CME(MZEP-CME) originally proposed for Gaussian noise environments produces superior performance in impulsive noise channels as well. Gaussian kernel of MZEP-CME has a strong effect of becoming insensitive to the large differences between the power of impulse-infected outputs and the constant modulus value.