Combine DPC and TDM for MIMO Broadcast Channels in Circuit Data Scenarios
Dirty paper coding (DPC) is shown to achieve the capacity of multiple-input multiple-output (MIMO) Gaussian broadcast channels (BCs). 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 e.g. minimum power first (MPF) and get subpar performance. Meanwhile, the complexity of DPC scheme grows linearly with number of users requiring to cancel known-interference. In this paper we present a scheme combining DPC and traditional Time Division Multiplexing (TDM) that aim to maximize user capacity and reduce complexity of implementation. Simulation results show that the proposed scheme achieves better performance than that of DPC MPF scheme.
KeywordsBroadcast Channel User Capacity Time Division Multiplex Dirty Paper Code Complex Gaussian Distribution
Unable to display preview. Download preview PDF.
- 1.Telatar, I.: Capacity of multi-antenna gaussian channels. Bell Laboratories, Tech. Rep. (June 1995)Google Scholar
- 4.Boppana, S., Shea, J.: Downlink user capacity of cellular systems: Tdma vs dirty paper coding. In: Proc. IEEE Int. Symp. Inform. Theory, July 2006, pp. 754–758 (2006)Google Scholar