Abstract
The inverse cumulative distribution function (CDF) appears in many important problems such as outage probability calculations in wireless communications. The Nakagami-m inverse CDF is difficult to compute numerically and is known to have no closed form. In this paper, we present a new and useful approximation to the Nakagami-m inverse CDF. The genetic algorithm is applied to optimize the coefficients of the proposed approximation. For typical cases in Nakagami-m wireless communication channels, it is shown through comprehensive computer simulations that the proposed method has high accuracy in most of the region of the exact CDF values.




References
Nakagami, M. (1960). The m-distribution, a general formula of intensity distribution of rapid fading. In W. G. Hoffman (Ed.), Statistical methods in radio wave propagation. Oxford: Pergamon.
Yang, L. Y., & Hanzo, L. (2002). Performance of generalized multicarrier DS-CDMA over Nakagami-m fading channels. IEEE Transactions on Communications, 50(6), 956–966.
Lee, B., & Lee, C. (2013). Performance analysis of cooperative multi-hop networks with hop selection in Nakagami-m fading channels. IEEE Transactions on Wireless Communications, 12(8), 3851–3859.
Lu, T., Ge, J., Yang, Y., & Gao, Y. (2013). Outage probability analysis of signal space cooperative communications over Nakagami-m fading channels. Electronics Letters, 49(18), 1186–1188.
Salhab, A. M., Al-Qahtani, F., Zummo, S. A., & Alnuweiri, H. (2013). Exact outage probability of opportunistic DF relay systems with interference at both the relay and the destination over Nakagami-m fading channels. IEEE Transactions on Vehicular Technology, 62(2), 920–927.
Xia, M., Wu, Y. C., & Aïssa, S. (2012). Exact outage probability of dual-hop CSI-assisted AF relaying over Nakagami-m fading channels. IEEE Transactions on Signal Processing, 60(10), 5578–5583.
Beaulieu, N. C., & Cheng, C. (2005). Efficient Nakagami-m fading channel simulation. IEEE Transactions on Vehicular Technology, 54(2), 413–424.
Cheng, C. (2000). A Nakagami-m fading channel simulator. M.Sc. thesis, Dept. Elect. Comp. Eng., Queen’s Univ., Kingston, ON, Canada.
Beaulieu, N. C., & Abu-Dayya, A. A. (1991). Analysis of equal gain diversity on Nakagami fading channels. IEEE Transactions on Communications, 39(2), 225–234.
Gradshteyn, I. S., & Ryzhik, I. M. (2007). Table of integrals, series, and products (3rd ed.). New York: Academic.
Proakis, J. G. (1995). Digital communications (3rd ed.). New York: McGraw-Hill.
Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press, re-issued by MIT Press (1992).
Develi, I., Kabalci, Y., & Basturk, A. (2014). Performance of LDPC coded image transmission over realistic PLC channels for smart grid applications. International Journal of Electrical Power & Energy Systems, 62, 549–555.
Develi, I., & Akdagli, A. (2013). High-order exponential approximations for the Gaussian Q-function obtained by genetic algorithm. International Journal of Electronics, 100(4), 553–562.
Ciftikli, C., Develi, I., & Ozsahin, T. (2004). Increasing the minimum Euclidean distance in combined trellis coding by using genetic algorithms. In IEEE 12th signal processing and communications applications conference, pp. 549–551, April, 2004, Kusadası, Turkey.
Xu, L., Li, Y., & Tang, Z. (2014). Hybrid-genetic-algorithm-based resource allocation for slow adaptive OFDMA system under channel uncertainty. Electronics Letters, 50(1), 30–32.
Euzière, J., Guinvarc’h, R., Uguenand, B., & Gillard, R. (2014). Optimization of sparse time-modulated array by genetic algorithm for radar applications. IEEE Antennas and Wireless Propagation Letters, 13, 161–164.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bilim, M., Develi, I. A New Nakagami-m Inverse CDF Approximation Based on the Use of Genetic Algorithm. Wireless Pers Commun 83, 2279–2287 (2015). https://doi.org/10.1007/s11277-015-2520-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-015-2520-1