Blind Subspace Identification of a BPSK Communication Channel
1996 (English)In: 30:th Asilomar Conference on Signals, Systems & Computers, IEEE , 1996, 828-832 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 1996. 828-832 p.
Baseband, Binary phase shift keying, Communication channels, Computational complexity, Constellation diagram, Covariance matrix, Equations, Finite impulse response filter, Sensor systems, Signal processing
IdentifiersURN: urn:nbn:se:kth:diva-92585DOI: 10.1109/ACSSC.1996.599060OAI: oai:DiVA.org:kth-92585DiVA: diva2:513850
30:th Asilomar Conference on Signals, Systems & Computers. 3-6 Nov. 1996, Pacific Grove, CA, USA
NR 201408052012-04-032012-04-032012-04-03Bibliographically approved