• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12C
• /
• pp.753-758
• /
• 2011

The constant modulus algorithm (CMA) widely used in blind equalization applications minimizes the averaged power of constant modulus error (CME) defined as the difference between an instant output power and a constant modulus. In this paper, a decision feedback version of the linear blind algorithm based on maximization of the zero-error probability for CME is proposed. The Gaussian kernel of the maximum zero-error criterion is analyzed to have the property to cut out excessive CMEs that may be induced from severely distorted channel characteristics. Decision feedback approach to the maximum zero-error criterion for CME is developed based on the characteristic that the Gaussian kernel suppresses the outliers and this prevents error propagation to some extent. Compared to the linear algorithm based on maximum zero-error probability for CME in the simulation of blind equalization environments, the proposed decision feedback version has superior performance enhancement particularly in cases of severe channel distortions.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.295-299
• /
• 2011

Blind equalization techniques have been widely used in wireless communication systems. In this paper, we propose to apply the balanced information potentials to the criterion of minimum Euclidian distance between two PDFs with constant modulus errors for adaptive blind equalizers. One of the two PDFs is constructed with constant modulus error samples and another does with Dirac delta functions. Two information potentials derived from the criterion are balanced in order to have better performance by putting a weighting factor to each information potentials. The proposed blind algorithm has shown in the MSE convergence performance that it can produce enhanced performance by over 3 dB of steady state MSE.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.19-26
• /
• 2009

In this paper, a minimum Euclidian distance criterion between error PDF and Dirac delta function is introduced and a constant modulus type blind equalizer algorithm based on the criterion is proposed. The proposed algorithm using constant modulus error in place of actual error term of the criterion has superior convergence and steady state MSE performance, and the error signal of the proposed algorithm exhibits more concentrated density function in blind equalization environments. Simulation results indicate that the proposed method can be a reliable candidate for blind equalizer algorithms for multipoint communications.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.85-90
• /
• 2009

In this paper, as an alternative to constant modulus algorithm based on MSE, maximization of the probability that equalizer output power is equal to the constant modulus of the transmitted symbols is introduced. The proposed algorithm using the gradient ascent method to the maximum probability criterion has superior convergence and steady-state MSE performance, and the error samples of the proposed algorithm exhibit more concentrated density functions in blind equalization environments. Simulation results indicate that the proposed training has a potential advantage versus MSE training for the constant modulus approach to blind equalization.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2172-2177
• /
• 2015

The DF-MZEP-CME (decision feedback - maximum zero-error probability for constant modulus errors) algorithm that makes the probability for constant modulus error (CME) close to zero and employs decision feedback (DF) structures shows more improved performance in channel distortion compensation. However the DF-MZEP-CME algorithm has a computational complexity proportional to a sample size for probability estimation and this property plays a role of an obstacle in practical implementation. In this paper, the gradient of DF-MZEP-CME is proposed to be estimated recursively and shown to solve the computational problem by making the algorithm independent of the sample size. For a sample size N, the conventional method has 10N multiplications but the proposed has only 20 regardless of N. Also the recursive gradient estimation for weight update is kept in continuity from the initial state to the steady state without any error propagation.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.257-266
• /
• 2005

Many multi-modulus blind equalization algorithms (MMA) have been presented in the past to overcome the undesirable high misadjustment exhibited by the well-known constant modulus algorithm. Some of these MMA schemes, specifically tailored for quadrature amplitude modulation (QAM) constellations, have also been proved to fix the phase offset error without needing any rotator at the end of the equalizer stage. In this paper, a new multi-modulus algorithm is presented for QAM signals. The contribution lies in the technique to incorporate the sliced symbols (outcomes of decision device) in the multi-modulus-based weight adaptation process. The convergence characteristics of the proposed sliced multi-modulus algorithm (S-MMA) is demonstrated by way of simulations, and it is shown that it gives better steady-state performance in terms of residual inter-symbol interference and symbol-error rate. It has also been shown that the proposed algorithm exhibits lesser steady-state misadjustment compared to the best reported MMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.760-767
• /
• 2010

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.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.17-24
• /
• 2014

Blind algorithms designed to maximize the probability that constant modulus errors become zero carry out some summation operations for a set of constant modulus errors at an iteration time inducing heavy complexity. For the purpose of reducing this computational burden induced from the summation, a new approach to the estimation of the zero-error probability (ZEP) of constant modulus errors (CME) and its gradient is proposed in this paper. The ZEP of CME at the next iteration time is shown to be calculated recursively based on the currently calculated ZEP of CME. It also is shown that the gradient for the weight update of the algorithm can be obtained by differentiating the ZEP of CME estimated recursively. From the simulation results that the proposed estimation method of ZEP-CME and its gradient produces exactly the same estimation results with a significantly reduced computational complexity as the block-processing method does.