Practical, Highly Efficient Algorithm for Generating κ-μ and η-μ Variates and a Near-100% Efficient Algorithm for Generating α-μ Variates

In this letter, we propose a simple and highly efficient random sequence generator for κ -μ and η -μ variates and a near-100% efficient algorithm for generating α -μ variates. The proposed algorithm may yield an efficiency higher than 80% for η -μ , 87.5% for κ -μ and almost 100% for α -μ . 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.