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

A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras

Camilla Hollanti, Jyrki Lahtonen, A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras. In: Proceedings of the 2006 IEEE Information Theory Workshop (ITW 2006), March 13-17, Punta del Este, Uruguay, 322--326, IEEE, 2006.

Abstract:

A means to construct dense, full-diversity STBCs from maximal orders in central simple algebras is introduced for the first time. As an example we
construct an efficient ST lattice code with non-vanishing determinant for four transmit antenna MISO application. Also a general algorithm for testing the maximality of a given order is presented. By using a maximal order instead of just the ring of algebraic integers, the size of the code increases without losses in the minimum determinant. The usage of a proper ideal of a maximal order further improves the code, as the minimum determinant increases. Simulations in a quasi-static Rayleigh fading channel show that our lattice outperforms the DAST-lattice due to the properties described above.

Files:

Abstract in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpHoLa06a,
  title = {A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras},
  booktitle = {Proceedings of the 2006 IEEE Information Theory Workshop (ITW 2006), March 13-17, Punta del Este, Uruguay},
  author = {Hollanti, Camilla and Lahtonen, Jyrki},
  publisher = {IEEE},
  pages = {322--326},
  year = {2006},
}

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

Edit publication