Time-varying space-only codes

Dieter Duyck, Marc Moeneclaey, Sheng Yang, Fambirai Takawira, Joseph Boutros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and no channel state information at the transmitter, optimal space-time codes (STCs) achieving both gains (full rate and full diversity) are well known. However, the complexity of maximum likelihood decoding increases exponentially with the number of space and time dimensions of the STC. Despite praiseworthy efforts to reduce the decoding complexity, optimal STCs are not used in practice in the case of more than two transmit antennas because of complexity reasons. It is generally accepted that reducing the dimension of the STC leads to a reduced diversity order. We show that this is not true for coded communication, assuming the presence of an outer error-correcting code with any coding rate. We propose a new class of full-rate full-diversity STCs; more specifically, time-varying space-only codes. This new class is referred to as EMI codes. Full diversity is proven in terms of outage probability, for the case where the number of receive antennas is larger than or equal to the number of transmit antennas, and is numerically verified in terms of outage and word error probability using LDPC codes.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages2821-2825
Number of pages5
DOIs
Publication statusPublished - 22 Oct 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Other

Other2012 IEEE International Symposium on Information Theory, ISIT 2012
CountryUnited States
CityCambridge, MA
Period1/7/126/7/12

Fingerprint

Space time codes
Time-varying
Space-time
Antennas
Antenna
Optimal Codes
Outages
Decoding
LDPC Codes
Multiple Antennas
Error-correcting Codes
Outage Probability
Channel state information
Channel State Information
Error Probability
Transmitter
Maximum likelihood
Maximum Likelihood
Transmitters
Coding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Duyck, D., Moeneclaey, M., Yang, S., Takawira, F., & Boutros, J. (2012). Time-varying space-only codes. In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 (pp. 2821-2825). [6284038] https://doi.org/10.1109/ISIT.2012.6284038

Time-varying space-only codes. / Duyck, Dieter; Moeneclaey, Marc; Yang, Sheng; Takawira, Fambirai; Boutros, Joseph.

2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 2821-2825 6284038.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Duyck, D, Moeneclaey, M, Yang, S, Takawira, F & Boutros, J 2012, Time-varying space-only codes. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6284038, pp. 2821-2825, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/7/12. https://doi.org/10.1109/ISIT.2012.6284038
Duyck D, Moeneclaey M, Yang S, Takawira F, Boutros J. Time-varying space-only codes. In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. p. 2821-2825. 6284038 https://doi.org/10.1109/ISIT.2012.6284038
Duyck, Dieter ; Moeneclaey, Marc ; Yang, Sheng ; Takawira, Fambirai ; Boutros, Joseph. / Time-varying space-only codes. 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. 2012. pp. 2821-2825
@inproceedings{2a232ce49df64732ad4b839eeefa99ec,
title = "Time-varying space-only codes",
abstract = "Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and no channel state information at the transmitter, optimal space-time codes (STCs) achieving both gains (full rate and full diversity) are well known. However, the complexity of maximum likelihood decoding increases exponentially with the number of space and time dimensions of the STC. Despite praiseworthy efforts to reduce the decoding complexity, optimal STCs are not used in practice in the case of more than two transmit antennas because of complexity reasons. It is generally accepted that reducing the dimension of the STC leads to a reduced diversity order. We show that this is not true for coded communication, assuming the presence of an outer error-correcting code with any coding rate. We propose a new class of full-rate full-diversity STCs; more specifically, time-varying space-only codes. This new class is referred to as EMI codes. Full diversity is proven in terms of outage probability, for the case where the number of receive antennas is larger than or equal to the number of transmit antennas, and is numerically verified in terms of outage and word error probability using LDPC codes.",
author = "Dieter Duyck and Marc Moeneclaey and Sheng Yang and Fambirai Takawira and Joseph Boutros",
year = "2012",
month = "10",
day = "22",
doi = "10.1109/ISIT.2012.6284038",
language = "English",
isbn = "9781467325790",
pages = "2821--2825",
booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

}

TY - GEN

T1 - Time-varying space-only codes

AU - Duyck, Dieter

AU - Moeneclaey, Marc

AU - Yang, Sheng

AU - Takawira, Fambirai

AU - Boutros, Joseph

PY - 2012/10/22

Y1 - 2012/10/22

N2 - Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and no channel state information at the transmitter, optimal space-time codes (STCs) achieving both gains (full rate and full diversity) are well known. However, the complexity of maximum likelihood decoding increases exponentially with the number of space and time dimensions of the STC. Despite praiseworthy efforts to reduce the decoding complexity, optimal STCs are not used in practice in the case of more than two transmit antennas because of complexity reasons. It is generally accepted that reducing the dimension of the STC leads to a reduced diversity order. We show that this is not true for coded communication, assuming the presence of an outer error-correcting code with any coding rate. We propose a new class of full-rate full-diversity STCs; more specifically, time-varying space-only codes. This new class is referred to as EMI codes. Full diversity is proven in terms of outage probability, for the case where the number of receive antennas is larger than or equal to the number of transmit antennas, and is numerically verified in terms of outage and word error probability using LDPC codes.

AB - Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and no channel state information at the transmitter, optimal space-time codes (STCs) achieving both gains (full rate and full diversity) are well known. However, the complexity of maximum likelihood decoding increases exponentially with the number of space and time dimensions of the STC. Despite praiseworthy efforts to reduce the decoding complexity, optimal STCs are not used in practice in the case of more than two transmit antennas because of complexity reasons. It is generally accepted that reducing the dimension of the STC leads to a reduced diversity order. We show that this is not true for coded communication, assuming the presence of an outer error-correcting code with any coding rate. We propose a new class of full-rate full-diversity STCs; more specifically, time-varying space-only codes. This new class is referred to as EMI codes. Full diversity is proven in terms of outage probability, for the case where the number of receive antennas is larger than or equal to the number of transmit antennas, and is numerically verified in terms of outage and word error probability using LDPC codes.

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

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

U2 - 10.1109/ISIT.2012.6284038

DO - 10.1109/ISIT.2012.6284038

M3 - Conference contribution

SN - 9781467325790

SP - 2821

EP - 2825

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

ER -