This paper considers the problem of blind estimation of multiple FIR channels. When a subspace algorithm is applied to the blind identification problem, incorporating information about the symbol constellation is in general not possible. However, by exploiting special properties of one dimensional symbol constellations (BPSK), it is shown that it is possible to improve or simplify a class of algorithms for blind channel identification. It is also shown that in the case of one dimensional symbol constellations there is a third way, apart from multiple antennas and oversampling, of arriving at a multichannel representation of the communication system.
Blind subspace identification of a BPSK communication channel
Asilomar 1997, 31st IEEE Annual Asilomar conference on signals, systems & computers, November 2-5, 1997, Pacific Grove, USA
Systèmes de Communication
© 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/570