GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)
DOI: 10.1109/glocom.2003.1258250
|View full text |Cite
|
Sign up to set email alerts
|

High diversity with simple space time block-codes and linear receivers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 3 publications
0
28
0
Order By: Relevance
“…represents the kth diagonal element of the inverse of M, andĤ is obtained by removing the kth row of H. The associated SINR is γ k = E x /Rñ(k, k), which can be shown to be a chi-square random variable with 2(N − M + 1) degrees of freedom [4], [5]. The CDF of Y ∼ χ 2(N −M +1) , with variance 0.5 for the participating Gaussian random variables, is:…”
Section: Linear Receiversmentioning
confidence: 99%
“…represents the kth diagonal element of the inverse of M, andĤ is obtained by removing the kth row of H. The associated SINR is γ k = E x /Rñ(k, k), which can be shown to be a chi-square random variable with 2(N − M + 1) degrees of freedom [4], [5]. The CDF of Y ∼ χ 2(N −M +1) , with variance 0.5 for the participating Gaussian random variables, is:…”
Section: Linear Receiversmentioning
confidence: 99%
“…It is known that for i.i.d. Rayleigh channels, the diversity of the ZF receiver is L (ZF) = M − K + 1 [15], [16]. The WLZF approach described in this letter achieves a diversity of (see Appendix for the derivation)…”
Section: A Widely Linear Zero-forcing (Wlzf)mentioning
confidence: 99%
“…When H is complex, Λ contains M −K+1 diagonal elements equal to one and the rest are zero; hence,γ (ZF) k /γ follows a chi-squared distribution with 2M − 2K +2 degrees of freedom (DoF) [16]. It can be observed that because H is complex, h k corresponds to 2 column vectors of H R in (2), as the second half of its column vectors are formed by the elements of the first half of the column vectors.…”
Section: Appendix -Diversity Of Wlzfmentioning
confidence: 99%
“…Evidently, as shown in (20), the dimension of such a user pair subset is N q (τ ). Consequently, the search complexity can be significantly reduced if the number of UEs to be possibly paired is reduced, e.g., set the SNR threshold before pairing.…”
Section: A Maximize Capacity Pairing and Scheduling (Mcps) Schemementioning
confidence: 99%
“…According to (5) and (8) for SNR estimation, the addition and multiplication operations can be omitted in comparison with the operations for the multiplication and the inverse of the channel matrix in (8), which depends on the matrix dimension, i.e., O (K 2 N R ) and O (min (K, N R ) 3 ) respectively. For the exhaustive search shown in (20), the number of comparisons is determined by the number of users with a non-empty queue, i.e., N q . SNR estimation has to be carried out for each comparison.…”
Section: Computational Complexity and Overheadmentioning
confidence: 99%