Hybrid ARQ Scheme Based on Recursive Convolutional Codes and Turbo Decoding

被引:15
作者
Souza, Richard Demo [1 ]
Pellenz, Marcelo Eduardo [2 ]
Rodrigues, Tamara [1 ]
机构
[1] UTFPR, CPGEI, Curitiba, Parana, Brazil
[2] PUC PR, PPGIA, Curitiba, Parana, Brazil
关键词
ARQ; recursive convolutional codes; turbo codes; iterative decoding;
D O I
10.1109/TCOMM.2009.02.070026
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose a hybrid ARQ scheme using recursive convolutional codes, the turbo principle and combining diversity While spending the same energy for transmission, the proposed scheme presents a better throughput for most of the SNR range and it smaller decoding complexity than another well-known method.
引用
收藏
页码:315 / 318
页数:4
相关论文
共 11 条
[1]  
[Anonymous], 1995, Error control systems for digital communication and storage
[2]  
[Anonymous], IEEE COMMUN MAG
[3]   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
[4]   Near optimum error correcting coding and decoding: Turbo-codes [J].
Berrou, C ;
Glavieux, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (10) :1261-1271
[5]   Application layer error-correction coding for rate-distortion optimized streaming to wireless clients [J].
Chakareski, J ;
Chou, PA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (10) :1675-1687
[6]   Soft combining for hybrid ARQ [J].
Holland, ID ;
Zepernick, HJ ;
Caldera, M .
ELECTRONICS LETTERS, 2005, 41 (22) :1230-1231
[7]  
LIU R, 2004, P C INF SCI SYST CIS
[8]   The trellis complexity of convolutional codes [J].
McEliece, RJ ;
Lin, W .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1855-1864
[9]   A Novel ARQ Technique using the Turbo Coding Principle [J].
Narayanan, Krishna R. ;
Stueber, Gordon L. .
IEEE COMMUNICATIONS LETTERS, 1997, 1 (02) :49-51
[10]   On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes [J].
Rowitch, DN ;
Milstein, LB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2000, 48 (06) :948-959