An efficient approximation to the correlated Nakagami-m sums and its application in equal gain diversity receivers

There are several cases in wireless communications theory where the statistics of the sum of independent or correlated Nakagami-m random variables (RVs) is necessary to be known. However, a closed-form solution to the distribution of this sum does not exist when the number of constituent RVs exceeds two, even for the special case of Rayleigh fading. In this paper, we present an efficient closed-form approximation for the distribution of the sum of arbitrary correlated Nakagami-m envelopes with identical and integer fading parameters. The distribution becomes exact for maximal correlation, while the tightness of the proposed approximation is validated statistically by using the Chi-square and the Kolmogorov-Smirnov goodness-of-fit tests. As an application, the approximation is used to study the performance of equal-gain combining (EGC) systems operating over arbitrary correlated Nakagami-m fading channels, by utilizing the available analytical results for the error-rate performance of an equivalent maximal-ratio combining (MRC) system

A simple importance sampling technique for orthogonal space-time block codes on Nakagami fading channels

In this contribution, we present a simple importance sampling technique to considerably speed up Monte Carlo simulations for bit error rate estimation of orthogonal space-time block coded systems on spatially correlated Nakagami fading channels

Efficient BER simulation of orthogonal space-time block codes in Nakagami-m fading

In this contribution, we present a simple but efficient importance sampling technique to speed up Monte Carlo simulations for bit error rate estimation of orthogonal space-time block codes on spatially correlated Nakagami-m fading channels. While maintaining the actual distributions for the channel noise and the data symbols, we derive a convenient biased distribution for the fading channel that is shown to result in impressive efficiency gains up to multiple orders of magnitude

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Selective Combining for Hybrid Cooperative Networks

In this study, we consider the selective combining in hybrid cooperative networks (SCHCNs scheme) with one source node, one destination node and $N$ relay nodes. In the SCHCN scheme, each relay first adaptively chooses between amplify-and-forward protocol and decode-and-forward protocol on a per frame basis by examining the error-detecting code result, and $N_c$ ($1\leq N_c \leq N$) relays will be selected to forward their received signals to the destination. We first develop a signal-to-noise ratio (SNR) threshold-based frame error rate (FER) approximation model. Then, the theoretical FER expressions for the SCHCN scheme are derived by utilizing the proposed SNR threshold-based FER approximation model. The analytical FER expressions are validated through simulation results.Comment: 27 pages, 8 figures, IET Communications, 201