• Title/Summary/Keyword: Constellation Matching

Search Result 11, Processing Time 0.023 seconds

A Performance Evaluation of Constellation Matching-MMA Adaptive Equalization Algorithm in QAM System (QAM 시스템에서 Constellation Matching-MMA 적응 등화 알고리즘의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.105-110
    • /
    • 2015
  • This paper relates with the eualization performance of Constellation Matching-MMA (CM-MMA) in order to the consists of optimum receiver for the minimization of intersymbol interference and additive noise effects that is occurs in the nonlinear communication channel. The error signal were obtained that combines the Constellation Matching technique that inserts the zero point between the signal point of equalizer for improving the residual isi and convergence speed compared to the currently used MMA algorithm. In the initial state of adaptive equalization, it depends on the MMA characteristics mainly. And in the steady state, it depends on the CM characteristics mainly. In order to analyzing the equalization performance, the output signal constellation, residual isi, maximum distortion, MSE and SER were applied, then it were compared with the present MMA algorithm. As a result of computer simulation, the CM-MMA has more better performance in the every performance index, and it was also confirmed that the constellation matching effect can be obtained in the greater than 20dB signal to noise ratio.

The Performance improvement of CMA Blind Adaptive equalizer using the Constellation Matching Method (Constellation Matching 기법을 이용한 CMA 블라인드 적응 등화기의 성능 개선)

  • Lim, Seung-Gag;Kang, Dae-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.121-127
    • /
    • 2010
  • This paper relates with the improved CMA blind adaptive equalization algorithm which uses the constellation matching method that improve the inverse modelling efficiency of a communication channel compared to the present CMA blind adaptive equalizer. The amplitude distortion can be compensated in the present CMA blind adaptive equalizer which is used for the reduction of intersymbol interference by distortion that generate such as a band limited wireless mobile channel, but in the improved adaptive alogorithm operates with the minimize the amplitude phase distortion in the output of equalizer by applying the cost function that is composition of additional signal constellation matching error terms. In order to evaluation of the inverse modeling efficiency of improved algorithm, the residual intersymbol interference and recovered signal constellation were compared by computer simulation. As a result of comparion of computer simulation, the improved algorithm has a good stability in the residual intersymbol interference in the steady state, but it has a slow convergence rate in the adaptation state in initial state.

A Performance Comparison of CM-MMA and RMMA Blind Equalization Algorithm in QAM Signal Transmission (QAM 신호 전송에서 CM-MMA와 RMMA 블라인드 등화 알고리즘의 성능 비교)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.79-84
    • /
    • 2019
  • This paper compare the performance of CM-MMA (Constellation Matching-MMA) and RMMA (Region-based MMA) blind equalization algorithm for improve the QoS by minimizing the intersymbol interference that is occurred in nonlinear communication channel when transmitting the QAM signal. In the tap coefficient update for adaptive, CM-MMA use the error of nonconstant modulus signal adding the current MMA cost fuction and constellation matching error terms of sinusoidal power function, and the RMMA use the error by transfoms the nonconstant modulus signal of equalizer output constellation to 4-QAM constant modulus signal. They has different equalization performance by these error signal, it were compared in this paper by simulation, and performance index such as output signal constellation of equalizer, residual isi, maximum distortion, SER curves are applied for this. As a result of computer simulation, the RMMA has more better performance in the every performance index, convergence speed, residual value, noise robustness compared to CM-MMA.

Mosaicking of Fingerprint Minutiae Using Minutiae Constellation (특징점의 별자리 형태를 이용한 지문의 특징점 융합)

  • 홍정표;최태영
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.297-300
    • /
    • 2003
  • In this paper, fingerprint minutiae mosaicking algorithm using minutiae of fingerprint is proposed. First, minutiae map is generated from minutiae of fingerprint and minutiae constellation is generated from fingerprint minutiae map. Minutiae constellation is constellation-shaped structure generated from Voronoi Diagram and Delaunay Triangulation using information of minutiae. Secondly, common region is detected by similarity of minutiae constellation of fingerprint minutiae map and minutiae map of individual fingerprint image is composed. Consequently composite minutiae map by mosaicking of fingerprint minutiae improve the performance of the fingerprint matching system.

  • PDF

A Performance Comparison of CR-MMA and CM-MMA Equalization Algorithm in 2-dimensional QAM System (2차원 QAM 시스템에서 CR-MMA 와 CM-MMA 등화 알고리즘의 성능 비교)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.85-90
    • /
    • 2018
  • This paper compares the adaptive eualization performance of CR-MMA (Constellation Reduction-MMA) and CR-MMA (Constellation Matching-MMA) in order to minimization of intersymbol interference that is occur in channel for 2-dimensional QAM signal. For obtain the error signal in order to updating the tap coefficient of conventional adaptive equalization algorithm MMA, the CR-MMA converts the constellation reduction concept of high order 2-dimensional QAM nonconstant modulus signal to constant modulus signal and the CM-MMA use the constellation matchine error concept in order to force the matching the $2^{nd}$ and $4^{th}$ cumulant of equalizer output and transmitted signal constellation. By applying the different method for getting the error signal, these algorithm are possible to obtain the improved equalization performance compared to the conventional MMA algorithm, the improved performance of CR-MMA and CM-MMA were compared by computer simulation in this paper. As a result of simulation, the CM-MMA has more better performance in the equalizer internal performance than CR-MMA, but not in equalizer external performance as in SER.

The Performance Comparison of CR-CMA and CM-CMA Adaptive Equalization in 16-QAM Signal (16-QAM 신호에 대한 CR-CMA와 CM-CMA의 적응 등화 성능 비교)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.115-120
    • /
    • 2011
  • This paper is concerned with the performance comparison of CR-CMA (Coordinate Reduction-CMA) and CM-CMA (Constellation Matching-Constant Modulus Algorithm) that is used for improving the convergence characteristic and residual intersymbol interference which are used as the performance index for an adaptive equalizer. The equalizer is used to reduce the distortion caused by the intersymbol interference on the wireless and the wired band-limited channel, and the blind method which does not need for extra bandwidth by the training sequence of digital code are researched. Recently, by using the merit of simple operation in the CMA, the performance improvement is obtained by the modifying the cost function of it. In this paper, the new algorithm, CR-CMA and CM-CMA, the performance analysis are performed and compared by computer simulation. The CR-CMA has a superior equalization characteristics in the recovered constellation, convergence speed and residual intersymbol interference than the CM-CMA by computer simulation.

A Performance Comparison of VSCA and VSDA Adaptive Equalization Algorithm using Distance Adjusted Approach in QAM Signal (QAM 신호에서 Distance Adjusted Approach를 이용한 VSCA와 VSDA 적응 등화 알고리즘의 성능 비교)

  • Lim, Seung Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.139-145
    • /
    • 2015
  • This paper compare the VSCA (Variable stepsize Square Contour Algorithm) and VSDA (Variable stepsize Square contour Decision directed Algorithm) adaptive equalization algorithm that is used for the minimization of the intersymbol interference which occurs in the time dispersive channel for the transmission of 16-QAM signal.. In the SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSCA and VSDA, it is possible to the improving the equalization performance by varing the stepsize using the concept of distance adjusted approach for constellation matching. We compare the performance of the VSCA and VSDA algorithm by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used in the performace index. As a result of computer simulation, the VSCA algorithm has better than the VSDA in every performance index.

Performance Evaluation of VSDA Blind Equalization Algorithm for 16-QAM Signal (16-QAM 신호에 대한 VSDA 블라인드 등화 알고리즘의 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.85-91
    • /
    • 2014
  • This paper relates with the VSDA (Variable stepsize Square contour Decision directed Algorithm) adaptive equalization algorithm that is used for the minimization of the intersymbol interference due to the distortion which occurs in the time dispersive channel for the transmission of 16-QAM signal.. In the conventional SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSDA, it is possible to the increasing the equalization performance by adding the concept of distance adjusted approach for constellation matching and the cost function of decision directed. We compare the performance of VSDA and SCA algorithm by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used in the performace index. As a result of computer simulation, the VSDA algorithm has better than the SCA in convergence speed, but it gives nearly same equalization performance in other index.

Performance of VSCA Adaptive Equalization Algorithm for 16-QAM Signal (16-QAM 신호에 대한 VSCA 적응 등화 알고리즘의 성능)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.67-73
    • /
    • 2013
  • This paper relates with the performance of VSCA adaptive equalization algorithm that is used for the minimization of the intersymbol interference due to the distortion which occurs in the time dispersive channel for the transmission of 16-QAM signal. In the conventional SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSCA, it is possible to the increase the equalization performance by adding the concept of distance adjusted approach for constellation matching. We compare the performance of VSCA and SCA algorithm by computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used for perfomance comparison. It was confirmed that, the VSCA algorithm has better than the SCA in every performance index by computer simulation.

Fingerprint Matching Using Minutiae Constellation Algorithm (특징점 배치도 알고리즘을 이용한 지문 정합)

  • Lim, Jae-Young;Jang, Kyung-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.607-610
    • /
    • 2003
  • 지문 정합을 할 때 특징점 사이의 거리와 각도가 유사한 순서대로 있는가를 비교하는 알고리즘을 제안한다. 한 점에서 가장 가까운 특징점을 찾고 다시 찾은 점에서 가장 가까운 특징점을 찾는데 이러한 세 개의 특징점들 사이의 거리와 끼인 각도를 기본 요소로 하여 이들의 순차를 특징점 배치도로 정의하여 등록지문에도 유사한 순차가 있는지를 검사한다. 정합 시에 특징점 사이의 거리, 각도 순차가 있는가를 검사하기 때문에 중심점을 찾지 않아도 되며 지문의 이동, 회전에 영향을 받지 않는다.

  • PDF