A Throughput Analysis of Incremental Redundancy Hybrid ARQ Schemes with Turbo Codes

摘要

In applications of wireless packet-oriented datarnnetworks, a special coding scheme, referred to as incrementalrnredundancy hybrid ARQ (IR HARQ), exhibits high throughputrnefficiency by adapting its error correcting code redundancy torndifferent channel conditions. The throughput of HARQ schemesrnis strongly determined by the power of the mother code and therncorresponding family of codes obtained by its puncturing. Thus,rnmore recently proposed HARQ schemes frequently use powerfulrnmother turbo codes. In this paper, we study the throughputrnachievable by an IR HARQ scheme based on turbo codes overrnAWGN and block-fading channels. The throughput performancernanalysis is based on the study of reliable channel regions of turborncode ensembles over parallel channels and the application of thernrenewal-reward theorem.