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.
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00749340
Contributor : Catherine Magnet <>
Submitted on : Wednesday, November 7, 2012 - 11:58:39 AM
Last modification on : Wednesday, February 20, 2019 - 4:32:10 PM

Identifiers

Collections

Citation

D. Duyck, M. Moeneclaey, Sheng Yang, F. Takawira, J. Boutros. Time-varying space-only codes. 2012 IEEE International Symposium on Information Theory Proceedings, Jul 2012, Cambridge, MA, United States. pp.2821 - 2825, ⟨10.1109/ISIT.2012.6284038⟩. ⟨hal-00749340⟩

Share

Metrics

Record views

180