Proceedings Article10.1109/ICASSP.1999.761235
Fixed window constant modulus algorithms
Xiang-Yang Zhaung,A.L. Swindlehurst +1 more
- 15 Mar 1999
- Vol. 5, pp 2623-2626
TL;DR: Two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused are proposed, and the convergence rate of the algorithms is shown to be very fast.
read more
Abstract: 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 channel/equalizer response is known. These fixed window CM algorithms are data efficient, computationally inexpensive and no step-size tuning is required. The effect of noise, and the relationship between the converging delay and noise enhancement are analyzed as well.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A cumulant matrix subspace algorithm for blind single FIR channel identification
Zhi Ding,Jing Liang +1 more
TL;DR: Blind identification of discrete-time single-user FIR channels with nonminimum phase with broad application in identifying data communication systems shows great potential and promise.
25
Blind Source Separation: The Location of Local Minima in the Case of Finitely Many Samples
Amir Leshem,A. van Veen +1 more
TL;DR: A new methodology of analyzing the finite sample behavior of general blind source separation cost functions is developed, and a new probabilistic analysis of the rate of convergence as a function of the number of samples and the conditioning of the mixing matrix is derived.
6
•Proceedings Article
On the finite sample behavior of the constant modulus cost function
Amir Leshem,A. van Veen +1 more
- 01 Jan 2000
TL;DR: In this article, the location of local minima of the finite sample approximation to the constant modulus cost function is studied and the main result is a connection between the number of samples and the probability of obtaining a local minimum of the approximation within a given sphere around the local minimum.
A space-time semi-blind equalizer based on constant modulus and decision-direction
Xiangyang Zhuang,A.L. Swindlehurst +1 more
- 24 Oct 1999
TL;DR: Some known but very small number of training symbols, while alone unable to yield a satisfactory filter, provide reasonable initializations that not only may speed up the convergence of an adaptive blind algorithm, but also guide the algorithm to an easier recovery of weak users.
Fixed-window constant modulus algorithms: adaptive implementations
Xiang-Yang Zhuang,A.L. Swindlehurst +1 more
- 09 May 1999
TL;DR: Adaptive implementations of two previously proposed block-iterative algorithms; referred to as fixed-window constant modulus algorithms (FWCMA), are developed and their transient behavior, in relation to the delay at which the user sequence is recovered, is discussed and compared with other existing variations of CMA.
References
•Journal Article
Authors' Reply to Comments on 'New criteria for blind deconvolution of nonminimum phase systems (channels)'.
Ofir Shalvi,E. Weinstein +1 more
TL;DR: A necessary and sufficient condition for blind deconvolution (without observing the input) of nonminimum-phase linear time-invariant systems (channels) is derived.
765
The least-squares CMA: A new technique for rapid correction of constant modulus signals
B.G. Agee
- 01 Apr 1986
TL;DR: A new rapidly-converging constant modulus algorithm is presented, analyzed, and demonstrated for a two-sensor array, and is shown to be globally stable and convergent for any linearly-independent set of input data.
230
Fractionally spaced equalization using CMA: robustness to channel noise and lack of disparity
TL;DR: It is shown that the noisy FSE-CM cost function is subject to a smoothing effect with respect to the noise-free cost function, the result of which is a tradeoff between achieving zero forcing and noise enhancement.
113
A space-time constant modulus algorithm for SDMA systems
Constantinos B. Papadias,Arogyaswami Paulraj +1 more
- 28 Apr 1996
TL;DR: An approach of the constant-modulus (CM) type is proposed in order to construct optimization criteria that may allow joint blind recovery of the transmitted signals with low computational complexity in a space-division-multiple-access mobile communication system.
52
Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems
TL;DR: This paper solves the general problem of adaptive channel equalization without resorting to a known training sequence or to conditions of limited distortion.
Related Papers (5)
Douglas L. Jones
- 30 Oct 1995
W.Y. Chen,R.A. Haddad +1 more
- 12 Aug 1990
Jacob Benesty,Pierre Duhamel +1 more
- 01 Aug 1991