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

• Published in: IEEE communications letters Vol. 16; no. 11; pp. 1768 - 1771
• Main Authors: Cogliatti, R., de Souza, R. A. A., Yacoub, M. D.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.11.2012; Institute of Electrical and Electronics Engineers
• Subjects: Adaptation models; Algorithms; Applied sciences; Correlation; Diversity reception; Exact sciences and technology; Fading; Generators; Information, signal and communications theory; Kolmogorov-Smirnov test; Probability density function; Random generators; Rejection; Signal and communications theory; Signal, noise; Telecommunications and information theory; Wireless communication; α-μ and Nakagami-m distributions; η-μ; κ-μ; Performance evaluation; Random sequence; Nakagami fading; Algorithm performance; Signal theory; Random generators; η-μ α-μ and Nakagami-m distributions; Algorithm; Implementation
• ISSN: 1089-7798; 1558-2558
• DOI: 10.1109/LCOMM.2012.092112.121359

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.