A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes (2022)


Vehkalahti, R., & Luzzi, L. (2022). The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes. IEEE Transactions on Information Theory, 68(5), 2999-3013. https://doi.org/10.1109/tit.2021.3137153


JYU-tekijät tai -toimittajat


Julkaisun tiedot

Julkaisun kaikki tekijät tai toimittajatVehkalahti, Roope; Luzzi, Laura

Lehti tai sarjaIEEE Transactions on Information Theory

ISSN0018-9448

eISSN1557-9654

Julkaisuvuosi2022

Volyymi68

Lehden numero5

Artikkelin sivunumerot2999-3013

KustantajaIEEE

JulkaisumaaYhdysvallat (USA)

Julkaisun kielienglanti

DOIhttps://doi.org/10.1109/tit.2021.3137153

Julkaisun avoin saatavuusEi avoin

Julkaisukanavan avoin saatavuus

Julkaisu on rinnakkaistallennettu (JYX)https://jyx.jyu.fi/handle/123456789/85365

Rinnakkaistallenteen verkko-osoite (pre-print)https://arxiv.org/abs/2102.09910


Tiivistelmä

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes for the n × m MIMO channel. Such codes correspond to lattices in Mn(C) with dimension smaller than 2n2. Currently, very little is known about their DMT, except in the case m = 1, corresponding to the multiple input single output (MISO) channel. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for a lattice code to achieve these upper bounds. We also show that lattice codes based on Q-central division algebras satisfy this optimality criterion. As a corollary this result provides a DMT classification for all Q-central division algebra codes that are based on standard embeddings. While the Q-central division algebra based codes achieve the largest possible DMT of a code restricted to either real or quaternion space, they still fall short of the optimal DMT apart from the MISO case.


YSO-asiasanatalgebrakoodausteoriatiedonsiirtoMIMO-tekniikka

Vapaat asiasanatlattices; algebra; space-time codes; encoding; MIMO communication; maximum likelihood decoding; upper bound


Liittyvät organisaatiot


OKM-raportointiKyllä

VIRTA-lähetysvuosi2022

JUFO-taso3


Viimeisin päivitys 2024-12-10 klo 13:00