Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity

Minh-Tuan LE; Van-Su PHAM; Linh MAI; Giwan YOON

doi:10.1093/ietcom/e89-b.12.3376

Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity

Minh-Tuan LE, Van-Su PHAM, Linh MAI, Giwan YOON

Full Text Views

0

Share
Cite this

Summary :

This paper presents a family of rate-one quasi-orthogonal space-time block codes (QO-STBCs) for any number of transmit antennas. Full diversity of the proposed QO-STBCs is achieved via the use of constellation rotation. When the number of transmit antennas is even, these codes are delay "optimal." This property along with the quasi-orthogonality one allows the codes to have low decoding complexity. Besides, by applying lookup tables into the detection methods presented in [1] and generalizing them, two low-complexity maximum-likelihood (ML) decoders for the proposed QO-STBCs and for other existing QO-STBCs, called PMLD and QMLD, are obtained. Simulation results are provided to verify the bit error rate (BER) performances and complexities of both the proposed QO-STBCs and the proposed decoders.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.12 pp.3376-3385

Publication Date: 2006/12/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.12.3376

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Cite this

Copy

Minh-Tuan LE, Van-Su PHAM, Linh MAI, Giwan YOON, "Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 12, pp. 3376-3385, December 2006, doi: 10.1093/ietcom/e89-b.12.3376.
Abstract: This paper presents a family of rate-one quasi-orthogonal space-time block codes (QO-STBCs) for any number of transmit antennas. Full diversity of the proposed QO-STBCs is achieved via the use of constellation rotation. When the number of transmit antennas is even, these codes are delay "optimal." This property along with the quasi-orthogonality one allows the codes to have low decoding complexity. Besides, by applying lookup tables into the detection methods presented in [1] and generalizing them, two low-complexity maximum-likelihood (ML) decoders for the proposed QO-STBCs and for other existing QO-STBCs, called PMLD and QMLD, are obtained. Simulation results are provided to verify the bit error rate (BER) performances and complexities of both the proposed QO-STBCs and the proposed decoders.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.12.3376/_p

Copy

@ARTICLE{e89-b_12_3376,
author={Minh-Tuan LE, Van-Su PHAM, Linh MAI, Giwan YOON, },
journal={IEICE TRANSACTIONS on Communications},
title={Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity},
year={2006},
volume={E89-B},
number={12},
pages={3376-3385},
abstract={This paper presents a family of rate-one quasi-orthogonal space-time block codes (QO-STBCs) for any number of transmit antennas. Full diversity of the proposed QO-STBCs is achieved via the use of constellation rotation. When the number of transmit antennas is even, these codes are delay "optimal." This property along with the quasi-orthogonality one allows the codes to have low decoding complexity. Besides, by applying lookup tables into the detection methods presented in [1] and generalizing them, two low-complexity maximum-likelihood (ML) decoders for the proposed QO-STBCs and for other existing QO-STBCs, called PMLD and QMLD, are obtained. Simulation results are provided to verify the bit error rate (BER) performances and complexities of both the proposed QO-STBCs and the proposed decoders.},
keywords={},
doi={10.1093/ietcom/e89-b.12.3376},
ISSN={1745-1345},
month={December},}

Copy

TY - JOUR
TI - Rate-One Full-Diversity Quasi-Orthogonal STBCs with Low Decoding Complexity
T2 - IEICE TRANSACTIONS on Communications
SP - 3376
EP - 3385
AU - Minh-Tuan LE
AU - Van-Su PHAM
AU - Linh MAI
AU - Giwan YOON
PY - 2006
DO - 10.1093/ietcom/e89-b.12.3376
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2006
AB - This paper presents a family of rate-one quasi-orthogonal space-time block codes (QO-STBCs) for any number of transmit antennas. Full diversity of the proposed QO-STBCs is achieved via the use of constellation rotation. When the number of transmit antennas is even, these codes are delay "optimal." This property along with the quasi-orthogonality one allows the codes to have low decoding complexity. Besides, by applying lookup tables into the detection methods presented in [1] and generalizing them, two low-complexity maximum-likelihood (ML) decoders for the proposed QO-STBCs and for other existing QO-STBCs, called PMLD and QMLD, are obtained. Simulation results are provided to verify the bit error rate (BER) performances and complexities of both the proposed QO-STBCs and the proposed decoders.
ER -