Nash Fairness Based Resource Allocation Algorithm for Dirty-Paper Coded Multi-user MIMO-OFDM Systems

[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