The throughput of hybrid-ARQ protocols for the Gaussian collision channel
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Cdma: Principles of Spread Spectrum Communication
Viterbi, A. J. (1995) · Medical Entomology and Zoology · Cited by 3,245
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
Hagenauer, J. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2763 · Cited by 1,827
Lee, E. A., & Messerschmitt, D. G. (1994) · Springer eBooks · doi:10.1007/978-1-4615-3136-4 · Cited by 1,683
Stochastic Modeling and the Theory of Queues
Wolff, R. W. (1989) · Cited by 1,593
Communication Systems and Techniques
Schwartz, M., Bennett, W. R., & Stein, S. (2010) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470565292 · Cited by 1,442
Chaghaghi, F. S., & Billingsley, P. (1986) · The Statistician · doi:10.2307/2987970 · Cited by 1,217
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
Information theoretic considerations for cellular mobile radio
Ozarow, L. H., Shamai, S. S., & Wyner, A. D. (1994) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.293655 · Cited by 1,090
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Spectral efficiency of CDMA with random spreading
Verdu, S., & Shamai, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749007 · Cited by 885
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Bradley, R. C., & Billingsley, P. (1987) · Journal of the American Statistical Association · doi:10.2307/2288811 · Cited by 774
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels. II
Shamai, S., & Wyner, A. D. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641554 · Cited by 288
Cited by
Optical Communication in Space: Challenges and Mitigation Techniques
Kaushal, H., & Kaddoum, G. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2603518 · Cited by 1,927
“ious researchers is hybrid-ARQ (H-ARQ) which uses a combination of FEC coding and ARQ error control [356]–[358].”
MethodFoundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Metadata
- Authors
- Caire, G., & Tuninetti, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001-07
- Volume
- 47
- Issue
- 5
- Pages
- 1971-1988
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2100739124
- Cited by
- 685
- References
- 21
- FWCI
- 13.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.