Where academic tradition
meets the exciting future

Asymmetric Space-Time Block Codes for MIMO Systems

Camilla Hollanti, Kalle Ranto, Asymmetric Space-Time Block Codes for MIMO Systems. In: P. Vijay Kumar Oyvind Ytrehus Tor Helleseth (Ed.), Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, 101-105, 2007.

Abstract:

In this paper, the need for the construction of asymmetric space-time block codes (ASTBCs) is discussed, mostly concentrating on the case of four transmitting and two receiving antennas for simplicity. Above the trivial puncturing method, i.e. switching off the extra layers in the symmetric multiple input-multiple output (MIMO) setting, a more sophisticated yet simple asymmetric construction method is proposed. This method can be converted to produce multi-block space-time codes that achieve the diversity-multiplexing (D-M) tradeoff. It is also shown that maximizing the density of the newly proposed codes is equivalent to minimizing the discriminant of a certain order. The use of the general method is then demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). We verify by computer simulations that the newly proposed method can compete with the puncturing method, and in some cases outperforms it. Our conquering construction exploiting maximal orders improves even upon the punctured perfect code and the DjABBA code.

Files:

Abstract in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpHoRa07a,
  title = {Asymmetric Space-Time Block Codes for MIMO Systems},
  booktitle = {Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks},
  author = {Hollanti, Camilla and Ranto, Kalle},
  editor = {Tor Helleseth, P. Vijay Kumar Oyvind Ytrehus},
  pages = {101-105},
  year = {2007},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication