Papers › Reliability Bounds for Dependent Fading Wireless Channels

Reliability Bounds for Dependent Fading Wireless Channels

3 Sep 2019arXiv:1909.01415links table onlyarchive 2025-07-28

Karl-Ludwig Besser, Eduard A. Jorswieck

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to improve the outage performance. The success of these approaches relies heavily on the joint distribution of the underlying fading channels. In this work, we consider the ε-outage capacity of slowly fading wireless diversity channels and provide lower and upper bounds for fixed marginal distributions of the individual channels. This answers the question about the best and worst case outage probability achievable over n fading channels with a given distribution, e.g., Rayleigh fading, but not necessarily statistically independent. Interestingly, the best-case joint distribution enables achieving a zero-outage capacity greater than zero without channel state information at the transmitter for n ≥2. Furthermore, the results are applied to characterize the worst- and best-case joint distribution for zero-outage capacity with perfect channel state information everywhere. All results are specialized to Rayleigh fading and compared to the standard assumption of independent and identically distributed fading component channels. The results show a significant impact of the joint distribution and the gap between worst- and best-case can be arbitrarily large.

PaperPDFCode

Code

gitlab.com/klb2/reliability-bounds-dependent-fading-channels officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections