Constructing optimal division algebras for space-time coding

Roope Vehkalahti*

*Corresponding author for this work

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

3 Citations (Scopus)

Abstract

In [1] the authors suggested that in order to derive energy efficient space-time MMO codes from orders of the division algebras one should use maximal orders instead of natural ones.

They also described the division algebras that have the best maximal orders in terms of minimum determinant vs. average power. However, they were able to construct division algebras that were optimal only in few separate cases.

In this paper we are addressing this problem and giving an explicit construction for optimal division algebras of arbitrary degree in the case when the center is Q(i).

We note that all the results of this paper can be found from [2]. The goal of this paper is to give a simple representation of construction methods of [2].

Original languageEnglish
Title of host publicationProceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks
EditorsT Helleseth, PV Kumar, O Ytrehus
PublisherIEEE
Pages106-110
Number of pages5
ISBN (Print)978-1-4244-1199-3
DOIs
Publication statusPublished - 2007
MoE publication typeA4 Article in a conference publication
EventIEEE Information Theory on Workshop Information Theory on Wireless Networks - Bergen, Norway
Duration: 1 Jul 20076 Jul 2007

Workshop

WorkshopIEEE Information Theory on Workshop Information Theory on Wireless Networks
CountryNorway
CityBergen
Period01/07/200706/07/2007

Cite this