Reduced-complexity ML decodable STBCs: Revisited design criteria

Asma Mejri, Mohamed Achraf Khsiba, Ghaya Rekaya-Ben

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work, we revisit the structure of weight matrices for Linear Dispersion STBCs to admit ML decoding with low-complexity. We first propose novel sufficient design criteria for linear STBCs considering an arbitrary number of antennas and an arbitrary coding rate. Then we apply the derived criteria to three families of codes, multi-group decodable, fast decodable, and fast-group decodable codes. We provide analytical proofs showing that the ML-decoding complexity of such codes depends only on the weight matrices and their ordering and not on the channel gains or the number of antennas and explaining why the so far used Hurwitz- Radon theory-based approaches do not exactly determine the complexity of all classes of STBCs under ML decoding.

Original languageEnglish
Title of host publication2015 12th International Symposium on Wireless Communication Systems, ISWCS 2015 - Proceedings
PublisherVDE Verlag GmbH
Pages666-670
Number of pages5
ISBN (Electronic)9781467365406
DOIs
Publication statusPublished - 15 Apr 2015
Event12th International Symposium on Wireless Communication Systems, ISWCS 2015 - Brussels, Belgium
Duration: 25 Aug 201528 Aug 2015

Publication series

NameProceedings of the International Symposium on Wireless Communication Systems
Volume2016-April
ISSN (Print)2154-0217
ISSN (Electronic)2154-0225

Conference

Conference12th International Symposium on Wireless Communication Systems, ISWCS 2015
Country/TerritoryBelgium
CityBrussels
Period25/08/1528/08/15

Keywords

  • Fast decodable
  • Low-complexity decoding
  • Maximum likelihood decoding
  • Space-time block codes

Fingerprint

Dive into the research topics of 'Reduced-complexity ML decodable STBCs: Revisited design criteria'. Together they form a unique fingerprint.

Cite this