Hybrid message-passing algorithm and architecture for decoding cyclic non-binary LDPC codes

Yichao Lu, Gang He, Guifen Tian, Satoshi Goto

Research output: Contribution to journalArticle

Abstract

Recently, non-binary low-density parity-check (NB-LDPC) codes starts to show their superiority in achieving significant coding gains when moderate codeword lengths are adopted. However, the overwhelming decoding complexity keeps NB-LDPC codes from being widely employed in modem communication devices. This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. It achieves competitive error performance compared with conventional Min-max algorithm. Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5 dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. A partial-parallel NB-LDPC decoder architecture for cyclic NB-LDPC codes is also developed based on this algorithm. Optimization schemes are employed to cut off hard decision symbols in RAMs and also to store only part of the reliability messages. In addition, the variable node units are redesigned especially for the proposed algorithm. Synthesis results demonstrate that about 24.3% gates and 12% memories can be saved over previous works.

Original languageEnglish
Pages (from-to)2652-2659
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE96-A
Issue number12
DOIs
Publication statusPublished - 2013

Fingerprint

Message-passing Algorithms
LDPC Codes
Message passing
Hybrid Algorithm
Decoding
Low-density Parity-check (LDPC) Codes
Coding Gain
Low Complexity
Parity
Cyclic Codes
Modems
Random access storage
Message Passing
Min-max
Architecture
Computational complexity
Computational Complexity
Synthesis
Partial
Data storage equipment

Keywords

  • Belief propagation algorithm
  • Iterative majority-logic decoding
  • Low-density parity-check codes
  • Non-binary
  • VLSI

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Hybrid message-passing algorithm and architecture for decoding cyclic non-binary LDPC codes. / Lu, Yichao; He, Gang; Tian, Guifen; Goto, Satoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E96-A, No. 12, 2013, p. 2652-2659.

Research output: Contribution to journalArticle

@article{a7979658f2ca43dd96dda597140a812d,
title = "Hybrid message-passing algorithm and architecture for decoding cyclic non-binary LDPC codes",
abstract = "Recently, non-binary low-density parity-check (NB-LDPC) codes starts to show their superiority in achieving significant coding gains when moderate codeword lengths are adopted. However, the overwhelming decoding complexity keeps NB-LDPC codes from being widely employed in modem communication devices. This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. It achieves competitive error performance compared with conventional Min-max algorithm. Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5 dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. A partial-parallel NB-LDPC decoder architecture for cyclic NB-LDPC codes is also developed based on this algorithm. Optimization schemes are employed to cut off hard decision symbols in RAMs and also to store only part of the reliability messages. In addition, the variable node units are redesigned especially for the proposed algorithm. Synthesis results demonstrate that about 24.3{\%} gates and 12{\%} memories can be saved over previous works.",
keywords = "Belief propagation algorithm, Iterative majority-logic decoding, Low-density parity-check codes, Non-binary, VLSI",
author = "Yichao Lu and Gang He and Guifen Tian and Satoshi Goto",
year = "2013",
doi = "10.1587/transfun.E96.A.2652",
language = "English",
volume = "E96-A",
pages = "2652--2659",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Hybrid message-passing algorithm and architecture for decoding cyclic non-binary LDPC codes

AU - Lu, Yichao

AU - He, Gang

AU - Tian, Guifen

AU - Goto, Satoshi

PY - 2013

Y1 - 2013

N2 - Recently, non-binary low-density parity-check (NB-LDPC) codes starts to show their superiority in achieving significant coding gains when moderate codeword lengths are adopted. However, the overwhelming decoding complexity keeps NB-LDPC codes from being widely employed in modem communication devices. This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. It achieves competitive error performance compared with conventional Min-max algorithm. Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5 dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. A partial-parallel NB-LDPC decoder architecture for cyclic NB-LDPC codes is also developed based on this algorithm. Optimization schemes are employed to cut off hard decision symbols in RAMs and also to store only part of the reliability messages. In addition, the variable node units are redesigned especially for the proposed algorithm. Synthesis results demonstrate that about 24.3% gates and 12% memories can be saved over previous works.

AB - Recently, non-binary low-density parity-check (NB-LDPC) codes starts to show their superiority in achieving significant coding gains when moderate codeword lengths are adopted. However, the overwhelming decoding complexity keeps NB-LDPC codes from being widely employed in modem communication devices. This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. It achieves competitive error performance compared with conventional Min-max algorithm. Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5 dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. A partial-parallel NB-LDPC decoder architecture for cyclic NB-LDPC codes is also developed based on this algorithm. Optimization schemes are employed to cut off hard decision symbols in RAMs and also to store only part of the reliability messages. In addition, the variable node units are redesigned especially for the proposed algorithm. Synthesis results demonstrate that about 24.3% gates and 12% memories can be saved over previous works.

KW - Belief propagation algorithm

KW - Iterative majority-logic decoding

KW - Low-density parity-check codes

KW - Non-binary

KW - VLSI

UR - http://www.scopus.com/inward/record.url?scp=84889016330&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84889016330&partnerID=8YFLogxK

U2 - 10.1587/transfun.E96.A.2652

DO - 10.1587/transfun.E96.A.2652

M3 - Article

AN - SCOPUS:84889016330

VL - E96-A

SP - 2652

EP - 2659

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -