Advances in Statistical Channel Modeling for Wireless Communications
View this Special IssueResearch Article  Open Access
Rausley Adriano Amaral de Souza, Antonio Marcelo Oliveira Ribeiro, Dayan Adionel Guimarães, "On the Efficient Generation of  and  White Samples with Applications", International Journal of Antennas and Propagation, vol. 2015, Article ID 873890, 13 pages, 2015. https://doi.org/10.1155/2015/873890
On the Efficient Generation of  and  White Samples with Applications
Abstract
This paper is concerned with a simple and highly efficient random sequence generator for uncorrelated and variates. The algorithm may yield an efficiency of almost 100%, and this high efficiency can be reached for all special cases such as , , , Nakagamim, Nakagamiq, Weibull, Hoyt, Rayleigh, Rice, Exponential, and the OneSided Gaussian. This generator is implemented via the rejection technique and allows for arbitrary fading parameters. The goodnessoffit is measured using the KolmogorovSmirnov and AndersonDarling tests. The maximum likelihood parameter estimation for the distribution is proposed and verified against true values of the parameters chosen in the generator. We also provide two important applications for the random sequence generator, the first one dealing with the performance assessment of a digital communication system over the and fading channels and the second one dealing with the performance assessment of the spectrum sensing with energy detection over special cases of these channels. Theoretical and simulation results are compared, validating again the accuracy of the generators.
1. Introduction
In nearly all fields of science, simulation is a strikingly powerful tool widely adopted to help develop a better understanding of some phenomenon under investigation. Particularly in engineering, it is used, for instance, to successfully test equipment, algorithms, and techniques, and, to some extent and whenever applicable, to avoid or minimize timeconsuming, costly, and inexhaustible field trials. Wireless communications are no exception and in this challenging, lively, and unkind area, with systems becoming increasingly more complex, both industry and academy engage themselves in developing simulators. Such simulators for wireless communications almost certainly include a block for the fading channel.
The fading channel can be described by a number of models. Among them, the general models, namely, ,  [1], and some particular cases such as  [2],  [2], and α [3], have been gaining wide acceptance [4–25]. Their flexibility renders them adaptable to situations in which none of the traditional distributions yield good fit [2, 3]. In addition, their applicability has been recognized in practical and real scenarios. Field measurements carried out in diverse propagation environments have shown that, in many situations, these models better accommodate the statistical variations of the propagated signal [1, Section VII], [2, 7–10, 26]. In this sense, developing and ameliorating methods in order to simulate the  and  fading models and their special cases for arbitrary values of their parameters are of paramount importance. One first step in such a direction is to generate uncorrelated samples and then, if required, correlate them.
This paper is concerned with the generation of uncorrelated samples of  and  fading models for arbitrary values of their parameters. Two largely applied methods in this case are the inversion method and the rejection method. The former involves the knowledge of the inverse of the cumulative distribution function (cdf) of the variate, which is either not always available or cannot be easily implemented, but, on the other hand, is highly efficient. The latter is general and applies to any variate but can be rather inefficient.
A useful method for generating independent , , and  sequences with an arbitrary fading parameter was recently investigated in [27]. The method is reported to achieve an efficiency higher than for  and for . More interestingly, a transformation was proposed in which, from an  sequence, a new  sequence can be obtained with an almost efficiency.
In this paper, we extend the applicability of the approach in [28] to provide an easytoimplement and highly efficient algorithm that generates  and  uncorrelated sequences for arbitrary values of their parameters. A simple transformation is also proposed, in which, from an  or  sequence, a new  or  sequence can be obtained with an almost efficiency. To the best of the authors' knowledge, the results reported here are new.
With the aim of quantifying the performance of the random sequence generators, we compare empirical cdfs to hypothesized ones by carrying out goodnessoffit KolmogorovSmirnov (KS) and AndersonDarling (AD) tests. We also generate a large number of  random variables, as a particular case of the  generator, and perform the maximum likelihood (ML) estimation of the parameters and . We then verify these estimates against true values of and defined in the generator. In this context, we use the maximum likelihood technique as its estimators have notable properties, mainly for large sample size [29]. In fact, under regularity conditions, for large sample size ML estimators are consistent and have normal distribution with variance attaining the CramérRao lower bound (CRLB) [29].
In order to demonstrate the usefulness of the proposed method, we provide theoretical and simulated bit error rates of a coherent binary phaseshift keying (BPSK) modulation over the  and  fading channels. We also provide the performance assessment of the spectrum sensing with energy detection over special cases of these channels, namely, the  and  channels.
The remaining of the paper is organized as follows. Section 2 presents the preliminary proposed algorithm and briefly describes the general distributions that are the focus of this paper. Numerical results, including the goodnessoffit test, and their interpretations are presented in Section 3. In Section 4 a near efficient and definitive algorithm for generating  and  variates is discussed in detail. Section 5 verifies the  generator performance by checking ML parameter estimates from  random samples against true values of the distribution parameters. In Section 6 the average error probability of the BPSK modulation over the  and  channels and the performance of the spectrum sensing over the  and  channels are presented. Some conclusions are drawn in Section 7.
2. Proposed Algorithm: Preliminary Results
In this section we present a preliminary proposed algorithm. However, in Section 4 the definitive and more efficient algorithm will be presented.
The majorizing hat function used here is given as [30]where is the majorizing density, , , and are coefficients to be obtained for the specific fading model so that can majorize for all , and is the desired probability density function (pdf) given in terms of the normalized envelope , with standing for  or . The parameter is given in an exact form aswhere is the error function. The coefficient is obtained as the solution of . In all cases, the parameter can be easily found numerically using wellknown software tools such as Mathematica or MATLAB. The coefficient is found as the mode of the pdf; that is, . Finally, the coefficient is found asAlgorithm 1 summarizes the steps for generating the desired sequences. The probability of acceptance in step 7 is . is the uniform distribution over the unit interval . The rejection method is well known and it is described in detail in [31]. Notice that the function has the form of a truncatedGaussian density. Random variables with pdf can be generated in a fast and accurate way by truncatedGaussian random variables generation methods (e.g., [32]).

2.1. The ακμ Distribution
For a fading signal with envelope and normalized envelope , the normalized  envelope pdf is given as [1]where is a parameter describing the nonlinearity of the propagation medium, is the ratio between the total power of the dominant components and the total power of the scattered waves, is related to the number of multipath waves, and is the modified Bessel function of first kind and order [33].
In particular, the first derivative of the  distribution is given by
2.2. The αημ Distribution
For a fading signal with envelope and normalized envelope , the  normalized envelope pdf is given as [1]where is the ratio between the inphase scattered wave and the quadrature scattered wave and is the Euler Gamma function [33].
In particular, the first derivative of the  distribution is given by
3. Numerical Results
In Figure 1, the empirical pdfs generated by the proposed method using samples are contrasted with the theoretical density for different values of , , , and . In this figure, the solid lines correspond to the theoretical results whereas the symbols correspond to the generated random variates. The excellent agreement between theoretical and simulated results can be noticed.
3.1. Efficiency
The acceptance proportion, or efficiency, is the performance measure of the acceptancerejection method. It is the ratio between the number of samples accepted by the method and the total number of samples generated from the respective hat function (majorizing function). Figures 2 and 3 depict the efficiency curves for different values of the pdf parameters using the proposed algorithm. Hereafter, the solid lines correspond to the theoretical results whereas the symbols refer to the simulation results.
The efficiency of the proposed method for the  distribution is shown in Figure 2. Notice that the acceptance proportion decreases with the increasing of the parameter . As can be seen, the efficiency is rather small for below but increases rapidly as reaches . The efficiency increases even further to reach almost for around . The wellknown Nakagami distribution is obtained by setting and in the  distribution in which case and the efficiency is around , in agreement with [30].
The efficiency of the proposed method for the  distribution is shown in Figure 3. Notice that the acceptance proportion increases with the increasing of the parameter for a fixed . The Nakagami distribution is obtained by setting , for , in which case , or, equivalently, for , in which case in the  distribution. In this case, once again, the efficiency stays around , in agreement with [30].
In all the cases, the acceptance ratio does not vary significantly with the variation of . In both, Figures 2 and 3, the acceptance proportion decreases with the increase of the fading parameter . This is a purely mathematical problem, in which we want to find a function (hat function) which is as close as possible to the distribution whose samples are to be generated. As it happens, the variations of the parameters provoke a change in the shape of the curves, which depart from that of the hat function, leading to an increase or a decrease in the efficiency. It is noteworthy that the samples are drawn with arbitrary parameters , , , and . Clearly, the acceptance proportion achieved using the proposed majorizing density is higher than when compared with a traditional uniform majorizing density.
A strikingly interesting result is shown next. Refer to Figure 2 for the efficiency of generating the  random variable. It can be noticed that the efficiency reaches almost for . For instance, with , , and the efficiency is . A similar conclusion can be found for the efficiency of generating the  random variable plotted in Figure 3. In this case the efficiency reaches almost for .
Figure 4 depicts the efficiency curves for the  over different values of and with fixed . Notice that the efficiency starts above (,  case with ), increases, and decreases but is still above for .
Figure 5 plots the efficiency curves for the  over different values of and using . Notice that the efficiency starts above (,  case with ), increases, and decreases but is still above for .
3.2. GoodnessofFit Test
The difference between the theoretical and experimental distributions is minimal as visually perceived in Figure 1. However, in order to objectively quantify the performance of the random sequence generator for the  and  fading distributions, the KolmogorovSmirnov (KS) test is performed so that the empirical cdf and the hypothesized cdf are compared. As found in the literature (e.g., [29]), the measure of the fit accuracy is given by the value. Table 1 reports values obtained for the generated sequences with different values of , , , and . In all of the cases, , unveiling an excellent goodnessoffit test result [31].

