• Title/Summary/Keyword: MSE 수렴

Search Result 96, Processing Time 0.022 seconds

A Study on Adaptive Interference Cancellation System of RF Repeater Using the Grouped Constant-Modulus Algorithm (그룹화 CMA 알고리즘을 이용한 RF 중계기의 적응 간섭 제거 시스템(Adaptive Interference Cancellation System)에 관한 연구)

  • Han, Yong-Sik;Yang, Woon-Geun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.9
    • /
    • pp.1058-1064
    • /
    • 2008
  • In this paper, we proposed a new hybrid interference canceller using the adaptive filter with Grouped CMA(Constant Modulus Algorithm)-LMS(Least Mean Square) algorithm in the RF(Radio Frequency) repeater. The feedback signal generated from transmitter antenna to receiver antenna reduces the performance of the receiver system. The proposed interference canceller has better channel adaptive performance and a lower MSE(Mean Square Error) than conventional structure because it uses the cancellation method of Grouped CMA algorithm. This structure reduces the number of iterations fur the same MSE performance and hardware complexity compared to conventional nonlinear interference canceller. Namely, MSE values of the proposed algorithm were lower than those of LMS algorithm by 2.5 dB and 4 dB according to step sizes. And the proposed algorithm showed fast speed of convergence and similar MSE performance compared to VSS(Variable Step Size)-LMS algorithm.

A Performance Analysis of AM-SCS-MMA Adaptive Equalization Algorithm based on the Minimum Disturbance Technique (Minimum Disturbance 기법을 적용한 AM-SCS-MMA 적응 등화 알고리즘의 성능 해석)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.81-87
    • /
    • 2016
  • This paper analysis the AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) based on the adaptive modulus and minimus-disturbance technique in order to improve the stability and robustness in low signal to noise power of current MMA adaptive equalization algorithm. In AM-SCS-MMA, it updates the filter coefficient applying the adaptive modulus and minimum-disturbance technique of deterministic optimization problem instead of LMS or gradient descend algorithm for obtain the minimize the cost function of adaptive equalization. It is possible to improve the equalizer filter stability, robustness to the various noise characteristic and simultaneous reducing the intersymbol interference due to the amplitude and phase distortion occurred at channel. The computer simulation were performed for confirming the improved performance of SCS-MMA. For these, the output signal constellation of equalizer, residual isi, MSE, EMSE (Excess MSE) which means the channel traking capability and SER which means the robustness were applied. As a result of computer simulation, the AM-SCS-MMA have slow convergence time and less residual quantities after steady state, more good robustness in the poor signal to noise ratio, but poor in channel tracking capabilities was confirmed than MMA.

Performance Improvement of MCMA Equalizer with Parallel Structure (병렬 구조를 갖는 MCMA 등화기의 성능 개선)

  • Yoon, Jae-Sun;Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.27-33
    • /
    • 2011
  • In digital communication system that the Modified Constant Modulus Algorithm (MCMA) reduced the use of the adaptive equalization algorithm to combat the Inter-symbol Interference (ISI). MCMA is relatively brief operation. The major point of MCMA that it only achieves moderate convergence rate and steady state mean square error (MSE). In this paper suggest, MCMA equalization improve the performance with parallel structure. It combines Modified Constant Modulus Algorithm(MCMA) and Modified Decision Directed(MDD) algorithm. By exploiting the inherent structural relationship between the 4-QAM signal's coordinates and 16-QAM signal's coordinates, another style of cost function for Modified Constant Modulus Algorithm(MCMA) is defined and If it happen to offset of received signals and MCMA is poor performance in order to overcome this because the paper combines apply for MCMA and MDD(Modified Decision Direct) algorithm. By computer simulation, we confirmed that the proposed PMCMA-MDD algorithm has the fater convergence rate and steady mean square error than the conventional MCMA.

