Quasi-Systematic Doped LT Codes

被引：4

作者：

Yuan, Xiaojun ^{[1
]}

Ping, Li ^{[1
]}

机构：

[1] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 2009年 / 27卷 / 06期

关键词：

LT codes; Raptor codes; quasi-systematic doped Luby-Transform (QS-DLT) codes;

D O I：

10.1109/JSAC.2009.090805

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

We propose a family of binary erasure codes, namely, quasi-systematic doped Luby-Transform (QS-DLT) codes, that are rateless, almost systematic, and universally capacity-achieving without the prior knowledge of channel erasure rate. The encoding and decoding complexities of QS-DLT codes are O(K log(1/epsilon)), where K is the information length, and epsilon is the overhead. Stopping-set analysis is carried out to study the error-floor behavior of QS-DLT codes. Analysis and numerical results demonstrate that QS-DLT codes provide a low-complexity alternative to systematic Raptor codes with comparable performance.

引用

页码：866 / 875

页数：10

共 20 条

[1]

Byers J.W., 1998, P ACM SIGCOMM 98 C A, P56

[2]

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

[3]

DIVSALAR D, 1998, P 36 ALL C COMM CONT, P201

[4] Raptor codes on binary memoryless symmetric channels [J].

Etesami, O ;

Shokrollahi, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051

[5]

HSU CH, 2005, P 43 ALL C COMM CONT

[6]

Jin H., 2000, INT S TURB COD REL T, P1

[7]

Karp R, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P39

[8]

Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950

[9] Efficient erasure correcting codes [J].

Luby, MG ;

Mitzenmacher, M ;

Shokrollahi, MA ;

Spielman, DA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :569-584

[10] Capacity-achieving sequences for the erasure channel [J].

Oswald, P ;

Shokrollahi, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (12) :3017-3028

← 1 2 →