Cyclic Division Algebras: A Tool for Space-Time Coding

• DOI: 10.1561/0100000016
• Publication Date: 2007-12-06T10:57:16Z
• Authors: Frédérique Oggier; Jean-Claude Belfiore; Emanuele Viterbo
• Keywords: non-vanishing determinant; perfect space–time codes; space–time coding; full diversity; 02 engineering and technology; Cyclic algebras; 620; 004; 0202 electrical engineering, electronic engineering, information engineering; golden code; division algebras; Caltech Library Services

Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space–Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requires that the difference of any two distinct codewords has full rank. Extensive work has been done on Space–Time coding, aiming at finding fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space–Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. The aim of this work is to provide a tutorial introduction to the algebraic tools involved in the design of codes based on cyclic division algebras. The different design criteria involved will be illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property, and the diversity multiplexing trade-off. The final target is to give the complete mathematical background underlying the construction of the Golden code and the other Perfect Space–Time block codes.