Implementation complexity analysis of normalized threshold generalized selection combining

Abstract

The implementation complexity of normalized threshold generalized threshold generalized selection combining (NT-GSC) is studied via calculating statistics of the number of combined branches. Using the probability space partition approach, the average number of combined branches and the variance on the number of combined branches are derived in compact forms. The resultant formulae is applicable to arbitrary fading channels provided that the independence of the fading is met.