Search arXivSearch

arXiv · 2211.07432

The $α$-$η$-$κ$-$μ$ Fading Model: An Exact Statistical Representation

Abstract

The $α$-$η$-$κ$-$μ$ is one of the most generalized and flexible channel models having an excellent fit to experimental data from diverse propagation environments. The existing statistical results on the envelope of $α$-$η$-$κ$-$μ$ model contain an infinite series involving regularized hypergeometric function and generalized Laguerre polynomial, prohibiting its widespread application in the performance analysis of wireless systems. In this paper, we employ a novel approach to derive density and distribution functions of the envelope of the $α$-$η$-$κ$-$μ$ fading channel without an infinite series approximation. The derived statistical results are presented using a single Fox's H-function for tractable performance analysis and efficient numerical computations, especially for high-frequency mmWave and terahertz wireless transmissions. To gain insight into the distribution of channel envelope, we develop an asymptotic analysis using a more straightforward Gamma function converging to the exact within a reasonable range of channel parameters. To further substantiate the proposed analysis, we present the exact outage probability and average bit-error-rate (BER) performance of a wireless link subjected to the $α$-$η$-$κ$-$μ$ fading model using a single tri-variate Fox's H-function. We obtain the diversity order of the system by analyzing the outage probability at a high signal-to-noise (SNR) ratio. We use numerical and simulation analysis to demonstrate the significance of the developed statistical results compared with the existing infinite series representation for the envelope of the $α$-$η$-$κ$-$μ$ model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pranay Bhardwaj, Eesha Santosh Karnawat, S. M. Zafaruddin. 2023-06-10. The $α$-$η$-$κ$-$μ$ Fading Model: An Exact Statistical Representation. https://arxiv.org/abs/2211.07432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT