• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.293-298
• /
• 2011

In the paper, we propose a new CMF(Constant Modulus Fourth) algorithm for WCDMA(Wideband Code Multiple Access) RF(Radio Frequency) Repeater. CMF algorithm is proposed by modifying the CMA(Constant Modulus Algorithm) algorithm and improved performances are achieved by properly adjusting step size values. The steady state MSE(Mean Square Error) performance of the proposed CMF algorithm with step size of 0.35 is about 4dB better than that of the conventional CMA algorithm. And the proposed CMF algorithm requires 400~1100 less iterations than the LMS(Least Mean Square) and NLMS(Normalized Least Mean Square) algorithms at MSE of -25dB.

• Journal of IKEEE
• /
• v.17 no.2
• /
• pp.145-150
• /
• 2013

In the paper, we propose a new CSS(Complex Signed-Signed) CMA(Constant Modulus Algorithm) algorithm for ICS(Interference Cancellation System). When the repeater get the feedback signal, the CSS CMA algorithm is proposed at the ICS repeater using DSP(Digital Signal Processing) for the removal of interfering signals from the feedback paths. The proposed CSS CMA algorithm improved performances and hardware complexity by adjusting step size values. the steady state MSE(Mean Square Error) performance of the proposed CSS CMA algorithm with step size of 0.00043 is about 4dB better than the conventional CMA algorithm. And the proposed Complex Signed Signed CMA algorithm requires 1950 ~ 2150 less iterations than the LMS(Least Mean Square) and Signed LMS(Normalized Least Mean Square) algorithms at MSE of -25dB.

• The Journal of Information Technology
• /
• v.1 no.2
• /
• pp.39-53
• /
• 1998

The CMA and MCMA adaptive blind equalization algorithm has an inevitable error caused by mismatching between the original constellation at the steady state after the equalization and the unique constellation. This problem is due to considering the new type constellation(constant modulus, reduced constellation) as desired constellation. In this paper, we propose a new adaptive blind equalization algorithm which can reach to the steady state with rapid convergence speed and achive the improvement of error value in the steady state. The Proposed algorithm has a new error function using the decided original constellation instead of the reduced constellation. By computer simulation, it is comfirmed that the proposed algorithm has the performance superiority in terms of residual ISI and convergence speed compared with the adaptive blind equalization algorithm of CMA family, Constant Modulus Algorithm with Carrier Phase Recovery and Modified CMA(MCMA).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3772-3790
• /
• 2016

It is well known that the constant modulus algorithm (CMA) presents a large steady-state mean-square error (MSE) for high-order quadrature amplitude modulation (QAM) signals. In this paper, we propose a low-complexity hybrid adaptive blind equalization algorithm, which augments the CMA error function with a novel constellation matched error (CME) term. The most attractive advantage of the proposed algorithm is that it is computationally simpler than concurrent CMA and soft decision-directed (SDD) scheme (CMA+SDD), and modified CMA (MCMA), while the approximation of steady-state MSE of the proposed algorithm is same with CMA+SDD, and lower than MCMA. Extensive simulations demonstrate the performance of the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.85-90
• /
• 2019

This paper related with the M-CMA adaptive equalization algorithm which is possible to improve the residual isi and robustness performance compare to the current MMA algorithm that is reduce the intersymbol interference occurs in channel when transmitting the QAM signal. The current MMA algorithm depend on the cost function and error function using fixed signal dispersion constant, but the M-CMA algorithm depend on the new proposed cost function and error function using multiple dispersion constant. By this, it is possible to having robustness of the CMA and simultaneous compensation of amplitude and phase of MMA. The computer simulation was performed in the same channel and noise environment for compare the proposed M-CMA and current MMA algorithm. The equalizer output signal constellation, residual isi, MD, MSE learning courves and SER, represents the robustness were used for performance index. As a result of simulation, the M-CMA has more superior to the MMA in robustness and other performance index.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.133-143
• /
• 1996

The constant modulus algorithm (CMA), one of the widely used blind equalization algorithms, equalizes channels using the second-order statistic of equalizer outputs. The performance of the CMA for multi-level signals such as the quadrature amplitude modulation (QAM) signal degrades because the CMA maps all signal power onto a single modulus. in this paper, to improve the equalization performance of a QAM system, we propose a shell partitioning method based on error magnitude. We assume the probability distribution of an equalizer output as Gaussian, and obtain decision boundaries by maximum likelihood estimation based on the fact that the distribution of the equalizer output power is noncentral $x^2$. The proposed CMA constructs a multi-moduli equlization system based on the fact that each shell separated by decision boundaries employs a single modulus. Computer simulation results for 32-QAM and 64-QAM show the effectiveness of the proposed algorithm.

• Journal of IKEEE
• /
• v.13 no.1
• /
• pp.1-10
• /
• 2009

Recently, some frequency domain CMA (Constant Modulus Algorithm) have been introduced in an effort to reduce computational complexities [1,2]. In [1], a fast algorithm that minimizing cost function designed for block input signal is employed, while in [2], a novel cost function that minimizing sample by sample input is used. Although, the two fast algorithm save computational complexities as compared to CMA, the convergence behaviors of the two fast algorithm show different results with repsect to CMA. Thus, in this paper, some analytical results on the error surface of the fast frequency domain CMA are introduced. From the analytical results, we show that the more recent algorithm [2] outperforms the previous algorithm [1]. Simulation results reveals that the recent algorithm [2] shows 50% enhanced convergence with respect to the old fast algorithm [1]. Also, we show that the recent fast algorithm [2] has comparable convergence performance with respect to conventional CMA algorithm.

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

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.5
• /
• pp.459-464
• /
• 2016

The mobile communication service is widely used and the repeaters is rapidly increasing because of the extending service areas. we propose a new Signed CMA(: Constant Modulus Algorithm) algorithm for ICS(: Interference Cancellation System) as a larger service area of mobile communication service. The proposed Signed CMA algorithm improved performances by adjusting step size values. We showed that the proposed algorithm could improve the Mean Square Error(: MSE) performance of Signed CMA. MATLAB(: Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. At the convergence of 1000 iteration state, the MSE(: Mean Square Error) performance of the proposed Signed CMA algorithm with step size of 0.0065 is about 5 dB better than the conventional CMA algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.41-47
• /
• 2011

This paper is concerned with the DW-MCMA(Dual Weight vector Modified Constant Modulus Algorithm) adaptive equalization algorithm using the dual weight vector in order to improve the convergence characteristic and residual inter-symbol interference which are used as the performance index for an adaptive equalizer. The equalizer is used to reduce the distortion caused by the inter-symbol interference on the wireless and the wired band-limited channel that connect the transmitting system and receiving system. The CMA is widely known as the representative algorithm for equalization. In order to transmitting the mass information with a high speed through the channels, a fast convergence speed in the equalizer performance that is able to minimize overhead needed for equalization is acquired. In this paper, By the computer simulation, we confirmed that the proposed DW-MCMA has the faster convergence speed and the smaller residual inter-symbol interference than the conventional CMA and MCMA.