Abstract
Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and without 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. Previous work reducing the complexity of decoding STCs has focused on the decoding algorithm, because the dimensions of the STC cannot be reduced without losing rate or diversity for uncoded communication. However, for coded communication (assuming the presence of an outer code), the dimensions of the STC may be reduced. We propose a new full-rate and full-diversity suboptimal time-varying space-only code, adding a new dimension to the work on complexity reduction. Full diversity is proved in terms of the outage probability.
| Original language | English |
|---|---|
| Title of host publication | 5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012 |
| DOIs | |
| Publication status | Published - 27 Jul 2012 |
| Event | 5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012 - Rome, Italy Duration: 2 May 2012 → 4 May 2012 |
Other
| Other | 5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012 |
|---|---|
| Country | Italy |
| City | Rome |
| Period | 2/5/12 → 4/5/12 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
Cite this
Time-varying space-only code : A new paradigm for coded MIMO communication. / Duyck, Dieter; Yang, Sheng; Takawira, Fambirai; Boutros, Joseph; Moeneclaey, Marc.
5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012. 2012. 6217779.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Time-varying space-only code
T2 - A new paradigm for coded MIMO communication
AU - Duyck, Dieter
AU - Yang, Sheng
AU - Takawira, Fambirai
AU - Boutros, Joseph
AU - Moeneclaey, Marc
PY - 2012/7/27
Y1 - 2012/7/27
N2 - Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and without 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. Previous work reducing the complexity of decoding STCs has focused on the decoding algorithm, because the dimensions of the STC cannot be reduced without losing rate or diversity for uncoded communication. However, for coded communication (assuming the presence of an outer code), the dimensions of the STC may be reduced. We propose a new full-rate and full-diversity suboptimal time-varying space-only code, adding a new dimension to the work on complexity reduction. Full diversity is proved in terms of the outage probability.
AB - Multiple antennas are used to increase reliability and bit rate for a given bandwidth. For a fixed transmission rate, discrete input alphabets and without 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. Previous work reducing the complexity of decoding STCs has focused on the decoding algorithm, because the dimensions of the STC cannot be reduced without losing rate or diversity for uncoded communication. However, for coded communication (assuming the presence of an outer code), the dimensions of the STC may be reduced. We propose a new full-rate and full-diversity suboptimal time-varying space-only code, adding a new dimension to the work on complexity reduction. Full diversity is proved in terms of the outage probability.
UR - http://www.scopus.com/inward/record.url?scp=84864127769&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864127769&partnerID=8YFLogxK
U2 - 10.1109/ISCCSP.2012.6217779
DO - 10.1109/ISCCSP.2012.6217779
M3 - Conference contribution
AN - SCOPUS:84864127769
SN - 9781467302760
BT - 5th International Symposium on Communications Control and Signal Processing, ISCCSP 2012
ER -