Optimizing Joint Erasure- and Error-Correction Coding for Wireless Packet Transmissions

被引:46
作者
Berger, Christian R. [1 ]
Zhou, Shengli [1 ]
Wen, Yonggang [2 ]
Willett, Peter [1 ]
Pattipati, Krishna [1 ]
机构
[1] Univ Connecticut, Dept Elect & Comp Engn, Storrs, CT 06269 USA
[2] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA
关键词
Reliable transmission; fountain codes; layered coding; adaptive modulation and coding; inter- and intra-packet coding;
D O I
10.1109/T-WC.2008.070581
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To achieve reliable packet transmission over a wireless link without feedback, we propose a layered coding approach that uses error-correction coding within each packet and erasure-correction coding across the packets. This layered approach is also applicable to an end-to-end data transport over a network where a wireless link is the performance bottleneck. We investigate how to optimally combine the strengths of error- and erasure-correction coding to optimize the system performance with a given resource constraint, or to maximize the resource utilization efficiency subject to a prescribed performance. Our results determine the optimum tradeoff in splitting redundancy between error-correction coding and erasure-correction codes, which depends on the fading statistics and the average signal to noise ratio (SNR) of the wireless channel. For severe fading channels, such as Rayleigh fading channels, the tradeoff leans towards more redundancy on erasure-correction coding across packets, and less so on error-correction coding within each packet. For channels with better fading conditions, more redundancy can be spent on error-correction coding. The analysis has been extended to a limiting case with a large number of packets, and a scenario where only discrete rates are available via a finite number of transmission modes.
引用
收藏
页码:4586 / 4595
页数:10
相关论文
共 13 条
[1]  
ALOUINI MS, 2004, WIRELESS PERS COMMUN, V13, P119
[2]  
[Anonymous], LAMBERT W FUNCTION
[3]  
[Anonymous], 2001, Probability, Random Variables, and Stochastic Processes
[4]   Coding performance of hybrid ARQ schemes [J].
Cheng, Jung-Fu .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (06) :1017-1029
[5]  
Cui JH, 2006, IEEE NETWORK, V20, P12
[6]   Raptor codes on binary memoryless symmetric channels [J].
Etesami, O ;
Shokrollahi, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051
[7]  
Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950
[8]   Efficient erasure correcting codes [J].
Luby, MG ;
Mitzenmacher, M ;
Shokrollahi, MA ;
Spielman, DA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :569-584
[9]  
MacKay D, 2003, Information Theory, Inference, and Learning Algorithms
[10]   Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes [J].
Sesia, S ;
Caire, G ;
Vivier, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (08) :1311-1321