Convergence rates comparison of sum-product decoding of RA codes under different message-passing schedules

被引：0

作者：

Tong, S ^{[1
]}

Bai, BM ^{[1
]}

Wang, XM ^{[1
]}

机构：

[1] Xidian Univ, State Key Lab ISN, Xian 710071, Peoples R China

来源：

IEEE COMMUNICATIONS LETTERS | 2005年 / 9卷 / 06期

关键词：

repeat accumulate (RA) codes; sum-product algorithm (SPA); extrinsic information transfer (EXIT) chart; message-passing schedule;

D O I：

10.1109/LCOMM.2005.06010

中图分类号：

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

学科分类号：

0809 ;

摘要：

In iterative decoding of turbo-like codes, serial schedule generally provides a much faster convergence rate compared with parallel schedule. With the aid of extrinsic information transfer (EXIT) charts, sum-product decoding of repeat accumulate (RA) codes under both message passing schedules is investigated as an example for verifying the above statement.

引用

页码：543 / 545

页数：3

共 9 条

[1]

[Anonymous], P 36 ALL C COMM CONT

[2] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].

BAHL, LR ;

COCKE, J ;

JELINEK, F ;

RAVIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287

[3] Parallel versus sequential updating for belief propagation decoding [J].

Kfir, H ;

Kanter, T .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 330 (1-2) :259-270

[4]

Li J, 2001, GLOB TELECOMM CONF, P1063, DOI 10.1109/GLOCOM.2001.965634

[5] Convergence behavior of iteratively decoded parallel concatenated codes [J].

ten Brink, S .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (10) :1727-1737

[6] Design of low-density parity-check codes for modulation and detection [J].

ten Brink, S ;

Kramer, G ;

Ashikhmin, A .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (04) :670-678

[7] Design of repeat-accumulate codes for iterative detection and decoding [J].

ten Brink, S ;

Kramer, G .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (11) :2764-2772

[8] A simple convergence comparison of Gallager codes under two message-passing schedules [J].

Tong, S ;

Wang, XM .

IEEE COMMUNICATIONS LETTERS, 2005, 9 (03) :249-251

[9]

ZHANG J, IN PRESS IEEE T COMM

← 1 →