A Performance Improvement of FC-MMA Blind Equalization Algorithm based on Varying Step Size (가변 스텝 크기를 적용한 FC-MMA 블라인드 등화 알고리즘의 성능 개선)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.101-106
    • /
    • 2019
  • This paper propose the VSS-FC-MMA algorithm that is possible to improve the equalization performance based on varying step size to the FC-MMA adaptive equalization algorithm in order to reducing the intersymbol interference effect occurred in the nonconstant modulus signal transmission, and improved performance were confirmed. The FC-MMA is possible to improve the convergence speed, and degrades the steady state performance based on the fixed step size and modified dispersion constant considering the level number of signal symbol for obtain the error signal in adaptive equalization compared to MMA. The proposed VSS-FC-MMA uses varying step size and current FC-MMA possible to improve the steady state equalization performance, it was confirmed by computer simulation. For this, the signal recovery capabilities and residual isi, MSE, SER were applied for performance comparison index in the same channel and signal to noise ratio. As a result of computer simulation, the proposed VSS-FC-MMA improve the risidual value in steady state and SER performance than the FC-MMA, but has 1.7 times slow convergence time by using varying step size.

A Performance Analysis of Hybrid-DSE-MMA Adaptive Equalization Algorithm based on Adaptive Modulus and Adaptive Stepsize (Adaptive Modulus와 Adaptive Stepsize를 이용한 Hybrid-DSE-MMA 적응 등화 알고리즘의 성능 분석)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.75-80
    • /
    • 2021
  • This paper relates with the Hybrid-DSE-MMA (Hybrid-Dithered Signed Error-MMA) that is possible to improving the equalization performance by using the adaptive modulus and adaptive stepsize in DSE-MMA adaptive equalizer. The DSE-MMA possible to improve the robustness performance to external noise of SE-MMA by using the sign after adding the dither signal for get the error signal in order to update the tap coefficient. But it has a drawback of performance degradation in convergence speed and residual isi by using the fixed modulus and fixed stepsize. In this paper, it was confirmed that this equalization performance degradation was improved by applying the adaptive modulus and stepsize in DSE-MMA propotional to the output power of equalizer by computer simulation. In order to compare the improved equalization performance to currently DSE-MMA, the recovered signal constellation that is the output of the equalizer, residual isi, Maximum Distortion, MSE and the SER were used as a performance index. As a result of computer simulation, the Hybrid-DSE-MMA improve the equalization performance in every index, but gives slower convergence speed compared to DSE-MMA.

Initial codebook generation algorithm considering the number of member training vectors (소속 학습벡터 수를 고려한 초기 코드북 생성 알고리즘)

  • Kim HyungCheol;Cho CheHwang
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.259-262
    • /
    • 2002
  • 벡터양자화에서 주어진 학습벡터를 가장 잘 대표할 수 있는 코드벡터의 집합인 코드북을 구하는 것은 가장 중요한 문제이다. 이러한 코드북을 구하는 알고리즘 중에서 가장 대표적인 방법은 K-means 알고리즘으로 그 성능이 초기 코드북에 크게 의존한다는 문제점을 가지고 있어 여러 가지 초기 코드북을 설계하는 알고리즘이 제안되어 왔다. 본 논문에서는 splitting 방법을 이용한 수정된 초기 코드북 생성 알고리즘을 제안하고자 한다. 제안된 방법에서는 기존외 splitting 방법을 적용하여 초기 코드북을 생성하되, 미소분리 과정 시 학습벡터의 수렴 빈도가 가장 낮은 코드벡터를 제거하고 수렴 빈도가 가장 높은 코드벡터를 미소분리 하여 수렴 빈도가 가장 낮은 코드벡터와 대체해가며 초기 코드북을 설계 한다. 제안된 방법의 적용온 기존 방법에서 MSE(mean square error)의 감소율이 가장 작은 미소분리 과정에서 시작하여 원하는 코드북 크기를 얻을 때까지 반복한다. 제안된 방법으로 생성된 초기 코드북을 사용하여 K-means 알고리즘을 수행한 결과 기존의 splitting 방법으로 생성된 초기 코드북을 사용한 경우보다 코드북의 성능이 향상되었다.

  • PDF

