An efficient decoding algorithm for STBC with multi-dimensional rotated constellations

Heunchul Lee, Jungho Cho, Jongkyu Kim, Inkyu Lee

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

22 Citations (Scopus)

Abstract

In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each in-phase and quadrature-phase component. For rate one quasi-orthogonal designs with N transmit antennas (N ≥ 4), the proposed decoding scheme reduces the decoding complexity from script O sign (M c N/2) to script O sign(Mc N/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages5558-5563
Number of pages6
Volume12
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: 2006 Jul 112006 Jul 15

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period06/7/1106/7/15

Fingerprint

Block codes
Decoding
Maximum likelihood
Space time codes
Quadrature amplitude modulation
Fading channels
Antennas

Keywords

  • Diversity methods
  • Maximum likelihood decoding
  • Space-Time Block Coding (STBC)

ASJC Scopus subject areas

  • Media Technology

Cite this

Lee, H., Cho, J., Kim, J., & Lee, I. (2006). An efficient decoding algorithm for STBC with multi-dimensional rotated constellations. In IEEE International Conference on Communications (Vol. 12, pp. 5558-5563). [4024947] https://doi.org/10.1109/ICC.2006.255547

An efficient decoding algorithm for STBC with multi-dimensional rotated constellations. / Lee, Heunchul; Cho, Jungho; Kim, Jongkyu; Lee, Inkyu.

IEEE International Conference on Communications. Vol. 12 2006. p. 5558-5563 4024947.

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

Lee, H, Cho, J, Kim, J & Lee, I 2006, An efficient decoding algorithm for STBC with multi-dimensional rotated constellations. in IEEE International Conference on Communications. vol. 12, 4024947, pp. 5558-5563, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 06/7/11. https://doi.org/10.1109/ICC.2006.255547
Lee H, Cho J, Kim J, Lee I. An efficient decoding algorithm for STBC with multi-dimensional rotated constellations. In IEEE International Conference on Communications. Vol. 12. 2006. p. 5558-5563. 4024947 https://doi.org/10.1109/ICC.2006.255547
Lee, Heunchul ; Cho, Jungho ; Kim, Jongkyu ; Lee, Inkyu. / An efficient decoding algorithm for STBC with multi-dimensional rotated constellations. IEEE International Conference on Communications. Vol. 12 2006. pp. 5558-5563
@inproceedings{5e077f806d2d4e6da24f2673b69fe6df,
title = "An efficient decoding algorithm for STBC with multi-dimensional rotated constellations",
abstract = "In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each in-phase and quadrature-phase component. For rate one quasi-orthogonal designs with N transmit antennas (N ≥ 4), the proposed decoding scheme reduces the decoding complexity from script O sign (M c N/2) to script O sign(Mc N/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.",
keywords = "Diversity methods, Maximum likelihood decoding, Space-Time Block Coding (STBC)",
author = "Heunchul Lee and Jungho Cho and Jongkyu Kim and Inkyu Lee",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/ICC.2006.255547",
language = "English",
isbn = "1424403553",
volume = "12",
pages = "5558--5563",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - An efficient decoding algorithm for STBC with multi-dimensional rotated constellations

AU - Lee, Heunchul

AU - Cho, Jungho

AU - Kim, Jongkyu

AU - Lee, Inkyu

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each in-phase and quadrature-phase component. For rate one quasi-orthogonal designs with N transmit antennas (N ≥ 4), the proposed decoding scheme reduces the decoding complexity from script O sign (M c N/2) to script O sign(Mc N/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.

AB - In this paper, we present a novel maximum likelihood (ML) decoding algorithm for space-time block codes (STBC) over fading channels. Using a lattice representation for space-time codes by transforming complex channel models into real matrix equations, we propose a new efficient ML decoding algorithm with performance identical to the conventional ML decoder. We show that the complex orthogonal space-time codes, in fact, allow a separate ML decoding for each in-phase and quadrature-phase component. For rate one quasi-orthogonal designs with N transmit antennas (N ≥ 4), the proposed decoding scheme reduces the decoding complexity from script O sign (M c N/2) to script O sign(Mc N/4) in a Mc-QAM constellation. Moreover, multidimensional rotated constellations are constructed by which the quasi-orthogonal codes can achieve full diversity, while the proposed ML decoding method offers significant computational savings as compared with previous approaches.

KW - Diversity methods

KW - Maximum likelihood decoding

KW - Space-Time Block Coding (STBC)

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

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

U2 - 10.1109/ICC.2006.255547

DO - 10.1109/ICC.2006.255547

M3 - Conference contribution

SN - 1424403553

SN - 9781424403554

VL - 12

SP - 5558

EP - 5563

BT - IEEE International Conference on Communications

ER -