Maximal Orders in the Design of Dense Space-Time Lattice Codes

DOI10.1109/TIT.2008.928998MaRDI QIDQ3604896zbMATH OpenOpenAlexFDO

Authors Jyrki Lahtonen, Hsiao-Feng Lu (Francis), Camilla Hollanti

Publication date 24 February 2009

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

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

Mathematics Subject Classification ID

Finite-dimensional division rings (16K20) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Abstract: We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number of Tx antennas. The usage of ideals guarantees a non-vanishing determinant larger than one and an easy way to present the exact proofs for the minimum determinants. The idea of finding denser sublattices within a given division algebra is then generalized to a multiple-input multiple-output (MIMO) case with an arbitrary number of Tx antennas by using the theory of cyclic division algebras (CDA) and maximal orders. It is also shown that the explicit constructions in this paper all have a simple decoding method based on sphere decoding. Related to the decoding complexity, the notion of sensitivity is introduced, and experimental evidence indicating a connection between sensitivity, decoding complexity and performance is provided. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform both the earlier rectangular lattices and the rotated ABBA lattice as well as the DAST lattice. We also show that our quaternionic lattice is better than the DAST lattice in terms of the diversity-multiplexing gain tradeoff.

Recommendations

• Space–Time Codes From Structured Lattices
• Design of Spherical Lattice Space–Time Codes
• On optimal multilayer cyclotomic space-time code designs
• Maximum rank distance codes as space~time codes
• A $2\times 2$ lattice space-time code of the highest rank
• Systematic and optimal cyclotomic lattices and diagonal space-time block code designs
• Multidimensional lattices and limit efficiency of modulation and coding
• Geometrical Relations Between Space–Time Block Code Designs and Complexity Reduction
• Lattice and construction of high coding gain lattices from codes

Cited in

(13)

• Natural orders for asymmetric space-time coding: minimizing the discriminant
• Algebraic construction of lattices via maximal quaternion orders
• On fast-decodable algebraic space-time codes
• An Algebraic Family of Complex Lattices for Fading Channels With Application to Space–Time Codes
• Systematic and optimal cyclotomic lattices and diagonal space-time block code designs
• On optimal multilayer cyclotomic space-time code designs
• Cyclic division algebras in space-time coding: a brief overview
• The Icosian Code and the $E_8$ Lattice: A New $4\,\times\,4$ Space–Time Code With Nonvanishing Determinant
• Lattices from maximal orders into quaternion algebras
• Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes
• Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
• Algebraic equipage for learning with errors in cyclic division algebras
• Learning with errors from nonassociative algebras

This page was built for publication: Maximal Orders in the Design of Dense Space-Time Lattice Codes

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