Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels
Preprint
Abstract
This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading (BF) channels, which are characterized by piecewise-constant fading across blocks of transmitted symbols. This approach results in a semi-systematic generator matrix, providing a structured foundation for high-dimensional lattice design for BF channels. The proposed Construction-D lattices exhibit the full diversity property, making them highly effective for error performance improvement. To address this, we develop an efficient decoding algorithm designed specifically for full-diversity Construction-D lattices. Simulations indicate that the proposed lattices notably enhance error performance compared to full-diversity Construction-A lattices in diversity-2 cases. Interestingly, unlike AWGN channels, the expected performance enhancement of Construction-D over Construction-A, resulting from an increased number of nested code levels, was observed only in the two-level and diversity-2 cases. This phenomenon is likely attributed to the intensified effects of error propagation that occur during successive cancellation at higher levels, as well as the higher diversity orders. These findings highlight the promise of Construction-D lattices as an effective coding strategy for enhancing communication reliability in BF channels.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Construction of Capacity-Achieving Lattice Codes: Polar LatticesIEEE Transactions on Communications, 2018
- Leech Constellations of Construction-A LatticesIEEE Transactions on Communications, 2017
- Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice CodesIEEE Transactions on Communications, 2016
- Introductory Algebraic Number Theory2003
- Sphere-bound-achieving coset codes and multilevel coset codesIEEE Transactions on Information Theory, 2000
- Lattice codes can achieve capacity on the AWGN channelIEEE Transactions on Information Theory, 1998
- Good lattice constellations for both Rayleigh fading and Gaussian channelsIEEE Transactions on Information Theory, 1996
- Information theoretic considerations for cellular mobile radioIEEE Transactions on Vehicular Technology, 1994
- On coding without restrictions for the AWGN channelIEEE Transactions on Information Theory, 1994
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986