Challenges in coding for quantized MIMO systems

Michel T. Ivrlač; Josef A. Nossek

doi:10.1109/ISIT.2006.261924

Challenges in coding for quantized MIMO systems

Michel T. Ivrlač, Josef A. Nossek

Chair of Circuit Theory and Signal Processing (2008 — 2021)

Technical University of Munich

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

31 Scopus citations

Abstract

This paper provides analysis of binary space-time block codes with optimum decoding for multi-input multi-output (MIMO) systems with one-bit receive signal quantization. Exhaustive investigation of short binary space-time block codes with unity code rate shows some remarkable results. For instance, almost all codes perform poorly, except one optimum channeldependent code which can achieve large coding gain. There are no binary 2×2 space-time block codes (including the Alamouti codes) which can achieve transmit diversity without some channel knowledge. However, there exist a few semi-universal codes which are optimum for almost all MIMO channels and can be selected by feedback from the receiver. Design of longer and more powerful codes remains a challenge and requires further research activity.

Original language	English
Title of host publication	Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages	2114-2118
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2006.261924
State	Published - 2006
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States Duration: 9 Jul 2006 → 14 Jul 2006

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Conference

Conference	2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/Territory	United States
City	Seattle, WA
Period	9/07/06 → 14/07/06

Access to Document

10.1109/ISIT.2006.261924

Cite this

@inproceedings{131697dae45346329a61ee10a2ce040e,

title = "Challenges in coding for quantized MIMO systems",

abstract = "This paper provides analysis of binary space-time block codes with optimum decoding for multi-input multi-output (MIMO) systems with one-bit receive signal quantization. Exhaustive investigation of short binary space-time block codes with unity code rate shows some remarkable results. For instance, almost all codes perform poorly, except one optimum channeldependent code which can achieve large coding gain. There are no binary 2×2 space-time block codes (including the Alamouti codes) which can achieve transmit diversity without some channel knowledge. However, there exist a few semi-universal codes which are optimum for almost all MIMO channels and can be selected by feedback from the receiver. Design of longer and more powerful codes remains a challenge and requires further research activity.",

author = "Ivrla{\v c}, {Michel T.} and Nossek, {Josef A.}",

year = "2006",

doi = "10.1109/ISIT.2006.261924",

language = "English",

isbn = "1424405041",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2114--2118",

booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

Ivrlač, MT & Nossek, JA 2006, Challenges in coding for quantized MIMO systems. in Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006., 4036342, IEEE International Symposium on Information Theory - Proceedings, pp. 2114-2118, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, WA, United States, 9/07/06. https://doi.org/10.1109/ISIT.2006.261924

TY - GEN

T1 - Challenges in coding for quantized MIMO systems

AU - Ivrlač, Michel T.

AU - Nossek, Josef A.

PY - 2006

Y1 - 2006

N2 - This paper provides analysis of binary space-time block codes with optimum decoding for multi-input multi-output (MIMO) systems with one-bit receive signal quantization. Exhaustive investigation of short binary space-time block codes with unity code rate shows some remarkable results. For instance, almost all codes perform poorly, except one optimum channeldependent code which can achieve large coding gain. There are no binary 2×2 space-time block codes (including the Alamouti codes) which can achieve transmit diversity without some channel knowledge. However, there exist a few semi-universal codes which are optimum for almost all MIMO channels and can be selected by feedback from the receiver. Design of longer and more powerful codes remains a challenge and requires further research activity.

AB - This paper provides analysis of binary space-time block codes with optimum decoding for multi-input multi-output (MIMO) systems with one-bit receive signal quantization. Exhaustive investigation of short binary space-time block codes with unity code rate shows some remarkable results. For instance, almost all codes perform poorly, except one optimum channeldependent code which can achieve large coding gain. There are no binary 2×2 space-time block codes (including the Alamouti codes) which can achieve transmit diversity without some channel knowledge. However, there exist a few semi-universal codes which are optimum for almost all MIMO channels and can be selected by feedback from the receiver. Design of longer and more powerful codes remains a challenge and requires further research activity.

UR - http://www.scopus.com/inward/record.url?scp=39049109609&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2006.261924

DO - 10.1109/ISIT.2006.261924

M3 - Conference contribution

AN - SCOPUS:39049109609

SN - 1424405041

SN - 9781424405046

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2114

EP - 2118

BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

Challenges in coding for quantized MIMO systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this