Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 352

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

$N{\ast}$Nakagami: A Novel Stochastic Model for Cascaded Fading Channels

Karagiannidis, George K., Sagias, Nikos C., Mathiopoulos, P. Takis · 2007 · IEEE Transactions on Communications

Abstract

A generic and novel distribution, referred to as Nakagami, constructed as the product ofNstatistically independent, but not necessarily identically distributed, Nakagami-mrandom variables (RVs), is introduced and analyzed. The proposed distribution turns out to be a very convenient tool for modelling cascaded Nakagami-mfading channels and analyzing the performance of digital communications systems operating over such channels. The moments-generating, probability density, cumulative distribution, and moments functions of theN*Nakagami distribution are developed in closed form using the Meijer's G -function. Using these formulas, generic closed-form expressions for the outage probability, amount of fading, and average error probabilities for several binary and multilevel modulation signals of digital communication systems operating over theN*Nakagami fading and the additive white Gaussian noise channel are presented. Complementary numerical and computer simulation performance evaluation results verify the correctness of the proposed formulation. The suitability of theN*Nakagami fading distribution to approximate the lognormal distribution is also being investigated. Using Kolmogorov--Smirnov tests, the rate of convergence of the central limit theorem as pertaining to the multiplication of Nakagami-mRVs is quantified.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcomm.2007.902497

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 352

Metadata

Authors
Karagiannidis, G. K., Sagias, N. C., & Mathiopoulos, P. T.
Venue
IEEE Transactions on Communications
Published
2007-08
Volume
55
Issue
8
Pages
1453-1458
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2114885516
Cited by
352
References
12
FWCI
9.45
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.