Bounds on Fast Decodability of Space-Time Block Codes, Skew-Hermitian Matrices, and Azumaya Algebras

DOI10.1109/TIT.2015.2402128zbMATH Open1359.94835arXiv1405.5966OpenAlexW2005822814MaRDI QIDQ2978699FDOQ2978699

Authors: Grégory Berhuy, Nadya Markin, B. A. Sethuraman 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study fast lattice decodability of space-time block codes for $n$ transmit and receive antennas, written very generally as a linear combination $su{m}_{i=1}^{2l}{s}_i{A}_i$, where the $s_i$ are real information symbols and the $A_i$ are $nimesn$ $mathbbR$-linearly independent complex valued matrices. We show that the mutual orthogonality condition $A_i{A}_j^{\ast }+A_j{A}_i^{\ast }=0$ for distinct basis matrices is not only sufficient but also necessary for fast decodability. We build on this to show that for full-rate ($l=n^2$) transmission, the decoding complexity can be no better than $|S{|}^{n^2+1}$, where $|S|$ is the size of the effective real signal constellation. We also show that for full-rate transmission, $g$-group decodability, as defined in [1], is impossible for any $gge2$. We then use the theory of Azumaya algebras to derive bounds on the maximum number of groups into which the basis matrices can be partitioned so that the matrices in different groups are mutually orthogonal---a key measure of fast decodability. We show that in general, this maximum number is of the order of only the $2$-adic value of $n$. In the case where the matrices $A_i$ arise from a division algebra, which is most desirable for diversity, we show that the maximum number of groups is only $4$. As a result, the decoding complexity for this case is no better than $|S{|}^{lceill/2ceil}$ for any rate $l$.

Full work available at URL: https://arxiv.org/abs/1405.5966

Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35)

Cited In (2)

• On fast-decodable algebraic space-time codes
• Mutually orthogonal matrices from division algebras

This page was built for publication: Bounds on Fast Decodability of Space-Time Block Codes, Skew-Hermitian Matrices, and Azumaya Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978699)