A Near-100% Efficient Algorithm for Generating alpha-kappa-#181; and alpha-eta-#181; Variates

In this paper, we propose a simple and highly efficient random sequence generator for α-κ-μ and α-η-μ variates. The proposed algorithm may yield an efficiency of almost 100% for α-κ-μ and α-η-μ. This high efficiency can be reached for all special cases such as α-μ, κ-μ, η-μ, Nakagami-m, Nakagami-q, Weibull, Hoyt, Rayleigh, Rice, Exponential, and the One-Sided Gaussian. These generators are implemented via the rejection technique and allow for arbitrary fading parameters. The goodness-of-fit is objectively measured using the the p-value of the Kolmogorov-Smirnov test.