Berry R A and Yeh E M. Cross-layer wireless resource allocation[J].IEEE Signal Processing Mag.2004, 21(5):59-68[2]Boche H and Wiczanowski M. Optimal scheduling for high speed uplink packet access- a cross-layer approach. in Proc. Vehicular Technology Conference, VTC, Los Angeles, USA, September 2004, 5: 2575-2579.[3]Boche H andWiczanowski M. Stability region of arrival rates and optimal scheduling for MIMO-MAC-a cross-layer approach. in Proc. International Zurich Seminar on Comm., ETH Zurich, Switzerland, 2004: 18-21.[4]Jindal N and Goldsmith A. Dirty-paper coding versus TDMA for MIMO broadcast channels[J].IEEE Trans. on Inform. Theory.2005, 51(5):1783-1794[5]Samardzija D and Mandayam N. Multiple antenna transmitter optimization schemes for multiuser systems. in Proc. Vehicular Technology Conference, VTC, Orlando, FL, USA, 2003, 1: 399-403.[6]Liang Ying-Chang and Zhang Rui. Transmit optimization for MIMO channels with mixed delay-constrained and no-delay-constrained services. in Proc. Acoustics, Speech, and Signal Processing. ICASSP, Montreal, Canada,2004, 4: 17-21.[7]Taesang Yoo and Goldsmith A. Optimality of zero-forcing beamforming with multiuser diversity. in Proc. IEEE International, Conference on Communication, ICC, Seoul, Korea,2005, 1: 542-546.[8]Jiang J, Buehrer R M, and Tranter W H. High-speed downlink packet transmission with spatial multiplexing and scheduling. in Proc. Wireless Communications and Networking Conference, WCNC, Atlanta, Georgia USA, 2004, 4: 21-25.[9]Eryilmaz A, Srikant R, and Perkins J R. Stable scheduling policies for broadcast channels. in Proc. IEEE International Symposium on Information Theory, Lausanne, Switzerland, 2002: 382-382.[10]Airy M, Shakkattai S, and Heath R W. Spatially greedy scheduling in multi-user MIMO wireless systems[J].The Thrity-Seventh Asilomar Conference on Signals, Systems Computers, Pacific Grove, CA, USA.2003, 1:982-986[11]Sharif M and Hassibi B. On the capacity of MIMO broadcast channel with partial side information[J].IEEE Trans. on Inform. Theory.2005, 51(2):506-522
|