Space-time codes based on rank-metric codes and their decoding

Sven Puchinger, Sebastian Stern, Martin Bossert, Robert F.H. Fischer

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

9 Scopus citations

Abstract

In this paper, a new class of space-time block codes is proposed. The new construction is based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order and improve upon existing constructions. Moreover, a new decoding algorithm for these codes is presented, utilizing the algebraic structure of the underlying finite-field rank-metric codes and employing lattice-reduction-aided equalization. This decoder does not achieve the same performance as the classical maximum-likelihood decoding methods, but has polynomial complexity in the matrix dimension, making it usable for large field sizes and numbers of antennas.

Original languageEnglish
Title of host publicationISWCS 2016 - 13th International Symposium on Wireless Communication Systems, Proceedings
PublisherVDE VERLAG GMBH
Pages125-130
Number of pages6
ISBN (Electronic)9781509020614
DOIs
StatePublished - 19 Oct 2016
Externally publishedYes
Event13th International Symposium on Wireless Communication Systems, ISWCS 2016 - Poznan, Poland
Duration: 20 Sep 201623 Sep 2016

Publication series

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

Conference

Conference13th International Symposium on Wireless Communication Systems, ISWCS 2016
Country/TerritoryPoland
CityPoznan
Period20/09/1623/09/16

Keywords

  • Decoding
  • Eisenstein Integers
  • Gabidulin Codes
  • Lattice Reduction
  • Space-Time Codes

Fingerprint

Dive into the research topics of 'Space-time codes based on rank-metric codes and their decoding'. Together they form a unique fingerprint.

Cite this