LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. When we consider Construction D' of lattices with one binary LDPC code as its underlying code, 1-level LDPC lattices are obtained. Block fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. In this type of channel, a lattice point is divided 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. In this paper we construct full diversity 1-level LDPC lattices for block fading channels. We propose a new iterative decoding method for these family of lattices which has complexity that grows linearly in the dimension of lattice.

Additional Metadata
Keywords algebraic number fields, full diversity, LDPC lattice
Persistent URL dx.doi.org/10.1109/ISIT.2016.7541792
Conference 2016 IEEE International Symposium on Information Theory, ISIT 2016
Khodaiemehr, H. (Hassan), Sadeghi, M.-R. (Mohammad-Reza), & Panario, D. (2016). Construction of full-diversity 1-level LDPC lattices for block-fading channels. In IEEE International Symposium on Information Theory - Proceedings (pp. 2714–2718). doi:10.1109/ISIT.2016.7541792