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

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