Four-group decodable space-time block codes

Dũng Ngoc Dào; Chau Yuen; Chintha Tellambura; Yong Liang Guan; Tjeng Thiang Tjhung

doi:10.1109/TSP.2007.906729

Four-group decodable space-time block codes

Dũng Ngoc Dào^*, Chau Yuen, Chintha Tellambura, Yong Liang Guan, Tjeng Thiang Tjhung

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

79 Citations (Scopus)

Abstract

Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.

Original language	English
Pages (from-to)	424-430
Number of pages	7
Journal	IEEE Transactions on Signal Processing
Volume	56
Issue number	1
DOIs	https://doi.org/10.1109/TSP.2007.906729
Publication status	Published - Jan 2008
Externally published	Yes

ASJC Scopus Subject Areas

Signal Processing
Electrical and Electronic Engineering

Keywords

Orthogonal designs
Performance analysis
Quasi-orthogonal space-time block codes
Space-time block codes (STBC)

Access to Document

10.1109/TSP.2007.906729

Cite this

@article{f815704dfca24bbe92a8a382347965d0,

title = "Four-group decodable space-time block codes",

abstract = "Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.",

keywords = "Orthogonal designs, Performance analysis, Quasi-orthogonal space-time block codes, Space-time block codes (STBC)",

author = "D{\`a}o, \{Dũng Ngoc\} and Chau Yuen and Chintha Tellambura and Guan, \{Yong Liang\} and Tjhung, \{Tjeng Thiang\}",

year = "2008",

month = jan,

doi = "10.1109/TSP.2007.906729",

language = "English",

volume = "56",

pages = "424--430",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Four-group decodable space-time block codes

AU - Dào, Dũng Ngoc

AU - Yuen, Chau

AU - Tellambura, Chintha

AU - Guan, Yong Liang

AU - Tjhung, Tjeng Thiang

PY - 2008/1

Y1 - 2008/1

N2 - Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.

AB - Two new rate-one full-diversity space-time block codes (STBCs) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, respectively. The exact pairwise error probability is derived to allow for the performance optimization of the two codes. Compared with existing low-decoding complexity STBC, the two new codes offer several advantages such as higher code rate, lower encoding/decoding delay and complexity, lower peak-to-average power ratio, and better performance.

KW - Orthogonal designs

KW - Performance analysis

KW - Quasi-orthogonal space-time block codes

KW - Space-time block codes (STBC)

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

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

U2 - 10.1109/TSP.2007.906729

DO - 10.1109/TSP.2007.906729

M3 - Article

AN - SCOPUS:37749035861

SN - 1053-587X

VL - 56

SP - 424

EP - 430

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 1

ER -

Four-group decodable space-time block codes

Abstract

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this