Fast-decodable MIDO codes from crossed product algebras

Frédérique Oggier*, Roope Vehkalahti, Camilla Hollanti

*Corresponding author for this work

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

17 Citations (Scopus)


The goal of this paper is to design fast-decodable space-time codes for four transmit and two receive antennas. The previous attempts to build such codes have resulted in codes that are not full rank and hence cannot provide full diversity or high coding gains. Extensive work carried out on division algebras indicates that in order to get, not only non-zero but perhaps even non-vanishing determinants (NVD) one should look at division algebras and their orders. To further aid the decoding, we will build our codes so that they consist of four generalized Alamouti blocks which allows decoding with reduced complexity. As far as we know, the resulting codes are the first having both reduced decoding complexity, and at the same time allowing one to give a proof of the NVD property.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Number of pages5
Publication statusPublished - 2010
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Austin, United States
Duration: 13 Jun 201018 Jun 2010


ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryUnited States

Fingerprint Dive into the research topics of 'Fast-decodable MIDO codes from crossed product algebras'. Together they form a unique fingerprint.

Cite this