paper 3, Iterative User Selection Scheme for MIMO Broadcast Channels in Circuit Data Scenarios
Table of Contents
- Session 1 of Future Computer and Communication 2011
- 1. Integrating Entanglement Swapping into Secure Socket Layer — Handshake Protocol
- Session 2 of Future Computer and Communication 2011
- 11. Scene Change Detection with Temporally Constrained Clustering
- Session 3 of Future Computer and Communication 2011
- 21. Walking Compensation Treadmill Based System: Device, Environment and Testing Method
- Session 4 of Future Computer and Communication 2011
- 31. Hidden Coupling and Its Impact on Software Reliability
- Session 1 of Mathematics in Business and Economics 2011
- 40. Modeling Operational Risk in Financial Institutions: Application and Improvement on EVT
- 44. The Effects of Split Share Structure on Accounting Conservatism—Evidence from Chinese Listed Firms
- Session 1 of Mathematics and Geosciences 2011
- 46. Application of Three-Dimensional Terrain Modeling Technology of Gan Jiang Yuan
- Session 1 of Mathematics and Arts 2011
- 51. Automatic Masked Morphing for 3D Facial Animations
- Session 2 of Mathematics and Arts 2011
- 61. Structural Instability for Solo Piano (2007) by Greek Composer Fani Kosona
- Session 3 of Mathematics and Arts 2011
- 71. The Creation of the Modal through Symmetry in Liviu Glodeanu's Musical Composition
Chapter Contents
- Abstract
- Key Words
- 1 Introduction
- 2. System Model
- 3. Iterative User Selection Scheme
- 4. Performance Simulation Results
- 5. Conclusion
- References
Excerpt
Based Dirty paper coding (DPC) is shown to achieve the capacity of multiple-input multiple-output (MIMO) Gaussian broadcast channels (BCs). In circuit data scenarios, users demand to get service at fixed desire rate. Finding the optimal covariance matrices and order of users for maximizing user capacity requires high complexity computation. To deal with this problem, many researchers use fixed order of users and get subpar performance. In this paper we present an iterative user selection scheme that aims to maximize user capacity. The main feature of the proposed scheme is that it does not impose a fixed order on the users. Users to be served are chosen iteratively considering influence from the chosen ones. Simulation results show that the proposed scheme achieves better performance than similar simple schemes. In addition, a compromise between performance and complexity can be made by a candidate user set concept. Cardinality of the candidate user set is fixed and users in the set are dynamically adjusted.
©2011 ASME


This Publication
Scitation
SPIN
Scitopia
Google Scholar
PubMed