It is well known that the AndersonDarling test gives more weight to the tails than the KS test. Also, because the AndersonDarling test is specific for the hypothesized distribution, this test is likely to be more powerful than the traditional KS test [31]. For these reasons, we additionally have performed the AndersonDarling goodnessoffit test, with the objective of confirming the adherence of the generated random numbers also in the tails of their probability distributions. In general, critical values of the AndersonDarling test statistic depend on the specific distribution being tested. We have tested two particular cases of the  and  distributions, since for these cases the exact critical values and, consequently, the value are calculated analytically. The test has been performed for Weibull distribution ( with , , and ) and for the exponential distribution ( with , , and ). In the latter case the value was . In the first one the value was . These values reveal the adherence of the generated random numbers also in the tails of their probability distributions.
4. Main Result: A Near100% Efficient Algorithm for Generating ακμ, αημ Variates, and Their Particular Cases
A modified procedure for a highefficient and definitive algorithm can be noticed in this section. Let us consider first the  density. From of [3], it is possible to conclude that in the case of the  distribution, for any set () and (), the following holds: . That is, given an  distribution with parameters (), another  distribution with parameters (), can be obtained by following the given transformation. In particular, knowing that an efficiency of almost is achieved for  samples with (see Figure 4), a transformation of the kind can be used to attain any  samples with this high efficiency.
Considering the  distribution, for any set () and (), the following holds: . That is, given an  distribution with parameters (), another  distribution with parameters () can be obtained by following the given transformation. Specifically, knowing that an efficiency of almost is achieved for  samples with (see Figure 5), a transformation of the kind can be used to achieve any  samples with this high efficiency. In such cases, the efficiency is kept constant and close to , throughout the variation of the parameters.
Because  and  are particular cases of the  and  distributions (if we set ), respectively, notice that for both,  and  distributions, the same high efficiency can be attained. In other words, in order to generate  samples with an almost efficiency, the best choice is to generate  samples with and make the transformation . For the  case, .
In the same way, one can conclude that the high efficiency can be reached for all the particular cases of  and  distributions such as the wellknown Nakagamim, Rayleigh, and Weibull densities. All the particular cases of the  and  distributions can be found in [1, Section VI].
The steps for generating the desired sequences using the definitive algorithm are summarized in the Algorithm 2.

