Please use this identifier to cite or link to this item:
|Title:||Unified error probability analysis for generalized selection combining in Nakagami fading channels|
|Authors:||Ma, Y. |
|Citation:||Ma, Y., Chai, C.C. (2000-11). Unified error probability analysis for generalized selection combining in Nakagami fading channels. IEEE Journal on Selected Areas in Communications 18 (11) : 2198-2210. ScholarBank@NUS Repository. https://doi.org/10.1109/49.895025|
|Abstract:||We study generalized selection combining (GSC) schemes in independent Nakagami fading channels, where N diversity branches with the largest instantaneous signal-to-noise ratios (SNR's) are selected from the total of L (N≤L) branches and then coherently or noncoherently combined. We propose two different techniques to derive the moment generating function (MGF) expressions for the GSC output SNR in generalized Nakagami fading channels, where there are distinct and noninteger fading severity parameters, as well as different average SNR's in different diversity branches. For arbitrary fading severity parameter mk, k = 1, ..., L, the MGF expression is given in a summation of N-dimensional definite integrals with the limits independent of SNR or channel parameters, and therefore can be evaluated very efficiently with numerical methods. Furthermore, for integer mk closed-form MGF expressions are derived. Specializations of our results to Rayleigh channels and independent identically distributed (i.i.d.) Nakagami channels are presented, which are either new or equivalent to previously published results. Using the newly derived MGF expression, we provide a unified error probability analyses for many coherent and noncoherent modulation/detection schemes.|
|Source Title:||IEEE Journal on Selected Areas in Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 16, 2018
WEB OF SCIENCETM
checked on Oct 8, 2018
checked on Oct 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.