脏纸编码的多用户MIMO-OFDM系统中基于纳什公平的资源分配算法
doi: 10.3724/SP.J.1146.2007.00969
Nash Fairness Based Resource Allocation Algorithm for Dirty-Paper Coded Multi-user MIMO-OFDM Systems
-
摘要: MIMO-OFDM技术是实现大容量无线数据传输的一项关键技术。多用户系统中，在最大化系统资源利用率的同时保证用户间资源分配的公平性是系统设计的一个重要问题。该文首先分析了MIMO系统中最大化吞吐量的一种实现方式脏纸编码(DPC)，然后基于纳什公平性准则提出了一种用于DPC的多用户MIMO-OFDM系统中的自适应资源分配算法。仿真结果表明，该算法在损失较小系统吞吐量的前提下，很好地保证了用户间资源分配的公平性。
-
关键词:
- 通信与信息系统 /
- 动态资源分配 /
- 纳什公平 /
- 多输入多输出/正交频分复用 /
- 脏纸编码
Abstract: MIMO-OFDM has been one of the most promising techniques for high data rate wireless transmission. In multi-user systems, how to guarantee the fairness among users while achieving large system throughput is an important issue for practical system design. In this paper, the Dirty-Paper Coding (DPC) as a new transmission technique is investigated to achieve the large throughput of MIMO systems, and a novel resource allocation algorithm based on Nash fairness is proposed for dirty-paper coded multi-user MIMO-OFDM systems. Simulation results show that the proposed algorithm can provide fair resource allocation among users, with less overall system rate loss. -
[1] Vishwanath S, Jindal N, and Goldsmith A. Duality,achievable rates and sum-rate capacity of Gaussian MIMObroadcast channels [J].IEEE Trans. on Information Theory.2003, 49(10):2658-2668 [2] Viswanath P and Tse D N C. Sum capacity of the vectorGaussian broadcast channel and uplink-downlink duality [J].IEEE Trans. on Information Theory.2003, 49(8):1912-1921 [3] Yu W and Cioffi J. Sum capacity of Gaussian vectorbroadcast channels [J].IEEE Trans. on Information Theory.2004, 50(9):1875-1892 [4] Han Z, Ji Z, and Liu K J R. Fair multiuser channel allocationfor OFDMA networks using Nash bargaining solutions andcoalitions[J].IEEE Trans. on Communication.2005, 53(8):1366-1376 [5] Caire G and Shamai S. On the achievable throughput of amultiantenna Gaussian broadcast channel [J].IEEE Trans.on Information Theory.2003, 49(7):1691-1706 [6] Douligeris C and Mazumdar R R. More on Pareto-optimalflow control. Proceedings of the 26th Allerton Conference onCommunication, Control, and Computing, Urbana, IL,United States, 1987: 553-574. [7] Reklaitis G V, Ravindran A, and Ragsdell K M. EngineeringOptimization: Methods and Applications[M]. 2rd, New York:Wiley, 1983, Chap. 3, 5, 6. [8] Tu Z Y and Blum R S. Multiuser diversity for a dirty paperapproach[J].IEEE Trans. on Communications Letters.2003,7(8):370-372 [9] Jiang J, Buehrer R M, and Tranter W H. Greedy schedulingperformance for a zero-forcing dirty-paper coded system [J].IEEE Trans. on Communication.2006, 54(5):789-793 -
计量
- 文章访问数: 3545
- HTML全文浏览量: 92
- PDF下载量: 1396
- 被引次数: 0
下载:
