An Optimal Complex Precoder for Quasi-Orthogonal Space-Time Block Codes with reduced Decoding Complexity

Rong  Ran; DongKu  Kim

1st International ICST Conference on Communications and Networking in China

Research Article

An Optimal Complex Precoder for Quasi-Orthogonal Space-Time Block Codes with reduced Decoding Complexity

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344650,
    author={Rong  Ran and DongKu  Kim},
    title={An Optimal Complex Precoder for Quasi-Orthogonal Space-Time Block Codes with reduced Decoding Complexity},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344650}
}

Rong Ran
DongKu Kim
Year: 2007
An Optimal Complex Precoder for Quasi-Orthogonal Space-Time Block Codes with reduced Decoding Complexity
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344650

Rong Ran¹^,*, DongKu Kim¹^,*

1: Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea

*Contact email: sunny_rr@yonsei.ac.kr, dkkim@yonsei.ac.kr

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.

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344650