Fast-group-decodable space-time block code

Tian Peng Ren; Yang Liang Guan; Chau Yuen; Rang Jun Shen

doi:10.1109/ITWKSPS.2010.5503148

Fast-group-decodable space-time block code

Tian Peng Ren, Yang Liang Guan, Chau Yuen, Rang Jun Shen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

31 Citations (Scopus)

Abstract

To make the implementation of high-rate space-time block code (STBC) realistic in practical systems, fast-decodable (FD) and group-decodable (GD) code structures have been separately introduced into STBC to reduce the sphere decoding complexity. However, no STBC has both the two code structures until now. In this paper, high-rate fast-group-decodable STBC (FGD-STBC, which has both FD and GD code structures) is proposed for the first time. We first derive the condition for FD code structure with the lowest sphere decoding complexity, then we prove that such FD code structure can be integrated with the GD-STBC for FGD-STBC construction. Analysis and simulation show that the proposed FGD-STBC has much lower decoding complexity and comparable performance with the existing FD-STBC.

Original language	English
Title of host publication	IEEE Information Theory Workshop 2010, ITW 2010
DOIs	https://doi.org/10.1109/ITWKSPS.2010.5503148
Publication status	Published - 2010
Externally published	Yes
Event	IEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt Duration: Jan 6 2010 → Jan 8 2010

Publication series

Name	IEEE Information Theory Workshop 2010, ITW 2010

Conference

Conference	IEEE Information Theory Workshop 2010, ITW 2010
Country/Territory	Egypt
City	Cairo
Period	1/6/10 → 1/8/10

ASJC Scopus Subject Areas

Computational Theory and Mathematics
Theoretical Computer Science

Access to Document

10.1109/ITWKSPS.2010.5503148

Cite this

@inproceedings{624593dee30d4ff0ad0bee559fd4f480,

title = "Fast-group-decodable space-time block code",

abstract = "To make the implementation of high-rate space-time block code (STBC) realistic in practical systems, fast-decodable (FD) and group-decodable (GD) code structures have been separately introduced into STBC to reduce the sphere decoding complexity. However, no STBC has both the two code structures until now. In this paper, high-rate fast-group-decodable STBC (FGD-STBC, which has both FD and GD code structures) is proposed for the first time. We first derive the condition for FD code structure with the lowest sphere decoding complexity, then we prove that such FD code structure can be integrated with the GD-STBC for FGD-STBC construction. Analysis and simulation show that the proposed FGD-STBC has much lower decoding complexity and comparable performance with the existing FD-STBC.",

author = "Ren, {Tian Peng} and Guan, {Yang Liang} and Chau Yuen and Shen, {Rang Jun}",

year = "2010",

doi = "10.1109/ITWKSPS.2010.5503148",

language = "English",

isbn = "9781424463725",

series = "IEEE Information Theory Workshop 2010, ITW 2010",

booktitle = "IEEE Information Theory Workshop 2010, ITW 2010",

note = "IEEE Information Theory Workshop 2010, ITW 2010 ; Conference date: 06-01-2010 Through 08-01-2010",

}

TY - GEN

T1 - Fast-group-decodable space-time block code

AU - Ren, Tian Peng

AU - Guan, Yang Liang

AU - Yuen, Chau

AU - Shen, Rang Jun

PY - 2010

Y1 - 2010

N2 - To make the implementation of high-rate space-time block code (STBC) realistic in practical systems, fast-decodable (FD) and group-decodable (GD) code structures have been separately introduced into STBC to reduce the sphere decoding complexity. However, no STBC has both the two code structures until now. In this paper, high-rate fast-group-decodable STBC (FGD-STBC, which has both FD and GD code structures) is proposed for the first time. We first derive the condition for FD code structure with the lowest sphere decoding complexity, then we prove that such FD code structure can be integrated with the GD-STBC for FGD-STBC construction. Analysis and simulation show that the proposed FGD-STBC has much lower decoding complexity and comparable performance with the existing FD-STBC.

AB - To make the implementation of high-rate space-time block code (STBC) realistic in practical systems, fast-decodable (FD) and group-decodable (GD) code structures have been separately introduced into STBC to reduce the sphere decoding complexity. However, no STBC has both the two code structures until now. In this paper, high-rate fast-group-decodable STBC (FGD-STBC, which has both FD and GD code structures) is proposed for the first time. We first derive the condition for FD code structure with the lowest sphere decoding complexity, then we prove that such FD code structure can be integrated with the GD-STBC for FGD-STBC construction. Analysis and simulation show that the proposed FGD-STBC has much lower decoding complexity and comparable performance with the existing FD-STBC.

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

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

U2 - 10.1109/ITWKSPS.2010.5503148

DO - 10.1109/ITWKSPS.2010.5503148

M3 - Conference contribution

AN - SCOPUS:77954828867

SN - 9781424463725

T3 - IEEE Information Theory Workshop 2010, ITW 2010

BT - IEEE Information Theory Workshop 2010, ITW 2010

T2 - IEEE Information Theory Workshop 2010, ITW 2010

Y2 - 6 January 2010 through 8 January 2010

ER -

Fast-group-decodable space-time block code

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this