Results 211 to 220 of about 98,054 (260)
Some of the next articles are maybe not open access.
Convergence behavior of the constant modulus algorithm
ICASSP '83. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005An adaptive filter algorithm has been developed and introduced [1] for use with constant envelope waveforms, e.g., FM communication signals. It has proven capable of suppressing additive interferers as well as equalization, without the need for a priori statistical information.
Michael G. Larimore, John R. Treichler
openaire +1 more source
The MSE performance of constant modulus receivers
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002The constant modulus algorithm (CMA) is an effective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, effects of noise and channel conditions are investigated. For the class of channels with arbitrary finite impulse responses, an analytical description of locations of constant modulus receivers and an upper ...
Hanks H. Zeng, Lang Tong 0001
openaire +1 more source
On the Constant Modulus Criterion: A New Algorithm
2010 IEEE International Conference on Communications, 2010In this paper, we propose a new iterative algorithm for the minimization of the constant modulus (CM) criterion. It is composed of two stages: Prewhitening followed by complex Givens rotations, whence the name Givens CMA (GCMA). Initially, prewhitening reduces the channel matrix into a unitary matrix.
Aïssa Ikhlef +2 more
openaire +1 more source
On constant modulus multidimensional harmonic retrieval
IEEE International Conference on Acoustics Speech and Signal Processing, 2002In a recent paper, it has been shown that up to ⌊K over 2⌋ ⌈L over 2⌉two-dimensional (2-D) exponentials are almost surely identifiable from a K × L mixture, assuming regular sampling at or above Nyquist in both dimensions. This holds for damped or undamped exponentials.
Xiangqian Liu, Nicholas D. Sidiropoulos
openaire +1 more source
Fixed window constant modulus algorithms
1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999We 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 channel/equalizer response is known.
Xiangyang Zhuang, A. Lee Swindlehurst
openaire +1 more source
Global convergence of the constant modulus algorithm
ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005This paper proves global convergence of the Constant-Modulus Algorithm (CMA) for the case of a real channel when the model order is equal to or greater than that of the channel (the so-called "model-complete" case). The analysis is based on an exact fourth-order Taylor series representation for the cost function minimized asymptotically by the CMA.
Julius O. Smith III +1 more
openaire +1 more source
A batch processing constant modulus algorithm
IEEE Communications Letters, 2004We present a batch processing constant modulus algorithm (BP-CMA) derived by a nonlinear optimization approach to minimizing the constant modulus (CM) criterion. BP-CMA is a line search iteration algorithm. The search direction may be taken as deepest descent direction or Newton direction.
Changjiang Xu, Jian Li
openaire +1 more source
Robust Constrained Constant Modulus Algorithm
2012In practical applications, the performance of the linearly constrained constant modulus algorithm (CMA) is known to degrade severely in the presence of even slight signal steering vector mismatches. To account for the mismatches, a novel robust CMA algorithm based on double constraints is proposed via the oblique projection of signal steering vector ...
Xin Song 0002 +3 more
openaire +1 more source
Avoiding divergence in the constant modulus algorithm
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008One of the most popular algorithms for blind equalization is the constant modulus algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is not properly chosen or if the initialization is distant from the optimal solution, CMA can diverge or converge to undesirable local minima.
Maria D. Miranda +2 more
openaire +1 more source
Separation of zero/constant modulus signals
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002Zero/constant modulus (ZCM) signals are complex signals for which every sample is either zero or has modulus 1. Such signals arise after imprecise carrier-to-baseband conversion of binary {0,1}-modulated signals, or with intermittent phase-modulated signals.
Van der Veen, A.J. (author) +1 more
openaire +2 more sources