Journal ArticleDOI
Averaging analysis of local stability of a real constant modulus algorithm adaptive filter
TLDR
Local stability of the arithmetic version of the constant modulus algorithm of adaptive filtering is proven in two applications: channel equalization for a transmitted sequence of plus and minus ones, and the separation of a sinusoidal signal from its sum with a number ofsinusoidal interferers at separate frequencies.Abstract:
The constant modulus algorithm (CMA) of adaptive filtering was developed for usage when the modulus of the desired signal is known, but its specific value at every sample instant is not known. A real-arithmetic version of CMA was recently proposed, and studied using simulations, by J.R. Treichler and M.G. Larimore (ibid., vol.ASSP-33, p.420-31, Apr. 1985). Local stability of their arithmetic version of CMA is proven in two applications: channel equalization for a transmitted sequence of plus and minus ones, and the separation of a sinusoidal signal from its sum with a number of sinusoidal interferers at separate frequencies. The proofs utilize dynamic system stability theorems from averaging theory, which is a technique currently being utilized in the stability analysis of a variety of adaptive systems. >read more
Citations
More filters
Journal ArticleDOI
Blind equalization using the constant modulus criterion: a review
TL;DR: The topical decisions utilized in this tutorial can be used to help catalog the emerging literature on the CM criterion and on the behavior of (stochastic) gradient descent algorithms used to minimize it.
Journal ArticleDOI
Ill-convergence of Godard blind equalizers in data communication systems
TL;DR: The existence of stable undesirable equilibria for the Godard algorithm is demonstrated through a simple autoregressive (AR) channel model and it is shown that attaining the global minimum of the mean cost necessarily implies correct equalization.
Proceedings ArticleDOI
Approaches to blind equalization of signals with multiple modulus
TL;DR: The authors present two possible approaches to the n-modulus problem, both in the spirit of feature reconstruction algorithms: the multiple- modulus algorithm uses a straightforward generalization of the CMA cost function to derive its update, whereas the decision-adjusted-moduli algorithm is a hybrid of theCMA and DD approaches.
Proceedings ArticleDOI
Comparative performance study of several blind equalization algorithms
TL;DR: This paper examines the transient and steady-state characteristics of several Bussgang-type blind equalization algorithms and the relative performance of the various algorithms is assessed.
Journal ArticleDOI
Adaptive estimation of latency changes in evoked potentials
Xuan Kong,Nitish V. Thakor +1 more
TL;DR: An adaptive algorithm is presented that estimates small delay (latency change) values even when EP signal amplitudes are time-varying, and reveals that the anesthetic etomidate produces a step change in the amplitude and latency of the EP signals.
References
More filters
Journal ArticleDOI
A new approach to multipath correction of constant modulus signals
J. Treichler,B. Agee +1 more
TL;DR: In this article, an adaptive digital filtering algorithm that can compensate for both frequency-selective multipath and interference on constant envelope modulated signals is presented, which exploits the fact that multipath reception and various interference sources generate incidental amplitude modulation on the received signal.
Journal ArticleDOI
New processing techniques based on the constant modulus adaptive algorithm
J. Treichler,M. Larimore +1 more
TL;DR: A real input, real coefficient version of the constant modulus algorithm is shown to perform arbitrarily close to the fully complex version, extended for the enhancement of signals having a nonconstant but known envelope, as might arise in data signals with pulse shaping.
Journal ArticleDOI
Exponential convergence of adaptive identification and control algorithms
TL;DR: Output and equation error adaptive identification algorithms and an adaptive control algorithm are shown to be exponentially convergent under a deterministic or stochastic persistently exciting condition on the reference trajectory together with some standard conditions.
Journal ArticleDOI
Persistency of excitation, sufficient richness and parameter convergence in discrete time adaptive control☆
E. W. Bai,S. Shankar Sastry +1 more
TL;DR: In this paper, the authors derive explicit conditions on the exogenously specified reference trajectory to guarantee parameter convergence for a class of either single-input single-output or multi-input multi-output discrete time adaptive control schemes.
Journal ArticleDOI
The tone capture properties of CMA-based interference suppressors
J. Treichler,M. Larimore +1 more
TL;DR: How "capture, can occur and how it may be prevented is examined and what combinations of input amplitudes and filter initial conditions lead to "lock" and which lead to the capture of the interferer.