An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity

Rong Ran; Dong Ku Kim

doi:10.1109/CHINACOM.2006.344650

An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity

Rong Ran, Dong Ku Kim

Department of Electrical and Electronic Engineering

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

Abstract

In this paper, we present an optimal linear complex precoder for quasi-orthogonal space-time block codes (QoSTBC). The advantage of the proposed coding scheme is that the diversity product can be maximized. Moreover, the smaller kissing number is achieved. The performance of the proposed coding scheme is studied in comparison with that of signal-constellation space-time block code (SC-QoSTBC) and space-time linear constellation precoder (ST-LCP). And our study shows that the proposed coding scheme offers full rate and outperforms SC-QoSTBC and ST-LCP.

Original language	English
Title of host publication	First International Conference on Communications and Networking in China, ChinaCom '06
Publisher	IEEE Computer Society
ISBN (Print)	1424404630, 9781424404636
DOIs	https://doi.org/10.1109/CHINACOM.2006.344650
Publication status	Published - 2007 Jan 1
Event	1st International Conference on Communications and Networking in China, ChinaCom '06 - Beijing, China Duration: 2006 Oct 25 → 2006 Oct 27

Other

Other	1st International Conference on Communications and Networking in China, ChinaCom '06
Country/Territory	China
City	Beijing
Period	06/10/25 → 06/10/27

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/CHINACOM.2006.344650

Cite this

@inproceedings{635098e5df5f46cb92ab1ddf8074de37,

title = "An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity",

abstract = "In this paper, we present an optimal linear complex precoder for quasi-orthogonal space-time block codes (QoSTBC). The advantage of the proposed coding scheme is that the diversity product can be maximized. Moreover, the smaller kissing number is achieved. The performance of the proposed coding scheme is studied in comparison with that of signal-constellation space-time block code (SC-QoSTBC) and space-time linear constellation precoder (ST-LCP). And our study shows that the proposed coding scheme offers full rate and outperforms SC-QoSTBC and ST-LCP.",

author = "Rong Ran and Kim, {Dong Ku}",

year = "2007",

month = jan,

day = "1",

doi = "10.1109/CHINACOM.2006.344650",

language = "English",

isbn = "1424404630",

booktitle = "First International Conference on Communications and Networking in China, ChinaCom '06",

publisher = "IEEE Computer Society",

address = "United States",

note = "1st International Conference on Communications and Networking in China, ChinaCom '06 ; Conference date: 25-10-2006 Through 27-10-2006",

}

Ran, R & Kim, DK 2007, An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity. in First International Conference on Communications and Networking in China, ChinaCom '06., 4149903, IEEE Computer Society, 1st International Conference on Communications and Networking in China, ChinaCom '06, Beijing, China, 06/10/25. https://doi.org/10.1109/CHINACOM.2006.344650

TY - GEN

T1 - An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity

AU - Ran, Rong

AU - Kim, Dong Ku

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In this paper, we present an optimal linear complex precoder for quasi-orthogonal space-time block codes (QoSTBC). The advantage of the proposed coding scheme is that the diversity product can be maximized. Moreover, the smaller kissing number is achieved. The performance of the proposed coding scheme is studied in comparison with that of signal-constellation space-time block code (SC-QoSTBC) and space-time linear constellation precoder (ST-LCP). And our study shows that the proposed coding scheme offers full rate and outperforms SC-QoSTBC and ST-LCP.

AB - In this paper, we present an optimal linear complex precoder for quasi-orthogonal space-time block codes (QoSTBC). The advantage of the proposed coding scheme is that the diversity product can be maximized. Moreover, the smaller kissing number is achieved. The performance of the proposed coding scheme is studied in comparison with that of signal-constellation space-time block code (SC-QoSTBC) and space-time linear constellation precoder (ST-LCP). And our study shows that the proposed coding scheme offers full rate and outperforms SC-QoSTBC and ST-LCP.

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

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

U2 - 10.1109/CHINACOM.2006.344650

DO - 10.1109/CHINACOM.2006.344650

M3 - Conference contribution

SN - 1424404630

SN - 9781424404636

BT - First International Conference on Communications and Networking in China, ChinaCom '06

PB - IEEE Computer Society

T2 - 1st International Conference on Communications and Networking in China, ChinaCom '06

Y2 - 25 October 2006 through 27 October 2006

ER -

An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this