.png){kind=icon}
.png){kind=icon}
Return
Greedy scheduling performance for a zero-forcing dirty-paper coded system
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2006.874008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This letter presents two results for multiuser Wireless systems employing dirty-paper coding strategies along with greedy scheduling over the broadcast multiple-input multiple-output channel. Specifically, an efficient and suboptimal downlink scheduler is proposed to approximate the maximum sum rate using equal power allocation, and it is shown to approach the maximum sum rate of optimal power allocation for a large number of users under optimal scheduling. The second result demonstrates that the average maximum sum rate can be tightly upper bounded when spatial multiplexing is maximized.
Keywords:
antenna arrays
dirty-paper coding (DPC
multiuser diversity
scheduling
spatial multiplexing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available