Papers
Topics
Authors
Recent
Search
2000 character limit reached

A family of fast-decodable MIDO codes from crossed-product algebras over Q

Published 16 Feb 2011 in cs.IT, math.IT, and math.RA | (1102.3298v1)

Abstract: Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum Likelihood (ML) decoding complexity, full diversity and the non-vanishing determinant (NVD) property are mostly based on cyclic division algebras. In this paper, a new family of MIDO codes with the NVD property based on crossed-product algebras over Q is introduced. Fast decodability follows naturally from the structure of the codewords which consist of four generalized Alamouti blocks. The associated ML complexity order is the lowest known for full-rate MIDO codes (O(M{10}) instead of O(M{16}) with respect to the real constellation size M). Numerical simulations show that these codes have a performance from comparable up to 1dB gain compared to the best known MIDO code with the same complexity.

Citations (21)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.