The DOI matches its Crossref record.
New exponential bounds and approximations for the computation of error probability in fading channels
Abstract
We present new exponential bounds for the Gaussian Q function (one- and two-dimensional) and its inverse, and for M-ary phase-shift-keying (MPSK), M-ary differential phase-shift-keying (MDPSK) error probabilities over additive white Gaussian noise channels. More precisely, the new bounds are in the form of the sum of exponential functions that, in the limit, approach the exact value. Then, a quite accurate and simple approximate expression given by the sum of two exponential functions is reported. The results are applied to the general problem of evaluating the average error probability in fading channels. Some examples of applications are also presented for the computation of the pairwise error probability of space-time codes and the average error probability of MPSK and MDPSK in fading channels.
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
Cited by
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
Metadata
- Authors
- Chiani, M., Dardari, D., & Simon, M. K.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2003-05
- Volume
- 24
- Issue
- 5
- Pages
- 840-845
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2109191808
- Cited by
- 885
- References
- 0
- FWCI
- 6.03
- 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: New exponential bounds and approximations for the computation of error probability in fading channels. https://app.cochat.ai/papers/10.1109/twc.2003.814350
- The paper
- Chiani, M., Dardari, D., & Simon, M. K. (2003). New exponential bounds and approximations for the computation of error probability in fading channels. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2003.814350
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.
