The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
Abstract
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for the general AWGN model and are tight only under certain conditions for the FD-AWGN model. Two coding schemes that do not require the relay to decode any part of the message are then investigated. First, it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme. It is also shown that the achievable rate of the side-information coding scheme can be improved via time sharing. In the second scheme, the relaying functions are restricted to be linear. The problem is reduced to a "single-letter" nonconvex optimization problem for the FD-AWGN model. The paper also establishes a relationship between the minimum energy-per-bit and capacity of the AWGN relay channel. This relationship together with the lower and upper bounds on capacity are used to establish corresponding lower and upper bounds on the minimum energy-per-bit that do not differ by more than a factor of 1.45 for the FD-AWGN relay channel model and 1.7 for the general AWGN model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
ASH, R. B. (1966) · Cited by 3,990
Minimum energy mobile wireless networks
Rodoplu, V., & Meng, T. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779917 · Cited by 1,685
Three-terminal communication channels
van der Meulen, E. C. (1971) · Advances in Applied Probability · doi:10.1017/s0001867800037605 · Cited by 1,544
Spectral efficiency in the wideband regime
Verdu, S. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003824 · Cited by 1,214
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
On channel capacity per unit cost
Verdu, S. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57201 · Cited by 522
On the capacity of wireless networks: the relay case
Gastpar, M., & Vetterli, M. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019409 · Cited by 467
Towards an information theory of large networks: an achievable rate region
Gupta, P., & Kumar, P. R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814480 · Cited by 435
Minimum energy communication over a relay channel
Gamal, A. E., & Zahedi, S. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228359 · Cited by 36
Self-citation
Cited by
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Metadata
- Authors
- El Gamal, A., Mohseni, M., & Zahedi, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-04
- Volume
- 52
- Issue
- 4
- Pages
- 1545-1561
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2143157029
- Cited by
- 294
- References
- 13
- FWCI
- 29.91
- 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.