Efficient decoding of low density lattice codes

Shuiyin Liu, Yi Hong, Emanuele Viterbo, Alessia Marelli, Rino Micheloni

Research output: Contribution to journalArticleResearchpeer-review

Abstract

This letter describes a low complexity belief propagation decoder for low density lattice codes (LDLC). Compared with the fastest decoder in the literature, the memory usage and computational complexity at each variable node is reduced from O(2d) to O(d), where d is the degree of LDLC. The cost at each check node remains at O(d). The key idea is to compute each variable message based on 2d-2 Gaussian functions, rather than 2d-1 Gaussian functions in the previous decoders. A novel convergence analysis is given for Gaussian approximation (GA) based LDLC decoders. Simulation results confirm that the proposed decoder can lower the error floor of the fastest GA-based decoder.
Original languageEnglish
Number of pages4
JournalIEEE Wireless Communications Letters
DOIs
Publication statusAccepted/In press - 2019

Cite this

@article{598028a70ab1406c9d386b5ae63d43d5,
title = "Efficient decoding of low density lattice codes",
abstract = "This letter describes a low complexity belief propagation decoder for low density lattice codes (LDLC). Compared with the fastest decoder in the literature, the memory usage and computational complexity at each variable node is reduced from O(2d) to O(d), where d is the degree of LDLC. The cost at each check node remains at O(d). The key idea is to compute each variable message based on 2d-2 Gaussian functions, rather than 2d-1 Gaussian functions in the previous decoders. A novel convergence analysis is given for Gaussian approximation (GA) based LDLC decoders. Simulation results confirm that the proposed decoder can lower the error floor of the fastest GA-based decoder.",
author = "Shuiyin Liu and Yi Hong and Emanuele Viterbo and Alessia Marelli and Rino Micheloni",
year = "2019",
doi = "10.1109/LWC.2019.2911503",
language = "English",
journal = "IEEE Wireless Communications Letters",
issn = "2162-2337",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",

}

Efficient decoding of low density lattice codes. / Liu, Shuiyin; Hong, Yi; Viterbo, Emanuele; Marelli, Alessia; Micheloni, Rino.

In: IEEE Wireless Communications Letters, 2019.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Efficient decoding of low density lattice codes

AU - Liu, Shuiyin

AU - Hong, Yi

AU - Viterbo, Emanuele

AU - Marelli, Alessia

AU - Micheloni, Rino

PY - 2019

Y1 - 2019

N2 - This letter describes a low complexity belief propagation decoder for low density lattice codes (LDLC). Compared with the fastest decoder in the literature, the memory usage and computational complexity at each variable node is reduced from O(2d) to O(d), where d is the degree of LDLC. The cost at each check node remains at O(d). The key idea is to compute each variable message based on 2d-2 Gaussian functions, rather than 2d-1 Gaussian functions in the previous decoders. A novel convergence analysis is given for Gaussian approximation (GA) based LDLC decoders. Simulation results confirm that the proposed decoder can lower the error floor of the fastest GA-based decoder.

AB - This letter describes a low complexity belief propagation decoder for low density lattice codes (LDLC). Compared with the fastest decoder in the literature, the memory usage and computational complexity at each variable node is reduced from O(2d) to O(d), where d is the degree of LDLC. The cost at each check node remains at O(d). The key idea is to compute each variable message based on 2d-2 Gaussian functions, rather than 2d-1 Gaussian functions in the previous decoders. A novel convergence analysis is given for Gaussian approximation (GA) based LDLC decoders. Simulation results confirm that the proposed decoder can lower the error floor of the fastest GA-based decoder.

U2 - 10.1109/LWC.2019.2911503

DO - 10.1109/LWC.2019.2911503

M3 - Article

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

SN - 2162-2337

ER -