Rateless Coding for Arbitrary Channel Mixtures With Decoder Channel State Information

被引：12

作者：

Draper, Stark C. ^{[1
]}

Kschischang, Frank R. ^{[2
]}

Frey, Brendan ^{[2
]}

机构：

[1] Univ Wisconsin, Dept Elect & Comp Engn, Madison, WI 53706 USA

[2] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2009年 / 55卷 / 09期

关键词：

Arbitrarily varying channels; channel coding; erasure decoding; error exponents; individual sequence; rateless codes; variable-length coding; BOUNDS;

D O I：

10.1109/TIT.2009.2025577

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Rateless coding has recently been the focus of much practical as well as theoretical research. In this paper, rateless codes are shown to find a natural application in channels where the channel law varies unpredictably. Such unpredictability means that to ensure reliable communication block codes are limited by worst case channel variations. However, the dynamic decoding nature of rateless codes allows them to adapt opportunistically to channel variations. If the channel state selector is not malicious, but also not predictable, decoding can occur earlier, producing a rate of communication that can be much higher than the worst case. The application of rateless or "fountain" codes to the binary erasure channel (BEC) can be understood as an application of these ideas. Further, this sort of decoding can be usefully understood as an incremental form of erasure decoding. The use of ideas of erasure decoding result in a significant increase in reliability.

引用

页码：4119 / 4133

页数：15

共 30 条

[1] ARBITRARILY VARYING CHANNELS WITH STATES SEQUENCE KNOWN TO THE SENDER [J].

AHLSWEDE, R .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (05) :621-629

[2]

[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems

[3]

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

[4] The throughput of hybrid-ARQ protocols for the Gaussian collision channel [J].

Caire, G ;

Tuninetti, D .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) :1971-1988

[5]

Draper S. C., 2004, P 42 ALL C OCT, P1332

[6]

Draper SC, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P377

[7]

EREZ U, 2004, P 42 ANN ALL C COMM, P933

[8] Using zero-rate feedback on binary additive channels with individual noise sequences [J].

Eswaran, Krishnan ;

Sarwate, Anand D. ;

Sahai, Anant ;

Gastpar, Michael .

2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :1431-1435

[9]

Etesami O, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P38

[10] EXPONENTIAL ERROR BOUNDS FOR ERASURE LIST AND DECISION FEEDBACK SCHEMES [J].

FORNEY, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1968, 14 (02) :206-+

← 1 2 3 →