1996
DOI: 10.1109/26.536918
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of diversity combining techniques for Rayleigh-fading channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

7
157
0
5

Year Published

1997
1997
2014
2014

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 397 publications
(169 citation statements)
references
References 13 publications
7
157
0
5
Order By: Relevance
“…In [7], the bit error rate performance of H-S/MRC with and out of branches was analyzed, and it was pointed out that "the expressions become extremely unwieldy" for . The average SNR of H-S/MRC was derived in [8].…”
Section: Introductionmentioning
confidence: 99%
“…In [7], the bit error rate performance of H-S/MRC with and out of branches was analyzed, and it was pointed out that "the expressions become extremely unwieldy" for . The average SNR of H-S/MRC was derived in [8].…”
Section: Introductionmentioning
confidence: 99%
“…Hybrid diversity reception where, first a group of signals is selected out of the total available, which are then maximal-ratio combined has been discussed in [6]. Similar approaches have been then explored in several other papers [7][8].…”
Section: Introductionmentioning
confidence: 99%
“…Noting that the average number of SNR comparisons for i/j-GSC, denoted by C GSC(i,j) , can be obtained as 3 With traditional sorting approach, we need k − 1 comparisons to find the kth largest/smallest one after the previous k − 1 largest/smallest ones have been found. We follow this traditional approach in order to perform an accurate complexity comparison while noting that with quick sorting algorithm for n paths, we just need O(log(n)) complexity.…”
Section: B Average Number Of Snr Comparisonsmentioning
confidence: 99%
“…The main idea behind [2] is that, in the SHO region, whenever the received signal is of unsatisfactory quality, the receiver scans the additional resolvable paths from the target BS and selects the strongest paths among the total available paths from both the serving and the target BSs. It has been shown that this scheme can reduce the unnecessary path estimations and the SHO overhead compared to the conventional generalized selection combining (GSC) scheme [3]- [5] which always uses L c /(L + L a )-GSC in the SHO region where L c is the number of fingers, L and L a are the total resolvable paths from the serving and the target BSs, respectively.…”
Section: Introductionmentioning
confidence: 99%