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 language | English |
---|---|
Title of host publication | 2006 IEEE Information Theory Workshop, ITW 2006 |
Pages | 322-326 |
Number of pages | 5 |
Publication status | Published - 2006 |
MoE publication type | A4 Conference publication |
Event | IEEE Information Theory Workshop - Punta del Este, Uruguay Duration: 13 Mar 2006 → 17 Mar 2006 |
Workshop
Workshop | IEEE Information Theory Workshop |
---|---|
Abbreviated title | ITW |
Country/Territory | Uruguay |
City | Punta del Este |
Period | 13/03/2006 → 17/03/2006 |