An MGF-based performance analysis of generalized selection combining over Rayleigh fading channels
Mohamed‐Slim Alouini, M.K. Simon
Abstract
Mohamed‐Slim Alouini, M.K. Simon
Abstract
Using the notion of the "spacing" between ordered exponential random variables, a performance analysis of the generalized selection combining (GSC) diversity scheme over Rayleigh fading channels is presented and compared with that of the conventional maximal-ratio combining and selection combining schemes. Starting with the moment generating function (MGF) of the GSC output signal-to-noise ratio (SNR), we derive closed-form expressions for the average combined SNR, outage probability, and average error probability of a wide variety of modulation schemes operating over independently, identically distributed (i.i.d.) diversity paths. Because of their simple form, these expressions readily allow numerical evaluation for cases of practical interest. The results are also extended to the case of non-i.i.d. diversity paths.
OpenAlex reports 423 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using the notion of the "spacing" between ordered exponential random variables, a performance analysis of the generalized selection combining (GSC) diversity scheme over Rayleigh fading channels is presented and compared with that of the conventional maximal-ratio combining and selection combining schemes. Starting with the moment generating function (MGF) of the GSC output signal-to-noise ratio (SNR), we derive closed-form expressions for the average combined SNR, outage probability, and average error probability of a wide variety of modulation schemes operating over independently, identically distributed (i.i.d.) diversity paths. Because of their simple form, these expressions readily allow numerical evaluation for cases of practical interest. The results are also extended to the case of non-i.i.d. diversity paths.
Key concepts: Rayleigh fading, Moment-generating function, Diversity combining, Maximal-ratio combining, Independent and identically distributed random variables, Fading, Mathematics, Algorithm