Optimal matrix lattices for MIMO codes from division algebras

Camilla Hollanti*, Jyrki Lahtonen, Kalle Ranto, Roope Vehkalahti

*Corresponding author for this work

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

13 Citations (Scopus)

Abstract

We show why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed non-vanishing minimal determinant. Using results from class field theory we derive a lower bound to the minimum discriminant of a maximal order with a given center and index (= the number of Tx/Rx antennas). We also give examples of division algebras achieving our bound. E.g. we construct a matrix lattice with QAM coefficients that has (inside 'large' subsets of the signal space) 2.5 times as many codewords as the celebrated Golden code of the same minimum determinant. We also give another matrix lattice with coefficients from the hexagonal lattice with an even higher density.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages783-787
Number of pages5
DOIs
Publication statusPublished - 2006
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Seattle, United States
Duration: 9 Jul 200614 Jul 2006

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryUnited States
CitySeattle
Period09/07/200614/07/2006

Fingerprint Dive into the research topics of 'Optimal matrix lattices for MIMO codes from division algebras'. Together they form a unique fingerprint.

Cite this