Abstract
In an automatic repeat request (ARQ) scheme, a packet is retransmitted if it gets corrupted due to transmission errors caused by the channel. Here we describe a ready-to-implement ARQ scheme with packet combining. An analytical description of the scheme in random error channel shows excellent agreement with simulation results. An upper bound for type-II schemes is defined. For smaller packet sizes, throughput of the proposed scheme is sufficiently close to the upper bound till a very high bit error rate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
