HomeChair: Philippe Loubaton, Univ. de Marne la Vallee, France
Home
Boon C Ng, Stanford University (U.S.A.)
David J. Gesbert, Stanford University (U.S.A.)
Arogyaswami J. Paulraj, Stanford University (U.S.A.)
This paper describes a direct equalization approach for channels with some underlying structure. A semi-blind approach is taken here where a small amount of training symbols is available. A family of MMSE equalizers is obtained that includes some prior information about the channel structure. The channel structure assumed in this paper is that the channel vector lies approximately in the subspace of a matrix associated with the samples of the transmit pulse shape. Blind identifiability issues of the structured equalizer are also addressed. Numerical results using experimental indoor channel data indicate that these structured equalizers can achieve bit error rates that are significantly lower than traditional non-blind MMSE equalizers.
ic982308.pdf (From Postscript)
TOP
Ge Li, Auburn University (U.S.A.)
Zhi Ding, Auburn University (U.S.A.)
In this paper, we present a semi-blind channel identification scheme for GSM system. Even though the GMSK signal has almost zero excess bandwidth (oversample will give no more information), two diversity channels for each GMSK signal can be generated using a de-rotation scheme without additional antennas. Based on this single input and two output system, the semi-blind algorithm is applied to GSM signals successfully. Simulation results are presented.
ic981834.pdf (From Postscript) TOP
Jacob H Gunther, Brigham Young University (U.S.A.)
Arnold Lee Swindlehurst, Brigham Young University (U.S.A.)
The mathematical theory of kernel (null space) structure of Hankel and Hankel-like matrices is applied to the problem of blind equalization of co-channel signals. This work builds on recently introduced ideas in blind equalization where the symbols are treated as deterministic parameters and estimated directly without estimating the channel first. The main contribution of the new approach is that it allows the simultaneous exploitation of shift structure in the data model andthe finite alphabet property of the signals.
ic982131.pdf (From Postscript) TOP
Antoine Chevreuil, Telecom Paris (France)
Erchin Serpedin, University of Virginia (U.S.A.)
Philippe Loubaton, Universite de Marne-la-Valle (France)
Georgios B. Giannakis, University of Virginia (U.S.A.)
Periodic modulation precoders allow blind identifiability of SISO channels from the output second-order cyclic statistics, irrespective of the location of channel zeros, color of additive stationary noise, or channel order overestimation errors. In the present paper the performance of blind channel estimators is investigated. Some criteria for optimally designing the periodic modulation precoders are also presented.
ic982250.pdf (From Postscript) TOP
Philippe Ciblat, University of Marne-la-Vallee (France)
Philippe Loubaton, University of Marne-la-Vallee (France)
Most of the second order based fractionnally sampled blind equalizers are known to perform poorly in the context of band limited signals. In this paper, we analyse the behaviour of the subspace method in the particular context of band limited signals. As it is well known, the subspace channel estimate is obtained as the eigenvector associated to theeigenvalue 0 of a certain positive quadratic form Q. We show that apart 0, Q has quite small eigenvalues, and that this induces poor statistical performance. More importantly, we characterize the numerical kernel of Q, and show that it contains vectors constructed from certain spheroidal wave sequences. From this, we deduce that the subspace method does not allow to estimate accurately the transfer function of the channel on a certain frequency interval.
ic981397.pdf (From Postscript) TOP
Claudio Becchetti, University Roma ""La Sapienza'' (Italy)
Gaetano Scarano, University Roma ""La Sapienza'' (Italy)
Giovanni Jacovitti, University Roma ""La Sapienza'' (Italy)
This contribution describes a fast frequency domain approach for blind channel identification which does not rely on the statistic of the symbols. The proposed approach is based on the so--called ""intraspectral relations"" of DFT's of PAM fractionally sampled signals. The use of DFT's is allowed under certain conditions commonly encountered in data communication systems. From the intraspectral relations, asymptotically efficient solutions are derived which turn out to be either more accurate or less expensive in term of complexity w.r.t. the time domain counterparts. Simulation results are provided to assess the validity of the proposed approach in comparison with the Rao Cramer bound and with other approaches from the literature.
ic982272.pdf (From Postscript) TOP
Bin Huang, Auburn University (U.S.A.)
Jitendra K. Tugnait, Auburn University (U.S.A.)
The problem of blind equalization of SIMO (single-input multiple-output) communications channels is considered using only the second-order statistics of the data. Such models arise when a single receiver data is fractionally sampled (assuming that there is excess bandwidth), or when an antenna array is used with or without fractional sampling. We focus on direct design of finite-length MMSE (minimum mean-square error) blind equalizers. Unlike the past work on this problem, we allow infinite impulse response (IIR) channels. Our approaches also work when the ``subchannel'' transfer functions have common zeros so long as the common zeros are minimum-phase zeros. Illustrative simulation examples are provided.
ic981106.pdf (From Postscript) TOP
Gil M Raz, University of Wisconsin-Madison (U.S.A.)
Barry D Van Veen, University of Wisconsin-Madison (U.S.A.)
A deterministic approach to blind nonlinear channel equalization and identification is presented. This approach applies to nonlinear channels that can be approximately linearized by finite memory, finite order Volterra filters. Both the Volterra equalizers and the linearized channels are identified. This method also applies to blind identification of linear IIR channels. General conditions for existence and uniqueness are discussed and numerical examples are given.
ic981780.pdf (From Postscript) TOP