2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) 2004
DOI: 10.1109/icc.2004.1313031
|View full text |Cite
|
Sign up to set email alerts
|

An iterative beamforming technique for OFDM-based wireless networks with uncoordinated channel access

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…This may serve as the stopping criterion, even though having arrived atŝ ML is not guaranteed. As shown in [18], this procedure represents an instance of the SAGE algorithm derived in [17].…”
Section: B Iterative Likelihood-maximizationmentioning
confidence: 99%
“…This may serve as the stopping criterion, even though having arrived atŝ ML is not guaranteed. As shown in [18], this procedure represents an instance of the SAGE algorithm derived in [17].…”
Section: B Iterative Likelihood-maximizationmentioning
confidence: 99%
“…Remark Analytical characterisation of beamforming algorithms in cellular networks was previously found to have no tractable analysis (because of the dependency of their transmission decisions on the CSI, codebook size, receiver type and number of antennas [10, 21, 26]). For this reason, beamforming algorithms for such networks, in general, are often evaluated via simulations [10, 21].…”
Section: Performance Evaluationmentioning
confidence: 99%