Results 1  10
of
158,919
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 164 (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
An Analysis of Constant Modulus Receivers
 IEEE Trans. on Signal Processing
, 1999
"... This paper investigates connections between (nonblind) Wiener receivers and blind receivers designed by minimizing the constant modulus (CM) cost. Applicable to both Tspaced and fractionally spaced FIR equalization, the main results include 1) a test for the existence of CM local minima near Wiener ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
This paper investigates connections between (nonblind) Wiener receivers and blind receivers designed by minimizing the constant modulus (CM) cost. Applicable to both Tspaced and fractionally spaced FIR equalization, the main results include 1) a test for the existence of CM local minima near
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
Equalization Using the Constant Modulus Criterion: A
 Review,” Proccedings of the IEEE, Invited
, 1997
"... This paper provides a tutorial introduction to the constant modulus (CM) criterion for blind fractionally spaced equalizer (FSE) design via a (stochastic) gradient descent algorithm such as the constant modulus algorithm (CMA). The topical divisions utilized in this tutorial can be used to help cata ..."
Abstract

Cited by 134 (22 self)
 Add to MetaCart
This paper provides a tutorial introduction to the constant modulus (CM) criterion for blind fractionally spaced equalizer (FSE) design via a (stochastic) gradient descent algorithm such as the constant modulus algorithm (CMA). The topical divisions utilized in this tutorial can be used to help
Geometrical Characterizations of Constant Modulus Receivers
 IEEE TRANS. SIGNAL PROCESSING
, 1999
"... Convergence properties of the constant modulus (CM) and the ShalviWeinstein (SW) algorithms in the presence of noise remain largely unknown. A new geometrical approach to the analysis of constant modulus and ShalviWeinstein receivers is proposed by considering a special constrained optimization i ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Convergence properties of the constant modulus (CM) and the ShalviWeinstein (SW) algorithms in the presence of noise remain largely unknown. A new geometrical approach to the analysis of constant modulus and ShalviWeinstein receivers is proposed by considering a special constrained optimization
Separation of zero/constant modulus signals
 in Proc. IEEE ICASSP
, 1997
"... Zero/constant modulus (ZCM) signals are complex signals for which every sample is either zero or has modulus 1. Such signals arise after imprecise carriertobaseband conversion of binary {0 1}modulated signals, or with intermittent phasemodulated signals. We consider the separation of linear supe ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Zero/constant modulus (ZCM) signals are complex signals for which every sample is either zero or has modulus 1. Such signals arise after imprecise carriertobaseband conversion of binary {0 1}modulated signals, or with intermittent phasemodulated signals. We consider the separation of linear
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
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
On The Performance Of The Constant Modulus Array Restricted To The Signal Subspace
"... + The Constant Modulus Array has a slow rate of convergence mainly due to both the nonconvex nature of its cost function and the well known behavior of stochastic steepest descent algorithms for environments with a large eigenvalue spread. In this paper we analyze the solutions of the Constant Modu ..."
Abstract
 Add to MetaCart
+ The Constant Modulus Array has a slow rate of convergence mainly due to both the nonconvex nature of its cost function and the well known behavior of stochastic steepest descent algorithms for environments with a large eigenvalue spread. In this paper we analyze the solutions of the Constant
Results 1  10
of
158,919