Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel

被引：7

作者：

Sassatelli, Lucile ^{[1
]}

Chilappagari, Shashi Kiran ^{[2
]}

Vasic, Bane ^{[2
]}

Declercq, David ^{[3
]}

机构：

[1] MIT, LIDS RLE, 77 Massachusetts Ave, Cambridge, MA 02139 USA

[2] Univ Arizona, Dept Elect & Comp Engn, Tucson, AZ 85721 USA

[3] UCP, CNRS, ETIS ENSEA, UMR 8051, F-95014 Cergy Pontoise, France

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年

关键词：

PARITY-CHECK CODES;

D O I：

10.1109/ISIT.2009.5205790

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A class of two-bit message passing decoders for decoding column-weight-four LDPC codes over the binary symmetric channel is proposed. The thresholds for various decoders in this class are derived using density evolution. For a specific decoder, the sufficient conditions for correcting all error patterns with up to three errors are derived.

引用

页码：2156 / +

页数：2

共 13 条

[1]

[Anonymous], 1963, Low-Density Parity-Check Codes

[2]

Bazzi L, 2004, IEEE T INFORM THEORY, V50, P2010, DOI 10.1109/TIT.2004.833352

[3] Expander graph arguments for message-passing algorithms [J].

Burshtein, D ;

Miller, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :782-790

[4]

CHILAPPAGARI SK, IEEE T INFO IN PRESS

[5]

CHILAPPAGARI SK, 2008, IEEE T INFORM UNPUB

[6]

CHILAPPAGARI SK, 2008, IEEE T INF UNPUB JUL

[7]

CHILAPPAGARI SK, 2008, P IEEE INF THEOR WOR

[8]

Di CY, 2002, IEEE T INFORM THEORY, V48, P1570, DOI 10.1109/TIT.2002.1003839

[9] Regular and irregular progressive edge-growth tanner graphs [J].

Hu, XY ;

Eleftheriou, E ;

Arnold, DM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :386-398

[10] Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers [J].

Ivkovic, Milos ;

Chilappagari, Shashi Kiran ;

Vasic, Bane .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3763-3768

← 1 2 →