Multilevel Lattices based on Spatially-Coupled LDPC Codes with Applications

Avinash Vem*, Yu-Chih Huang, Krishna R. Narayanan, Henry D. Pfister

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We propose a class of lattices constructed using Construction D where the underlying linear codes are nested binary spatially-coupled low-density parity-check codes (SC-LDPC) codes with uniform left and right degrees. By leveraging recent results on the optimality of spatially-coupled codes for binary input memoryless channels and Forney et al.'s earlier results on the optimality of construction D, we show that the proposed lattices achieve the Poltyrev limit under multistage belief propagation decoding. Lattice codes constructed from these lattices are shown to provide excellent performance for the three user symmetric interference channel. They can also be naturally used in applications such as integer-forcing and compute-and-forward.

Original languageEnglish
Title of host publication2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
PublisherIEEE
Pages2336-2340
Number of pages5
StatePublished - 2014
EventIEEE International Symposium on Information Theory (ISIT) - Honolulu
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT)
CityHonolulu
Period29/06/144/07/14

Cite this