The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The capacity of discrete-time memoryless Rayleigh-fading channels
Abstract
We consider transmission over a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information. Subject to an average power constraint, we study the capacity-achieving distribution of this channel and prove it to be discrete with a finite number of mass points, one of them located at the origin. We numerically compute the capacity and the corresponding optimal distribution as a function of the signal-to-noise ratio (SNR). The behavior of the channel at low SNR is studied and finally a comparison is drawn with the ideal additive white Gaussian noise channel.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Cited by
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
On the limits of communication with low-precision analog-to-digital conversion at the receiver
Singh, J., Dabeer, O., & Madhow, U. (2009) · IEEE Transactions on Communications · doi:10.1109/tcomm.2009.12.080559 · Cited by 355
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Metadata
- Authors
- Abou-Faycal, I. C., Trott, M. D., & Shamai, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001-05
- Volume
- 47
- Issue
- 4
- Pages
- 1290-1301
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2111930879
- Cited by
- 429
- References
- 1
- FWCI
- 24.67
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The capacity of discrete-time memoryless Rayleigh-fading channels. https://app.cochat.ai/papers/10.1109/18.923716
- The paper
- Abou-Faycal, I. C., Trott, M. D., & Shamai, S. (2001). The capacity of discrete-time memoryless Rayleigh-fading channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.923716
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.
