Space time codes improve communication reliability for many antennas
Non-Vanishing Determinant Space-Time Codes from Abelian Crossed Product Algebras
Information Theory
Summary
Reliable wireless communication with many antennas requires special codes that prevent signal loss. The authors found new ways to create such codes using advanced algebra that avoid problems seen in previous designs. Their approach produces codes with guaranteed non-zero signal strength, leading to better performance in big antenna systems. They also provide specific examples for 4 and 8 antenna setups with measurable improvements over earlier methods.
What this means in practice
- •For wireless communication engineers: Design improved multi-antenna coding schemes that maintain reliable signal quality using new Abelian crossed product codes with guaranteed minimum determinants.
- •For telecommunications hardware designers: Implement high-performance 8x8 antenna array codes that offer stronger error resistance and better decoding reliability based on algebraic structures from this work.
Authors
Farhad Barzegar, Dariush Kiani, Hassan Khodaiemehr
Abstract
Every explicit non-cyclic crossed product space--time code for more than four antennas has relied on transcendental structure constants, and its coding gain is therefore not bounded away from zero. We explain this phenomenon and show how to avoid it. Over a number field, the commuting-generator (tensor product) construction yields a division algebra only in the cyclic case, and a division crossed product of prime-power degree requires two places with full decomposition group; in particular, no $(\Z/2)^r$, $r\ge3$, crossed product division algebra exists over $\Q(i)$. We then introduce Abelian crossed products with a commutator twist, give the general parametric form of their codewords as a $2\times2$ block matrix of cyclic-algebra codewords, and prove the division property with a centralizer argument and a tame norm-residue symbol. This yields algebraic codes over $\Q(i)$ with non-vanishing determinants and closed-form minimum determinants: an information-lossless $4\times4$ $(\Z/2)^2$ code with $δ_{\min}=1/2000$, and an infinite family of DMT-optimal $8\times8$ $\Z/4\times\Z/2$ codes indexed by primes $p\equiv5\pmod8$, whose commutator and cyclic constants are roots of unity. The member $p=5$, defined over $\Q(ζ_{40})$, has minimum determinant exactly $1/5$ before normalization, at least $34.7$ times that of the $8\times8$ perfect code at equal energy, and its rate-2 subcode for $8\times2$ systems has at least $5$ times the minimum determinant of the punctured perfect code. A determinant-spectrum analysis shows that at practical error rates the multiplicity of small determinants, rather than their minimum, governs performance, and it explains all simulated results.