Change search
ReferencesLink to record
Permanent link

Direct link
Design of robust linear dispersion codes based on imperfect
KTH, School of Electrical Engineering (EES), Signal Processing.
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2298-6774
2006 (English)In: Proceedings European Signal Processing Conference, 2006Conference paper (Refereed)
Abstract [en]

This paper concerns the design of codes for multiple-input multiple-output communication systems. The transmission scheme utilizes imperfect channel state information (CSI) in the design, assuming that maximum-likelihood detection is employed at the receiver. It is argued that channel diagonalizing codes are not robust to imperfections in the CSI. A robust non-diagonalizing code with good minimum distance separation between received codewords is proposed. The design is very suitable for systems operating at high data rates since the complexity scales nicely with the number of antennas. Numerical results show that the proposed code outperforms a state-of-the-art diagonalizing precoder.

Place, publisher, year, edition, pages
, European Signal Processing Conference, ISSN 22195491
Keyword [en]
Code-words, High data rate, Imperfect channel state information, Imperfect CSI, Linear dispersion codes, Maximum- likelihood detection, Minimum distance, Multiple-input multiple-output communication systems, Numerical results, Precoders, Transmission schemes
National Category
URN: urn:nbn:se:kth:diva-73193ScopusID: 2-s2.0-84862597820OAI: diva2:488624
14th European Signal Processing Conference, EUSIPCO 2006. Florence, Italy, September 4-8, 2006

QC 20141104

Available from: 2012-02-01 Created: 2012-02-01 Last updated: 2014-11-04Bibliographically approved

Open Access in DiVA

No full text


Search in DiVA

By author/editor
Bergman, SvanteOttersten, Björn
By organisation
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 67 hits
ReferencesLink to record
Permanent link

Direct link