The performance analysis of a concatenated ARQ scheme using parity retransmissions

The authors analyze an ARQ (automatic repeat request) scheme using parity retransmissions. By dividing each transmission block into subblocks, the combination of a transmission block and its retransmission block has the structure of a concatenated code. They derive formulae for calculating an upper bound on the probability of undetected errors and a lower bound on the throughput for such an ARQ scheme. Numerical results show that even with extremely simple code design, such an ARQ scheme has satisfactory performance.<
>