Abstract
The hybrid ARQ scheme with parity retransmission for error control, recently proposed by Lin and Yu [1], [2], is quite robust. This scheme provides both high system throughput and high system reliability. In this paper, a modified Lin-Yu hybrid ARQ scheme is presented. The modified scheme provides a slightly better throughput performance than the original Lin-Yu scheme; however, it is more flexible in utilizing the error-correction power of a code. The modified scheme can be incorporated with a rate 1/2 convolutional code using Viterbi decoding. Furthermore, the pure selectiverepeat ARQ is a degenerated case of the modified scheme in selective mode. Lin and Yu analyzed their scheme only for a receiver buffer of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</tex> is the number of data blocks that can be transmitted in a round-trip delay interval. No analysis for other buffer sizes was given. In this paper, the throughput performance of the modified Lin-Yu scheme is analyzed for any size of receiver buffer. Consequently, the throughput efficiency of the pure selective-repeat ARQ for any receiver buffer size can be obtained. We also show that the modified scheme achieves the same order of reliability as a pure ARQ scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have