Throughput performance of memory ARQ schemes

We present a throughput analysis for the memory automatic repeat request (A RQ) schemes with self-decodable frame retransmissions, taking into account frame header and frame acknowledgment failure probability. A lower bound on the throughput is obtained for a very general class of schemes which encom passes many of those proposed in the literature. Numerical results are give n for several example systems, and suitable header and acknowledgment forwa rd error correction (FEC) encodings are determined.