• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Optimal Matrix Lattices for MIMO Codes from Division Algebras

Camilla Hollanti, Jyrki Lahtonen, Kalle Ranto, Roope Vehkalahti, Optimal Matrix Lattices for MIMO Codes from Division Algebras. In: Proceedings of 2006 IEEE International Symposium on Information Theory, 783-787, 2006.

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.

Files:

Abstract in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpHoLaRaVe06a,
  title = {Optimal Matrix Lattices for MIMO Codes from Division Algebras},
  booktitle = {Proceedings of 2006 IEEE International Symposium on Information Theory},
  author = {Hollanti, Camilla and Lahtonen, Jyrki and Ranto, Kalle and Vehkalahti, Roope},
  pages = {783-787},
  year = {2006},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication