Domains of attraction of Shalvi-Weinstein receivers

Domains of attraction (DoA) of Shalvi-Weinstein (1990) receivers are analyzed. It is shown that there is a one-to-one correspondence between DoA in the receiver parameter space and those in the global (or combined channel-receiver) parameter space. For general noiseless channels, DoA of SW receivers in the global response space are the minimum distance decision regions on a unit sphere. In the presence of noise and for the class of orthogonal channels, DoA of SW receivers for independent and identically distributed (i.i.d.) input signals are the minimum distance decision regions on an ellipsoid determined by the channel coefficients and the noise variance. The DoA in the receiver parameter space are also characterized for the general nonuniformly distributed sources. The size of the DoA is shown to be affected by the signal power, the signal constellation, the noise level, and the channel condition. It is also demonstrated that although the optima of the Shalvi-Weinstein algorithm and those of the constant modulus algorithm are one-to-one correspondent, their DoA are different in general.

[1]  Lang Tong,et al.  Relationships Between the Constant Modulus and Wiener Receivers , 1998, IEEE Trans. Inf. Theory.

[2]  C.R. Johnson,et al.  Characterization of the regions of convergence of CMA adapted blind fractionally spaced equalizer , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[3]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[4]  Ali N. Akansu,et al.  Orthogonal transmultiplexers in communication: a review , 1998, IEEE Trans. Signal Process..

[5]  Zhi Ding,et al.  Global convergence of fractionally spaced Godard (CMA) adaptive equalizers , 1996, IEEE Trans. Signal Process..

[6]  Pierre Priouret,et al.  Adaptive Algorithms and Stochastic Approximations , 1990, Applications of Mathematics.

[7]  J. Lumley,et al.  Processing of Random Signals , 1978 .

[8]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[9]  Thomas Ericson Structure of optimum receiving filters in data transmission systems (Corresp.) , 1971, IEEE Trans. Inf. Theory.

[10]  Wonzoo Chung Geometrical Understanding Of The Constant Modulus Algorithm: Adaptive Blind Equalization And Cross-P , 1999 .

[11]  Ming Gu,et al.  Geometrical characterizations of constant modulus receivers , 1999, IEEE Trans. Signal Process..

[12]  A. Benveniste,et al.  Robust identification of a nonminimum phase system: Blind adjustment of a linear equalizer in data communications , 1980 .

[13]  S. Weinstein,et al.  Data Transmission by Frequency-Division Multiplexing Using the Discrete Fourier Transform , 1971 .

[14]  Zhi Ding,et al.  Ill-convergence of Godard blind equalizers in data communication systems , 1991, IEEE Trans. Commun..

[15]  Ehud Weinstein,et al.  New criteria for blind deconvolution of nonminimum phase systems (channels) , 1990, IEEE Trans. Inf. Theory.

[16]  D. Godard,et al.  Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems , 1980, IEEE Trans. Commun..

[17]  J. Treichler,et al.  A new approach to multipath correction of constant modulus signals , 1983 .

[18]  Irving Kalet,et al.  The multitone channel , 1989, IEEE Trans. Commun..