Time- and Frequency-Domain Block LMS Adaptive Digital Filters: Part Ⅱ - Performance Analysis (시간영역 및 주파수영역 블럭적응 여파기에 관한 연구 : 제 2 부- 성능분석)

  • Lee, Jae-Chon;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.7 no.4
    • /
    • pp.54-76
    • /
    • 1988
  • In Part Ⅰ of the paper, we have developed various block least mean-square (BLMS) adaptive digital filters (ADF's) based on a unified matrix treatment. In Part Ⅱ we analyze the convergence behaviors of the self-orthogonalizing frequency-domain BLMS (FBLMS) ADF and the unconstrained FBLMS (UFBLMS) ADF both for the overlap-save and overlap-add sectioning methods. We first show that, unlike the FBLMS ADF with a constant convergence factor, the convergence behavior of the self-orthogonalizing FBLMS ADF is governed by the same autocorrelation matrix as that of the UFBLMS ADF. We then show that the optimum solution of the UFBLMS ADF is the same as that of the constrained FBLMS ADF when the filter length is sufficiently long. The mean of the weight vector of the UFBLMS ADF is also shown to converge to the optimum Wiener weight vector under a proper condition. However, the steady-state mean-squared error(MSE) of the UFBLMS ADF turns out to be slightly worse than that of the constrained algorithm if the same convergence constant is used in both cases. On the other hand, when the filter length is not sufficiently long, while the constrained FBLMS ADF yields poor performance, the performance of the UFBLMS ADF can be improved to some extent by utilizing its extended filter-length capability. As for the self-orthogonalizing FBLMS ADF, we study how we can approximate the autocorrelation matrix by a diagonal matrix in the frequency domain. We also analyze the steady-state MSE's of the self-orthogonalizing FBLMS ADF's with and without the constant. Finally, we present various simulation results to verify our analytical results.

  • PDF

A Study of optimal algorithm for high-speed process of image signal (영상신호의 고속처리를 위한 최적화 알고리즘에 대한 연구)

  • 권기홍
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.2001-2013
    • /
    • 1994
  • In this paper, the method of processing a blurred noisy image has been researched. The conventional method of processing signal has faluts which are slow convergence speed and long time-consuming process at the singular point and or in the ill condition. There is the process, the Gauss Seidel's method to remove these faults, but it takes too much time because it processed singnal repeatedly. For overcoming the faults, this paper shows a image restoration method which takes shorter than the Gauss-Seidel's by comparing the Gauss Seidel's with proposed alogorithm and accelerating convergence speed at the singular point and/or in the ill condition. In this paper, the conventional process method(Gauss-Seidel) and proposed optimal algorithm were used to get a standard image($256{\times}56{\times}bits$). and then the results are simulated and compared each other in order to examine the variance of MSE(Mean Square Error) by the acceleration parameter in the proposed image restoration. The result of the signal process and the process time was measured at all change of acceleration parameter in order to verify the effectveness of the proposed algorithm.

  • PDF

The Performance Evaluation of Parallel and Single Structure MCMA-MDD Adaptive Equalizer for 16-QAM Signal (16-QAM 신호에대한 병렬 구조와 단일 구조를 갖는 MCMA-MDD 적응 등화기의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.15-22
    • /
    • 2012
  • This paper deals with the performance comparison and evaluation of blind adaptive equalizer, the PMCMA-MDD and DW-MCMA, that is used for compensation of the amplitude and phase distortion which occurs in the time dispersive channel. Basically, these algorithms are modification of MCMA cost function in order to obtain the fast convergence speed and reduced residual isi by taking the parallel and serial double structured and the combination of the concept of RCA for the updating the tap coefficient. We implements the algorithm of it and compare the recovered constellation, residual isi, MSE characteristics curve and SER in the signal to noise ratio given the time dispersive channel. As a result of simulation, the PMCMA-MDD has a good in recovered constellation than DW-MCMA. But in the SER, the DW-MCMA has a good than PMCMA-MDD.

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.