5. κμ Random Variable Generation and MaximumLikelihood Parameter Estimation
The generator ability in providing random samples following a given distribution can be alternatively verified by generating a large number of random variables and obtaining maximum likelihood (ML) estimates for the distribution parameters. In this section, as a particular case of the  generator, we generated sample data sets of independent identically distributed (i.i.d.)  random variables. Then, for each data set, we applied the ML parameter estimation and verified the estimates against true values of the generator parameters.
5.1. κμ Maximum Likelihood Parameter Estimation
Let be random variables representing normalized envelope observations following a common  distribution. We assume that this sample data set has a joint probability density function given by , where is the parameter vector to be estimated. The ML estimator can be determined maximizing the likelihood function as [29]In particular, assuming as i.i.d. random variables and with [2, Equation ], the random samples have a joint pdf given byEquivalently, we can maximize the loglikelihood function , which follows directly from (9) asto writeFrom (11), one can see that it is necessary to simultaneously solve the following equations:in order to obtain and .
Taking the derivative of (10) with respect to , after some simplifications we havewhere . In the same wayObserve that in (14) depends on with respect to both the order and the parameter . Hence, the derivative with respect to in the last term of (14) is the sum of two terms, one only related to and the other only related to . As a result, we haveHere is defined as the derivative of with respect to the order [33, Equation (9.6.42)]; that iswhere is the Digamma function [33, Equation (6.3.1)]. Fortunately, the function defined in (16) is available for direct usage in current numerical softwares, such as Mathematica, for instance, which makes (16) numerically tractable without additional difficulties.
In general, it is less computationally intensive to evaluate and iteratively by optimization algorithms, that is, finding that maximizes according to (11). Here we use the iterative optimization algorithm , available in the MATLAB software, to estimate the distribution parameters. In this case, we maximize the loglikelihood function applying the algorithm over the negative loglikelihood . However, we still make use of (13) and (14) in the estimator variance analysis.
The variance of an estimator is a measurement of its ability to perform reliably as it gives the degree of certainty in which the parameter is being estimated. In this context, the CramérRao lower bound (CRLB) sets a lower limit for the variance of all unbiased estimators for and gives the asymptotic variance for its ML estimator in a large sample size condition [34]. Particularly, we can obtain the CRLB by evaluating the Fisher information matrix contained in random variables about the parameter as [35] where , meaning the expectation operator, is taken with respect to the random variable . One can note that implies a multiple integration as depends on . Fortunately, it has been shown that i.i.d. random samples, representative of the population , have [35], where is the Fisher information contained in only one random variable about . In a matrix form we have [35]where the derivatives and are obtained, respectively, from (13) and (14) by setting . One can readily verify that the derivatives are given byThe element , for instance, is numerically solved aswhere is the  pdf given by [2, Equation ]. After numerically evaluating , the CRLB or, equivalently, the asymptotic covariance matrix of , based on i.i.d. observations , is given by [35]. As a consequence, for a large sample size we have and .
Figure 6 shows the normalized asymptotic variances and , based on the Fisher information contained in only one observation about the parameter . In particular, Figure 6(a) shows that has a minimum value about and does not depend on from a practical point of view. Note that this variance increases with the value of and tends to infinity when , denoting large uncertainty in estimating the parameter in a population with . Similarly, Figure 6(b) depicts that has no practical dependence with and linearly increases with .
(a)
(b)
Also, it has been shown [35] that has an asymptotic multivariate Gaussian distribution with mean and covariance matrix . Thus, as Furthermore, it is straightforward to find [36] the confidence interval for , with confidence level of 95%, asWe note that in (23) depends on , that is, the true value of the parameter, which is therefore unknown. However, converges in probability to as [34], which makes it possible to infer thatas . As a result, for large sample sizes we can estimate by in (23) in order to compute the confidence interval.
5.2. Performance of the  Random Variable Generator
We use Monte Carlo simulations in order to study the performance of the  generator. Following the guidelines given in Section II, for each in the set , and [1], we generate 500 sequences of i.i.d.  random variables. Similarly, we generate 500 i.i.d.  sequences of the same length for each from the set , and . In this way we cover a useful range of the parameters and , found in both indoor and outdoor multipath propagation environments [2, 37].
Taking advantage of notable properties of the ML estimation for large sample sizes, we calculate ML estimates of the parameters and for each sequence, according to (11), using the already cited algorithm , available in the MATLAB software. The starting values of the estimates required by the algorithm are given as the true values of the parameters.
Figure 7 shows the sample mean of , , against the true value of the parameter. In order to show the estimator variations about its sample mean, we also plotted in Figure 7 a confidence region defined by (sample standard deviation of ), where the sample standard deviation is given by . We verify that, for a large sample size, is unbiased, from a practical point of view, for the useful range of . This is in accordance with the unbiased behavior that the ML estimators have in large sample size conditions [29]. In addition, the confidence region of becomes broader as increases; that is, the variance of increases with the value of the parameter, as observed from the results in Figure 6(a).
Similar results of the sample mean for against are depicted in Figure 8. Likewise, is practically unbiased for the useful range of and its variance increases with the value of the parameter, according to the results in Figure 6(b).
The unbiasedness of the ML estimators for large sample sizes, depicted in Figures 7 and 8, reveals the  generator ability to provide real random samples representative of a population with distribution . This also alternatively confirms the excellent goodnessoffit results given by the KolmogorovSmirnov and AndersonDarling tests in Section 3, when applied to the  generator.
6. Applications
In this section we give applications of the proposed random variable generators and use theoretical and simulation results for certifying the accuracy of these generators.
6.1. Average Error Probability of the BPSK Modulation over the  and  Fading Channels
Here we analyze the bit error rate (BER) of the BPSK modulation over frequencyflat fading channels modeled by the  and  distributions. We assume coherent detection with matched filter or correlator receivers, for which the following vector channel model applies: the decision variable is , where is the multiplicative fading with , represents a bit 1, represents a bit 0, and is the zero mean, additive white Gaussian noise (AWGN) with variance .
One possible analytical method employed for determining the performance of a mobile radio communication system is by evaluating the error probability as a function of a fixed signaltonoise ratio (SNR) and then averaging the result over the probability density function of the SNR variations, which is governed by the particular envelope fading distribution. For instance, the bit error probability of the BPSK modulation over the pure AWGN channel as a function of the received SNR is given bywhere is the SNR for a particular value of the envelope , is the ratio between the average energy per bit and the noise power spectral density, and is the complementary error function.
Now, we must average over the probability density function of ; that is,where is the pdf of for all , with standing for  or .
Applying a transformation of random variables, from (4) and (6), we havewhere is the average SNR when is  or  distributed.
The integral in (26) was evaluated numerically. The average error probabilities curves for the  and  fading channels are presented in Figures 9 and 10. In these figures, the theoretical results (solid), from (26), and the simulated results (symbols), from a MATLAB program based on the vector channel model presented above, are plotted for the indicated fading conditions. It is clearly observed that, in spite of the variety of the fading conditions, excellent agreement between the estimated and theoretical results is shown, once more certifying the proposed algorithms for random variable generation. A myriad of different scenarios can be exercised for different values of the fading parameters. We omitted some particular cases (e.g., Rice or Nakagami) for the sake of brevity. All the particular cases departing from the general models considered in this paper are in agreement with the particular cases presented in the literature (see, for example, the expressions presented in [38]).
It is worth mentioning that the application just described can be used to check the adherence of the generated random numbers to the tails of their probability distributions as follows. The agreement between theoretical and simulation results in the high regime is an evidence of a good adherence in the tail region, since this region governs the performance at high signaltonoise levels.
6.2. Spectrum Sensing over the  and  Fading Channels
Modern wireless communication systems are now facing a huge obstacle, spectrum scarcity. New services and applications appear every day, demanding increased bandwidth, new spectrum bands, or both. However, the currently adopted fixed spectrum allocation policy prevents those services and applications to be deployed in adequate pace. Nevertheless, recent studies have demonstrated that, in fact, the radiofrequency spectrum is quite underutilized in some areas and during some time [39]. The cognitive radio (CR) [40] concept then came into scene, aiming at, among other things, opportunistic dynamic spectrum access to idle bands. In this situation, the network which owns the right of using the spectrum is called the primary network, and the cognitive radio network is usually referred to as the secondary network.
To detect the idle bands, also called spectral holes or whitespaces, the CRs must have some sort of spectrum sensing capability [41]. Among the spectrum sensing techniques already developed, energy detection is one of the most attractive, since it has low implementation complexity and good detection power. In energy detection, a test statistic computed from the received signal energy and the noise variance is compared against a threshold so that the decision upon the occupation of the sensed channel is made.
Several studies consider the problem of spectrum sensing with energy detection over the pure AWGN channel, an approach, that is, by far unrealistic since typical wireless communication channels are also subjected to fading. Then, it is of paramount importance to access the performance of a spectrum sensing technique taking into account the channel fading.
There are several fading channel models available in the literature. Among them, two wellaccepted models deserve attention due to their ability for accurately modelling several real channel conditions in practice. They are the  [2] and  [2] fading channel models. Both are special cases of the  and  fading models considered in this paper, if is adopted.
In this section we apply  and  random variates, specialized to  and  variates, to analyze the performance of the energy detection over fading channels.
6.2.1. System Model
The discretetime model for the hypothesis test associated with the spectrum sensing problem is given bywhere denotes an idle channel state and denotes a busy channel, is the th received signal sample collected by the CR, during the sensing interval, is the zero mean Gaussian thermal noise sample generated at the receiver input, is the primary transmitted signal sample, and represents the channel fading envelope, which is assumed to be constant during the sensing interval. From the received signal, the test statistic for the energy detector is computed according towhere is the thermal noise variance measured in the bandwidth , with being the noise power spectral density. The number of samples relates with the sensing time and the bandwidth through the timebandwidth product , leading to .
The average signaltonoise ratio (SNR) is defined by , where the primary transmitted signal energy during the sensing interval is and is the second moment of the fading envelope. Assuming without loss of generality and using , the average SNR is simplified to . If the primary signal power is , the noise variance can be determined from a given SNR by applying
6.2.2. Results
The performance of a spectrum sensing technique is often measured in terms of the probability of detection, , and the probability of false alarm, . When the primary network signal is present in the sensed channel, is the probability of declaring it indeed present. When the primary network signal is absent, is the probability of declaring it present. A large value of translates into a small probability of interference from the secondary in the primary network. A small value of translates into an increased throughput of the secondary network due to a more efficient use of spectral holes. These probabilities are often traded in a receiver operating characteristic (ROC) curve, which shows the values of versus as the decision threshold is varied.
Figure 11 shows analytical (lines) and simulation (symbols) results of the energy detection over the  ( with ) and  ( with ) fading channels. We have considered samples (), , 5, 8, and 10 dB. The simulation results were obtained from 100,000 Monte Carlo runs. The analytical results were obtained by numerically evaluating and of [42] in the case of , and by evaluating and of [43] in the case of . We have used the Mathematica software package to solve the above equations. The minimum and maximum values of the decision threshold (resp., and ) are also reported to facilitate the reproduction of our results. Specifically, for and , , and , for and , , and , for and , , and , and for and , , and .