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

Rong Ran, Dong Ku Kim

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationFirst International Conference on Communications and Networking in China, ChinaCom '06
PublisherIEEE Computer Society
ISBN (Print)1424404630, 9781424404636
DOIs
Publication statusPublished - 2007 Jan 1
Event1st International Conference on Communications and Networking in China, ChinaCom '06 - Beijing, China
Duration: 2006 Oct 252006 Oct 27

Other

Other1st International Conference on Communications and Networking in China, ChinaCom '06
CountryChina
CityBeijing
Period06/10/2506/10/27

Fingerprint

Block codes
Decoding

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Ran, R., & Kim, D. K. (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. https://doi.org/10.1109/CHINACOM.2006.344650
Ran, Rong ; Kim, Dong Ku. / An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity. First International Conference on Communications and Networking in China, ChinaCom '06. IEEE Computer Society, 2007.
@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 = "1",
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",

}

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

An optimal complex precoder for quasi-orthogonal space-time block codes with reduced decoding complexity. / Ran, Rong; Kim, Dong Ku.

First International Conference on Communications and Networking in China, ChinaCom '06. IEEE Computer Society, 2007. 4149903.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

AN - SCOPUS:36049007266

SN - 1424404630

SN - 9781424404636

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

PB - IEEE Computer Society

ER -

Ran R, Kim DK. 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. IEEE Computer Society. 2007. 4149903 https://doi.org/10.1109/CHINACOM.2006.344650