DIMACS Series in Discrete Mathematics and Theoretical Computer Science Hybrid ARQ with Random Transmission Assignments

In mobile packet data and voice networks, a special coding scheme, known as the incremental redundancy hybrid ARQ (IR HARQ), achieves higher throughput efficiency than ordinary turbo codes by adapting its error correcting code redundancy to fluctuating channel conditions characteristic for this application. An IR HARQ protocol operates as follows. Initially, the information bits are encoded by a “mother” code and a selected number of parity bits are transmitted. If a retransmission is requested, only additional selected parity bits are transmitted. At the receiving end, the additional parity bits are combined with the previously received bits, allowing for an increase in the error correction capacity. This procedure is repeated after each subsequent retransmission request until the entire codeword of the mother code is transmitted. A number of important issues such as error rate performance after each transmission on time varying channels, and rate and power control are difficult to analyze in a network employing a particular HARQ scheme, i.e., a given mother code and given selection of bits for each transmission. By relaxing only the latter constraint, namely, by allowing random selection of the bits for each transmission, we provide very good estimates of error rates allowing us to address to a certain extent the rate and power control problem.

[1]  William E. Ryan,et al.  Punctured turbo-codes for BPSK/QPSK channels , 1999, IEEE Trans. Commun..

[2]  Giuseppe Caire,et al.  The performance of incremental redundancy schemes based on convolutional codes in the block-fading Gaussian collision channel , 2004, IEEE Transactions on Wireless Communications.

[3]  S. Brink Convergence of iterative decoding , 1999 .

[4]  Giuseppe Caire,et al.  ARQ protocols for the Gaussian collision channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[5]  Emina Soljanin,et al.  Punctured turbo code ensembles , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[6]  D. N. Rowitch Rate compatible punctured turbo (RCPT) codes in hybrid FEC/ARQ system , 1997 .

[7]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[8]  Marco Breiling,et al.  A logarithmic upper bound on the minimum distance of turbo codes , 2004, IEEE Transactions on Information Theory.

[9]  Laurence B. Milstein,et al.  On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes , 2000, IEEE Trans. Commun..

[10]  Gordon L. Stüber,et al.  A novel ARQ technique using the turbo coding principle , 1997, IEEE Communications Letters.

[11]  R. Urbanke,et al.  On the minimum distance of parallel and serially concatenated codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[12]  Robert J. McEliece,et al.  Coding theorems for turbo code ensembles , 2002, IEEE Trans. Inf. Theory.

[13]  S. S. Pietrobon,et al.  Rate compatible turbo codes , 1995 .

[14]  Emina Soljanin,et al.  On the role of puncturing in hybrid ARQ schemes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  John M. Wozencraft,et al.  Coding for two-way channels , 1961 .

[16]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[17]  Frank R. Kschischang,et al.  A capacity-approaching hybrid ARQ scheme using turbo codes , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[18]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[19]  Gilles Zémor,et al.  Interleavers for turbo codes that yield a minimum distance growing with blocklength , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[20]  Giuseppe Caire,et al.  The optimal throughput of some wireless multiaccess systems , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[21]  Giuseppe Caire,et al.  Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes , 2004, IEEE Transactions on Communications.

[22]  Michael Lentmaier,et al.  Some Results Concerning the Design and Decoding of Turbo-Codes , 2001, Probl. Inf. Transm..

[23]  Stephen B. Wicker,et al.  Applications of Error-Control Coding , 1998, IEEE Trans. Inf. Theory.