Construction Methods for Asymmetric and Multiblock Space–Time Codes

Abstract

In this paper, the need for the construction of asymmetric and multiblock space-time codes is discussed. Above the trivial puncturing method, i.e., switching off the extra layers in the symmetric multiple-input multiple-output (MIMO) setting, two more sophisticated asymmetric construction methods are proposed. The first method, called the block diagonal method (BDM), can be converted to produce multiblock space-time codes that achieve the diversity-multiplexing tradeoff (DMT). It is also shown that maximizing the density of the newly proposed block diagonal asymmetric space-time (AST) codes is equivalent to minimizing the discriminant of a certain order, a result that also holds as such for the multiblock codes. An implicit lower bound for the density is provided and made explicit for an important special case that contains e.g., the systems equipped with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4Tx</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+2Rx</i> antennas. Further, an explicit scheme achieving the bound is given. Another method proposed here is the smart puncturing method (SPM) that generalizes the subfield construction method proposed in earlier work by Hollanti and Ranto and applies to any number of transmitting and lesser receiving antennas. The use of the general methods is demonstrated by building explicit, sphere decodable codes using different cyclic division algebras (CDAs). Computer simulations verify that the newly proposed methods can compete with the trivial puncturing method, and in some cases clearly outperform it. The conquering construction exploiting maximal orders improves upon the punctured perfect code and the DjABBA code as well as the Icosian code. Also extensive DMT analysis is provided.