2012
DOI: 10.1109/tvt.2011.2178622
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Scheduling Algorithms for Multiantenna CDMA Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 26 publications
0
21
0
Order By: Relevance
“…As previously reported by many works dealing with user scheduling for MIMO systems using ZFBF [5], [8], the achievable sum rate approaches its optimal value if the BS schedules simultaneously near orthogonal users. In this paper, instead of evaluating all the possible combinations of users we limit our search to near-orthogonal users.…”
Section: B Graph Problem Formulationmentioning
confidence: 72%
See 1 more Smart Citation
“…As previously reported by many works dealing with user scheduling for MIMO systems using ZFBF [5], [8], the achievable sum rate approaches its optimal value if the BS schedules simultaneously near orthogonal users. In this paper, instead of evaluating all the possible combinations of users we limit our search to near-orthogonal users.…”
Section: B Graph Problem Formulationmentioning
confidence: 72%
“…We set , and dB. We notice that the greedy algorithm achieves different 8 performances as we change the selection criterion used to pick the next vertex to be colored. As expected, the edge degree is the worst selection criterion since it does not take into account vertices' weights.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The output performances and comparison with existing approaches [1], [2], [3], [4] are presented here. The Frequency of Convergence (FOC) and fitness threshold for some of the benchmark instances are shown in Table 1.…”
Section: Simulation Of Proposed Hybrid Evolutionary Methods and Comparmentioning
confidence: 99%
“…Based on the interference constraints of the mobile network, allocation should be done to maximize the network bandwidth efficiency. Fixing m channels to the n cells is the Fixed Channel Allocation Problem (FCAP), an NP-hard problem [1], [2], [3]. Fixing the channels to cells based on co-channel, adjacent channel and co-site channel constraints is a graph coloring problem.…”
Section: Introductionmentioning
confidence: 99%
“…Section VIII], and the CQI is particularly used for power control, link adaptation, and interference management [55]. The CSI feedback interval [33], [36], [41], [47], [59], [60], [61], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [71], [72], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88], [89], [90], [91], [92], [93], [94], [95], [96] [39], [40], [97], [97], [98], [...…”
Section: The Need Of Csi Availabilitymentioning
confidence: 99%