Results 1  10
of
61,003
An Analytical Constant Modulus Algorithm
, 1996
"... Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval of all ..."
Abstract

Cited by 165 (35 self)
 Add to MetaCart
Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval
An Analytical Constant Modulus Algorithm
"... Abstract — Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retri ..."
Abstract
 Add to MetaCart
Abstract — Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima
Algebraic Constant Modulus Algorithms
, 1999
"... this paper, it was noted that in the noisefree case the collection of d beamformers for all individual signals can be computed exactly and algebraically, as the solution of a generalized eigenvalue problem. Only a limited number of samples is needed: for d signals, it is sufficient to have n ? d ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
this paper, it was noted that in the noisefree case the collection of d beamformers for all individual signals can be computed exactly and algebraically, as the solution of a generalized eigenvalue problem. Only a limited number of samples is needed: for d signals, it is sufficient to have n ? d
Fixed Window Constant Modulus Algorithms
 In Proc. IEEE ICASSP
, 1999
"... We propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined if the peak position of the initialized global channe ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined if the peak position of the initialized global
Momentum factor Constant Modulus Algorithm And Theory
"... Abstract. The traditional constant modulus algorithm (CMA) has the disadvantage of slow convergence in blind equalization algorithm. This paper studied one improved algorithm based on momentum factor constant modulus algorithm(MCMA) to solve this problem, momentum factor was added to the weight vect ..."
Abstract
 Add to MetaCart
Abstract. The traditional constant modulus algorithm (CMA) has the disadvantage of slow convergence in blind equalization algorithm. This paper studied one improved algorithm based on momentum factor constant modulus algorithm(MCMA) to solve this problem, momentum factor was added to the weight
The Effects of PN Sequences on the Misconvergence of the Constant Modulus Algorithm (CMA)
"... The effects of PN sequences on the misconvergence of the constant modulus algorithm (CMA) ..."
Abstract
 Add to MetaCart
The effects of PN sequences on the misconvergence of the constant modulus algorithm (CMA)
A finiteinterval constant modulus algorithm
 Proc. ICASSP 02
, 2002
"... A finiteinterval constant modulus algorithm is developed which is vastly simpler than the Analytic Constant Modulus Algorithm and, unlike that algorithm, can claim to minimize a constant modulus criterion. It requires one QR decomposition of a data matrix, followed by a power iteration. Step size b ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
A finiteinterval constant modulus algorithm is developed which is vastly simpler than the Analytic Constant Modulus Algorithm and, unlike that algorithm, can claim to minimize a constant modulus criterion. It requires one QR decomposition of a data matrix, followed by a power iteration. Step size
Statistical performance analysis of the algebraic constant modulus algorithm
 IEEE Trans. Signal Process
, 2002
"... Abstract—This paper presents a large sample analysis of the covariance of the beamformers computed by the analytical constant modulus algorithm (ACMA) method for blindly separating constant modulus sources. This can be used to predict the signaltointerference plus noise ratio (SINR) performance of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract—This paper presents a large sample analysis of the covariance of the beamformers computed by the analytical constant modulus algorithm (ACMA) method for blindly separating constant modulus sources. This can be used to predict the signaltointerference plus noise ratio (SINR) performance
The Dithered SignedError Constant Modulus Algorithm
, 1998
"... Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In particular, the Constant Modulus Algorithm (CMA) has become a favorite of practitioners due to its LMSlike complexity and desirable robustness properties. The desire for further ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Adaptive blind equalization has gained widespread use in communication systems that operate without training signals. In particular, the Constant Modulus Algorithm (CMA) has become a favorite of practitioners due to its LMSlike complexity and desirable robustness properties. The desire for further
BLIND TURBO EQUALIZATION USING THE CONSTANT MODULUS ALGORITHM
"... Abstract: A turbo equalizer is modified to allow its operation in a blind manner, i.e., without resorting to training sequences or to channel identification steps. It exploits a recent variant of the constant modulus algorithm, in collaboration with differential encoding, for which the decoder is li ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract: A turbo equalizer is modified to allow its operation in a blind manner, i.e., without resorting to training sequences or to channel identification steps. It exploits a recent variant of the constant modulus algorithm, in collaboration with differential encoding, for which the decoder
Results 1  10
of
61,003