2013/09/16 by Laura Luzzi, Luzzi, Laura, Roope Vehkalahti +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Advanced Wireless Network Optimization #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1309.3901
Conference (presented at ITW 2013, Sevilla, Spain) 5 pages. Version 2, march 2014: a mistake was corrected in Sections IV.A (including Example 4.1) and V.A
openalex publication_date 2013/09/16 · arxiv created 2014/03/25 · arxiv updated 2014/03/26 · openalex created_date 2022/10/06 · openalex updated_date 2026/07/30
This work considers normalized inverse determinant sums as a tool for analyzing the performance of division algebra based space-time codes for multiple antenna wireless systems. A general union bound based code design criterion is obtained as a main result. In our previous work, the behavior of inverse determinant sums was analyzed using point counting techniques for Lie groups; it was shown that the asymptotic growth exponents of these sums correctly describe the diversity-multiplexing gain trade-off of the space-time code for some multiplexing gain ranges. This paper focuses on the constant terms of the inverse determinant sums, which capture the coding gain behavior. Pursuing the Lie group approach, a tighter asymptotic bound is derived, allowing to compute the constant terms for several classes of space-time codes appearing in the literature. The resulting design criterion suggests that the performance of division algebra based codes depends on several fundamental algebraic invariants of the underlying algebra.