Analysis of memory and incremental redundancy ARQ schemes over a nonstationary channel

A generalized type II automatic-repeat-request (ARQ) scheme using punctured convolutional coding on a two-state Markov model of a nonstationary channel is analyzed. A simple ARQ scheme with memory is also analyzed. It is shown that the simple memory ARQ scheme offers a substantial throughput improvement over a conventional ARQ scheme at severe channel conditions. Furthermore, the generalized type II ARQ scheme yields a better performance than the conventional type II ARQ scheme under all channel conditions, thus making it attractive for use over time-varying channels.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>