A new tool: Constructing STBCs from maximal orders in central simple algebras

Camilla Hollanti*, Jyrki Lahtonen

*Corresponding author for this work

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

13 Citations (Scopus)

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 4 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.

Original languageEnglish
Title of host publication2006 IEEE Information Theory Workshop, ITW 2006
Pages322-326
Number of pages5
Publication statusPublished - 2006
MoE publication typeA4 Conference publication
EventIEEE Information Theory Workshop - Punta del Este, Uruguay
Duration: 13 Mar 200617 Mar 2006

Workshop

WorkshopIEEE Information Theory Workshop
Abbreviated titleITW
Country/TerritoryUruguay
CityPunta del Este
Period13/03/200617/03/2006

Fingerprint

Dive into the research topics of 'A new tool: Constructing STBCs from maximal orders in central simple algebras'. Together they form a unique fingerprint.

Cite this