The constant modulus algorithm (CMA) updates its weight vector to minimize the modulus variation of the output signal. In this paper, the convergence behavior of the CMA used in interference cancellation application i...
详细信息
The constant modulus algorithm (CMA) updates its weight vector to minimize the modulus variation of the output signal. In this paper, the convergence behavior of the CMA used in interference cancellation application is studied. We first investigate the optimum weight vector that minimizes the performance index of the CMA which is defined as the mean-squared difference between the estimated and true moduli. We then analyze the convergence behavior of the squared output modulus and the performance index. Based on these analysis results, several convergence properties of the CMA are discussed.
In communication systems, data are often corrupted during transmission due to imperfect communication channels. Since channel characteristics may be time varying or unknown prior to data transmission, adaptive equaliz...
详细信息
In communication systems, data are often corrupted during transmission due to imperfect communication channels. Since channel characteristics may be time varying or unknown prior to data transmission, adaptive equalizers are typically incorporated into the receiver to reduce the ill effects of the imperfect channel. Conventional equalizers utilize a training signal to achieve the proper correction. Blind equalization schemes do not require the use of a training signal, but instead attempt restoration based upon some known property of the transmitted signal. The constant modulus algorithm (CMA) is a blind equalization technique that may be used to equalize certain communication signals (e.g. BPSK, QPSK, and FM). This paper investigates three new techniques for adaptive equalization based on the constantmodulus error criterion: (i) the fast quasi-Newton CMA, (ii) the conjugate gradient quasi-Newton CMA, (iii) the conjugate gradient CMA. These three methods are formulated analytically and evaluated experimentally on several typical communication channel models. (C) 1998 John Wiley & Sons, Ltd.
The convergence behavior of the constant modulus algorithm (CMA) is examined in the proper initialization condition of locking onto the desired signal. An improved CMA converging approach is proposed that has the adva...
详细信息
The convergence behavior of the constant modulus algorithm (CMA) is examined in the proper initialization condition of locking onto the desired signal. An improved CMA converging approach is proposed that has the advantage of suppressing multiple access interference without explicit knowledge of interference parameters for synchronous DS-CDMA systems. Simulation results demonstrate that the method overcomes the slower convergence of the CMA in the sudden birth of the number of users and outperforms the CMA detector and matched filter.
The authors propose an efficient and computationally fast algorithm for solving the mix-up problem in complex arrays. The Lagrange multiplier theory is used in the optimisation of the constant modulus algorithm (CMA) ...
详细信息
The authors propose an efficient and computationally fast algorithm for solving the mix-up problem in complex arrays. The Lagrange multiplier theory is used in the optimisation of the constant modulus algorithm (CMA) cost function and the input data are processed in blocks. Furthermore, a simplification of the CMA cost function is proposed that leads to a robust algorithm for solving this problem. Simulations are presented to support the analysis.
Periodically time varying (PTV) filters can offer significant performance gains over conventional filtering methods in DS-CDMA communications systems that are either multirate or corrupted by narrow band interference....
详细信息
Periodically time varying (PTV) filters can offer significant performance gains over conventional filtering methods in DS-CDMA communications systems that are either multirate or corrupted by narrow band interference. This paper develops a new blind adaptive PTV linear multiuser detector based on the frequency shift (FRESH) architecture. The blind adaptive algorithm is based on the linearly constrained constant modulus algorithm (LCCMA), but is modified for the FRESH architecture. The resulting stochastic gradient algorithm has significantly less computational complexity than the recently proposed recursive and cyclic subspace tracking algorithms, and can offer comparable performance. The robustness of the FRESH-LCCMA algorithm is ensured through a proof of convergence which is carried out in the paper.
We present novel convex-optimization-based solutions to the problem of blind beamforming of constantmodulus signals, and to the related problem of linearly constrained blind beamforming of constantmodulus signals. T...
详细信息
ISBN:
(纸本)9781538615713
We present novel convex-optimization-based solutions to the problem of blind beamforming of constantmodulus signals, and to the related problem of linearly constrained blind beamforming of constantmodulus signals. These solutions are based on a low-rank approximation, ensure global optimality and are parameter free, namely, do not contain any tuneable parameters and do not require any a-priori parameter settings. The proposed approach outperforms state-of-the-art both in terms of the number of required samples for convergence, and in terms of the beamformer output SINR.
In digital communication systems, due to multipath transmission and the bandwidth of cable, there are some ISI(inter-symbol-interference) in the signals. Blind equalization that does not require a pilot sequence can t...
详细信息
ISBN:
(纸本)9781479924455;9781479924448
In digital communication systems, due to multipath transmission and the bandwidth of cable, there are some ISI(inter-symbol-interference) in the signals. Blind equalization that does not require a pilot sequence can transmit adaptive equalizer tap coefficients and can effectively remove inter-symbol interference. This paper introduces the principle of blind equalization technique that focus on the constant modulus algorithm and MSE-based variable step size CMA algorithms. We will simulation on two kinds of algorithms by using Matlab. Moreover, we also analysis their performance.
This paper focuses on the main interference signals of the civil aviation air-to-ground communication, which characteristics is constantmodulus. An interference suppression receiver based on constantmodulus algorith...
详细信息
ISBN:
(纸本)9781424413737
This paper focuses on the main interference signals of the civil aviation air-to-ground communication, which characteristics is constantmodulus. An interference suppression receiver based on constant modulus algorithm (CMA) and adaptive cancelling technique is developed in this paper. The constant modulus algorithm is used to extract the reference signal from mixed signal and adaptive canceller is used to subtract the constantmodulus interference The experimental results show that the system is applicable and effective.
Periodically time varying (PTV) filters can offer significant performance gains over conventional filtering methods in DS-CDMA communications systems that are either multirate or corrupted by narrow band interference....
详细信息
ISBN:
(纸本)0780386051
Periodically time varying (PTV) filters can offer significant performance gains over conventional filtering methods in DS-CDMA communications systems that are either multirate or corrupted by narrow band interference. This paper develops a new blind adaptive PTV linear multiuser detector based on the frequency shift (FRESH) architecture. The blind adaptive algorithm is based on the linearly constrained constant modulus algorithm (LCCMA), but is modified for the FRESH architecture. The resulting stochastic gradient algorithm has significantly less computational complexity than the recently proposed recursive and cyclic subspace tracking algorithms, and can offer comparable performance. The robustness of the FRESH-LCCMA algorithm is ensured through a proof of convergence which is carried out in the paper.
The blind beamforming method for constantmodulus (CM) signals based on relevance vector machine (RVM) is proposed. The proposed beamforming method is obtained by incorporating the constant modulus algorithm (CMA)-lik...
详细信息
ISBN:
(纸本)9781457705397
The blind beamforming method for constantmodulus (CM) signals based on relevance vector machine (RVM) is proposed. The proposed beamforming method is obtained by incorporating the constant modulus algorithm (CMA)-like error function into the conventional RVM framework. The RVM framework formulates the parameters of beamfomer by exploiting a probabilistic Bayesian learning procedure with assumption of Gaussian prior for parameters. The simulation results show that the proposed blind beamforming method can restore the desired signals with crowded interference signals.
暂无评论