Multi-layer broadcasting hybrid-ARQ strategies for block fading channels

Conventional hybrid automatic retransmission request (HARQ) is usually used to maximize throughput. However, high throughput is achieved at the expense of high latency. We study a novel broadcasting HARQ strategy. The multi-layer broadcast approach is suitable for the case where transmitter has no channel state information (CSI), which is the case with HARQ schemes as well. The broadcast approach enables the receiver to decode rates, which are matched to every fading gain realization. That is, the higher the fading gain realization, the more layers are reliably decoded. The broadcast approach combined with HARQ enables achieving high throughput with low latency. In a broadcast HARQ scheme every code layer supports HARQ independently. Thus HARQ is applied in every transmission block to undecoded layers only, which highly increases the broadcast approach efficiency. In this paper, both broadcast chase combining (BCC) HARQ and broadcast incremental redundancy (BIR) HARQ are studied in the limit of infinitely many layers, and for finite level coding. Interestingly, with continuous broadcasting the BCC-HARQ is found to closely approximate the BIR-HARQ, while using a sub-optimal broadcasting power distribution.

[1]  Yiqing Zhou,et al.  Optimum subpacket transmission for hybrid ARQ systems , 2006, IEEE Transactions on Communications.

[2]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[4]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[5]  Emina Soljanin,et al.  LDPC code ensembles for incremental redundancy hybrid ARQ , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[6]  Michele Zorzi,et al.  On the use of renewal theory in the analysis of ARQ protocols , 1996, IEEE Trans. Commun..

[7]  David Chase,et al.  Code Combining - A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets , 1985, IEEE Transactions on Communications.

[8]  Y. Bar-Ness,et al.  Performance Analysis of Collaborative Hybrid-ARQ Protocols over Fading Channels , 2006, 2006 IEEE Sarnoff Symposium.

[9]  Jaehong Kim,et al.  Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  Emina Soljanin,et al.  Punctured vs Rateless Codes for Hybrid ARQ , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[11]  Giuseppe Caire,et al.  The MIMO ARQ Channel: Diversity-Multiplexing-Delay Tradeoff , 2006, IEEE Trans. Inf. Theory.

[12]  P. Spasojevic,et al.  Cooperative diversity with incremental redundancy turbo coding for quasi-static wireless networks , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[13]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[14]  S.W. McLaughlin,et al.  Incremental Redundancy Low-Density Parity Check Codes for MIMO V-BLAST Systems , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[15]  Raymond Knopp,et al.  Achievable diversity-multiplexing-delay tradeoff in half-duplex ARQ relay channels , 2005, ISIT.

[16]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[17]  Zhi Ding,et al.  A BICM Approach to Type-II Hybrid ARQ , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[18]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[19]  J. Hagenauer,et al.  Combined Incremental and Decremental Redundancy in Joint Source-Channel Coding , 2004 .