About: Hybrid automatic repeat request is a research topic. Over the lifetime, 5834 publications have been published within this topic receiving 76725 citations.
TL;DR: In this article, the concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame.
Abstract: The concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame. Families of RCPC codes with rates between 8/9 and 1/4 are given for memories M from 3 to 6 (8 to 64 trellis states) together with the relevant distance spectra. These codes are almost as good as the best known general convolutional codes of the respective rates. It is shown that the same Viterbi decoder can be used for all RCPC codes of the same M. the application of RCPC codes to hybrid ARQ/FEC schemes is discussed for Gaussian and Rayleigh fading channels using channel-state information to optimise throughput. >
TL;DR: A very basic description of erasure codes is provided, an implementation of a simple but very flexible erasure code to be used in network protocols is described, and its performance and possible applications are discussed.
Abstract: Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to become uncorrelated thus greatly reducing the effectiveness of retransmissions. In such cases, Forward Error Correction (FEC) techniques can be used, consisting in the transmission of redundant packets (based on error correcting codes) to allow the receivers to recover from independent packet losses.Despite the widespread use of error correcting codes in many fields of information processing, and a general consensus on the usefulness of FEC techniques within some of the Internet protocols, very few actual implementations exist of the latter. This probably derives from the different types of applications, and from concerns related to the complexity of implementing such codes in software. To fill this gap, in this paper we provide a very basic description of erasure codes, describe an implementation of a simple but very flexible erasure code to be used in network protocols, and discuss its performance and possible applications. Our code is based on Vandermonde matrices computed over GF(pr), can be implemented very efficiently on common microprocessors, and is suited to a number of different applications, which are briefly discussed in the paper. An implementation of the erasure code shown in this paper is available from the author, and is able to encode/decode data at speeds up to several MB/s running on a Pentium 133.
TL;DR: In this article, a survey of various types of ARQ and hybrid ARQ schemes, and error detection using linear block codes is presented, where a properly chosen code is used for error detection, virtually error-free data transmission can be attained.
Abstract: ERROR DETECTION incorporated with automatic-repeatrequest (ARQ) is widely used for error control in data communications systems. This method of error control is simple and provides high system reliability. If a properly chosen code is used for error detection, virtually error-free data transmission can be attained. This paper surveys various types of ARQ and hybrid ARQ schemes, and error detection using linear block codes.
TL;DR: It is shown under multiple configurations that the system-level performance achieved by NOMA is superior to that for OMA, and key link adaptation functionalities of the LTE radio interface such as adaptive modulation and coding, time/frequency-domain scheduling, and outer loop link adaptation are shown.
Abstract: As a promising downlink multiple access scheme for further LTE enhancement and future radio access (FRA), this paper investigates the system-level performance of non-orthogonal multiple access (NOMA) with a successive interference canceller (SIC) on the receiver side. The goal is to clarify the potential gains of NOMA over orthogonal multiple access (OMA) such as OFDMA, taking into account key link adaptation functionalities of the LTE radio interface such as adaptive modulation and coding (AMC), hybrid automatic repeat request (HARQ), time/frequency-domain scheduling, and outer loop link adaptation (OLLA), in addition to NOMA specific functionalities such as dynamic multi-user power allocation. Based on computer simulations, we show under multiple configurations that the system-level performance achieved by NOMA is superior to that for OMA.
TL;DR: The throughput of automatic retransmission request (ARQ) protocols is compared to that of code division multiple access (CDMA) with conventional decoding and Interestingly, the ARQ systems are not interference-limited even if no multiuser detection or joint decoding is used, as opposed to conventional CDMA.
Abstract: In next-generation wireless communication systems, packet-oriented data transmission will be implemented in addition to standard mobile telephony. We take an information-theoretic view of some simple protocols for reliable packet communication based on "hybrid-ARQ," over a slotted multiple-access Gaussian channel with fading and study their throughput (total bit per second per hertz) and average delay under idealized but fairly general assumptions. As an application of the renewal-reward theorem, we obtain closed-form throughput formulas. Then, we consider asymptotic behaviors with respect to various system parameters. The throughput of automatic retransmission request (ARQ) protocols is compared to that of code division multiple access (CDMA) with conventional decoding. Interestingly, the ARQ systems are not interference-limited even if no multiuser detection or joint decoding is used, as opposed to conventional CDMA.