Diversity of low-density lattices

We describe full-diversity constructions of real lattices defined by their integer-check matrix, i.e. the inverse of their generator matrix. In the first construction suited to maximum-likelihood decoding, these lattices are defined by sparse (low-density) or non-sparse integer-check matrices. Based on a special structure of the lattice binary image, a second full-diversity lattice construction is described for sparse integer-check matrices in the context of iterative probabilistic decoding. Full diversity is theoretically proved in both cases. Computer simulation results also confirm that the proposed low-density lattices attain the maximal diversity order.

• Publication year

  2015

• Venue

  International Conference on Telecommunications

• Publication date

  2015-04-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ICT.2015.7124696arXiv 1605.04128
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sphere Packing and Error-Correcting Codes

  2016cited by this paper
• A Poltyrev outage limit for lattices

  2015cited by this paper
• Fundamental Limits of Infinite Constellations in MIMO Fading Channels

  2014cited by this paper
• Generalized low-density (GLD) lattices

  2014cited by this paper
• DIGITAL COMMUNICATIONS

  2013influential reference
• New results on Construction A lattices based on very sparse parity-check matrices

  2013cited by this paper
• Integer low-density lattices based on construction A

  2012cited by this paper
• The fundamental limits of infinite constellations in MIMO fading channels

  2011cited by this paper
• Diversity and coding gain evolution in graph codes

  2009cited by this paper
• Modern Coding Theory

  2008cited by this paper
• Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

  2007cited by this paper
• Low Density Lattice Codes

  2006influential reference
• Fundamentals of Wireless Communication

  2005cited by this paper
• Elements of Information Theory

  2005cited by this paper
• Asymptotic Expansion of Integrals

  1999influential reference
• A universal lattice code decoder for fading channels

  1999cited by this paper
• Sphere Packing and Error-Correcting Codes

  1999cited by this paper
• Sphere packings, I

  1998cited by this paper
• Good lattice constellations for both Rayleigh fading and Gaussian channels

  1996cited by this paper
• On coding without restrictions for the AWGN channel

  1993cited by this paper
• Sphere Packings, Lattices and Groups

  1990cited by this paper
• Probability, random variables and stochastic processes

  1985cited by this paper
• A fast encoding method for lattice codes and quantizers

  1983cited by this paper
• Random variables and stochastic processes

  1979cited by this paper
• IEEE TRANSACTIONS ON INFORMATION THEORY, to appear 1 Finite Dimensional Infinite Constellations

  year unknowncited by this paper

• Algebraic lattices coming from Z\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Z}}$$\end{document}-modules

  2024cites this paper
• Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels

  2020influential citation