[Paper Review] Construction of Full-Diversity LDPC Lattices for Block-Fading Channels

Hassan Khodaiemehr, Mohammad‐Reza Sadeghi+1 more|arXiv (Cornell University)|Dec 13, 2016

Cooperative Communication and Network Coding1 references3 citations

TL;DR

This paper proposes full-diversity 1-level LDPC lattices for block-fading channels using Construction A over totally real number fields, enabling high-dimensional lattice decoding with linear complexity. The method employs an iterative decoding algorithm based on a novel Tanner graph and parity check matrix formulation, achieving diversity order $ n-1 $ over an $ n $-block-fading channel.

ABSTRACT

LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known Construction A LDPC lattices or 1-level LDPC lattices. Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. Frequency-hopping schemes and orthogonal frequency division multiplexing (OFDM) can conveniently be modelled as block-fading channels. Applying lattices in this type of channel entails dividing a lattice point into multiple blocks such that fading is constant within a block but changes, independently, across blocks. The design of lattices for BF channels offers a challenging problem, which differs greatly from its counterparts like AWGN channels. Recently, the original binary Construction A for lattices, due to Forney, have been generalized to a lattice construction from totally real and complex multiplication fields. This generalized Construction A of lattices provides signal space diversity intrinsically, which is the main requirement for the signal sets designed for fading channels. In this paper we construct full diversity LDPC lattices for block-fading channels using Construction A over totally real number fields. We propose a new iterative decoding method for these family of lattices which has complexity that grows linearly in the dimension of the lattice. In order to implement our decoding algorithm, we propose the definition of a parity check matrix and Tanner graph for full diversity Construction A lattices. We also prove that the constructed LDPC lattices together with the proposed decoding method admit diversity order n-1 over an n-block-fading channel.

Motivation & Objective

• To design full-diversity LDPC lattices suitable for block-fading wireless channels, where fading is constant within blocks but varies independently across blocks.
• To overcome the limitations of traditional LDPC lattices designed for AWGN channels, which do not inherently achieve full diversity in fading environments.
• To develop a low-complexity decoding algorithm that scales efficiently with lattice dimension, enabling practical implementation in high-dimensional systems.
• To establish a formal framework for parity check matrices and Tanner graphs tailored to full-diversity Construction A lattices over number fields.
• To prove that the constructed lattices achieve diversity order $ n-1 $ over an $ n $-block-fading channel under the proposed decoding scheme.

Proposed method

• Constructs 1-level LDPC lattices using Construction A over totally real number fields, leveraging algebraic number theory to ensure intrinsic signal space diversity.
• Introduces a novel definition of the parity check matrix and Tanner graph for full-diversity Construction A lattices, enabling iterative decoding over fading blocks.
• Designs an iterative decoding algorithm that selects edges with the highest fading gain (lowest path loss) at each iteration to improve reliability and combat deep fades.
• Uses optimal decoding in low-dimensional subspaces (dimension $ n $) within each iteration, with complexity dominated by $ O(N imes d imes t) $, where $ N $ is lattice dimension, $ d $ is average column degree, and $ t $ is number of iterations.
• Applies edge discarding during decoding to remove nodes affected by deep fades, preserving decoding performance in high-SNR regimes.
• Employs log-likelihood ratio estimation based on channel gains $ h_j $, phase offsets $ p_{i,j} $, and estimated values $ ilde{p}_{i,j} $, with reliability weighted by $ |f_j| $.

Experimental results

Research questions

• RQ1 Can full-diversity LDPC lattices be constructed for block-fading channels using algebraic number fields and Construction A?
• RQ2 How can an efficient, low-complexity decoding algorithm be designed for high-dimensional full-diversity LDPC lattices in block-fading environments?
• RQ3 What is the achievable diversity order of the proposed lattice-decoding scheme over an $ n $-block-fading channel?
• RQ4 Can a meaningful Tanner graph and parity check matrix formulation be defined for full-diversity Construction A lattices to support iterative decoding?
• RQ5 Does the proposed decoding algorithm converge reliably under deep fades, and how does it compare to theoretical outage limits?

Key findings

• The constructed 1-level LDPC lattices achieve diversity order $ n-1 $ over an $ n $-block-fading channel, confirming the theoretical upper bound for full diversity.
• The proposed iterative decoding algorithm has complexity that grows linearly in the lattice dimension $ N $, making it scalable for high-dimensional systems.
• Simulation results show that triple-diversity 1-level LDPC lattices achieve a diversity order of 2 under the proposed decoding, validating the theoretical analysis.
• The use of underlying LDPC codes with low maximum Hamming weight improves error performance convergence, accelerating the error floor to its asymptotic slope.
• The decoding algorithm successfully decodes codewords even in the presence of $ n-2 $ deep fades by discarding unreliable edges and focusing on high-gain paths.
• The Poltyrev outage limit closely matches the simulated FER performance, confirming that the lattice design is near-outage-limited in high-SNR regimes.