Efficient message-passing decoding of LDPC codes using vector-based messages

被引：1

作者：

Tjader, Mats ^{[1
,2
]}

Grimnell, Mikael ^{[1
,2
]}

Danev, Danyo ^{[1
]}

Tullberg, Hugo M. ^{[2
]}

机构：

[1] Linkoping Univ, Dept Elect Engn ISY, Div Data Transmiss, SE-58183 Linkoping, Sweden

[2] Dept Commun Syst, Swedish Def Res Agcy, SE-58111 Linkoping, Sweden

来源：

2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS | 2006年

关键词：

D O I：

10.1109/ISIT.2006.261647

中图分类号：

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

学科分类号：

0809 ;

摘要：

In this paper we investigate reduced complexity decoders for LDPC codes over M-PSK modulation. Capacity calculations show only minor losses if only phase information is considered in the decoder. We device a decoder based on phase angle summation, which unfortunately does not work for codes over Galois fields (but shows promising results for codes over integer rings). For codes over Galois Fields we construct table-based decoders which gives performance close to Belief Propagation decoders at substantially reduced complexity.

引用

页码：1713 / +

页数：2

共 11 条

[1] Low-Density Parity Check Codes over GF (q) [J].

Davey, Matthew C. ;

MacKay, David .

IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) :165-167

[2] GEOMETRICALLY UNIFORM CODES [J].

FORNEY, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) :1241-1260

[3]

Gallager RG, 1963, LOW DENSITY PARITY C

[4]

GEIST JM, 1990, P IEEE MIL COMM C MO, V2, P768

[5]

GRIMNELL M, 2005, THESIS LINKOPING U L

[6] Factor graphs and the sum-product algorithm [J].

Kschischang, FR ;

Frey, BJ ;

Loeliger, HA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519

[7] SIGNAL SETS MATCHED TO GROUPS [J].

LOELIGER, HA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (06) :1675-1682

[8]

MacKay D., D MACKAYS GALLAGER C

[9]

Pearl J., 1989, Probabilistic reasoning in intelligent systems: networks of plausible inference, DOI DOI 10.1016/C2009-0-27609-4

[10] LDPC codes over rings for PSK modulation [J].

Sridhara, D ;

Fuja, TE .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3209-3220

← 1 2 →