臺灣博碩士論文加值系統

機會波束形成(Opportunistic Beamforming)可以增加通道波動的幅度與速率，因此在多用戶排程(Scheduling)下可提升多用戶分集(Multiuser Diversity)增益與公平性。在本論文中，我們於接收端利用多根接收天線，提供空間分集(Spatial Diversity)增益，進一步地增加系統效能，使系統吞吐量、等待延遲時間與公平性上的表現皆有所提升，然而卻仍保有與傳統機會波束形成相同的迴授量。我們提出的方法也證實不管是在較少的使用者、較慢的波束形成權重變化或是較為平緩之通道波動中，依然能維持相近的系統吞吐量。這都有助於更有效益的獲得多用戶分集增益。另一方面，透過通道預測(Channel prediction)機制，在通道較能準確預測下，使用預編排(Pre-scheduling)將可使我們所提出的系統進一步地提升系統吞吐量，而等待延遲時間與公平性也能有所改善。

Opportunistic beamforming can increase the fluctuation of channel dynamic range and rate, and so enhance the multiuser diversity gain and fairness in the content of multiuser scheduling. In this thesis, we further improve the system performance by employing multiple antennas at the receivers. Additional spatial diversity gain can then be provided. System throughput, waiting time and fairness are all enhanced, and the amount of feedback information is kept the same as that of the conventional opportunistic beamforming. We show that even with smaller number of users, slower changing rate of the beamforming weights, or less fluctuated channels, the same system capacity can be kept by the proposed scheme. All these help to obtain the multiuser diversity gain more effectively. On the other hand, with the channel prediction mechanism, we demonstrate that pre-scheduling can be used to further improve the system capacity of the proposed scheme. The waiting time and fairness performance can be enhanced as well provided that accurate channel-prediction information is available.

誌謝 I
中文摘要 II
英文摘要 III
目錄 IV
圖目錄 V
表目錄 VII
第一章 緒論 1
第二章 通道衰落概述與模擬建立 3
2.1 小尺度衰落 4
2.2 中上通道概述與模擬 5
第三章 多用戶分集與排程機制 10
3.1 多用戶分集（Multiuser diversity） 10
3.2 排程機制（Scheduling Scheme） 11
3.3 機會波束形成 17
第四章 改進式機會波束形成 26
4.1 機會波束形成與空間分集之結合 26
4.2 改進式機會波束形成於中上通道下之模擬 32
4.3 改進式機會波束形成之權值改變速度模擬 35
4.3 預正比公平排程與改進式機會波束形成 39
第五章 結論與未來研究方向 50
參考文獻 51

[1] R. Knopp and P. Humblet, “Information capacity and power control in single-cell multi-user communications,” IEEE Int. Conf. Comm. (ICC '95 ), pp.18-22, June 1995.
[2] P. Viswanath, D. Tse and R. Laroia ,“Opportunistic beamforming using dumb antennas,” IEEE Trans. Info. Theory, vol. 48, pp.1277 – 1294, June 2002.
[3] S. Shakkottai, T. S. Rappaport and P. C. Karlsson,“ Cross - layer design for wireless networks,” IEEE, Communications Magazine, pp. 74–80, 2003.
[4] A. Duel-Hallen, S. Hu, and H. Hallen, “Long-range prediction of fading signals,” IEEE Signal Processing Mag., vol. 17, pp. 62–75, 2000.
[5] R. Vaughan, P. Teal, and R. Raich, “Short-term mobile channel prediction using discrete scatterer propagation model and subspace signal processing algori- thms,” in Proc. VTS 2000, Boston, MA, pp. 751–758., Sept. 2000.
[6] T. Ekman, “Prediction of mobile radio channels, modeling and design,” Ph.D. dissertation, Uppsala University, Sweden, 2002. [Online]. Available: http://www.signal.uu.se/Publications/abstracts/a023.html
[7] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge Un- iversity Press, June 2005.
[8] M. Nakagami, The m-distribution: A general formula of intensity distribution of rapid fading, in Statistical Methods in Radio Wave 103 Propagation, W. G. Hoffman, Ed. Oxford, U.K. Pergamon, 1960.
[9] J. G. Proakis, Digital Communications, 4rd ed. New York: McGraw-Hill, 2001.
[10] C. Cheng, A Nakagaim-m fading channel simulator, M. Sc. thesis, Dept. Elect. Comp. Eng., Queen’s Univ., Kingston, ON, Canada, 2000.
[11] N. C. Beaulieu and C. Cheng, “Efficient Nakagami-m fading channel Simula- tion,” IEEE Trans. Veh. Technol, vol.54, pp.413 – 424, March 2005.
[12] C. Hastings, Approximations for Digital Computers. Princeton, NJ:Princeton Univ. Press, 1955.
[13] C. Hastings, “Rational approximation in high-speed computing,” in Proc. Com- putation Seminar, International Business Machines Corporation, pp.57–61, Dec.1949.
[14] L. C. Wang and M. C. Chen, “ Comparisons of link-adaptation-based schedul- ing algorithms for the WCDMA system with high-speed downlink packet access,” Electrical and Computer Engineering, Vol. 29, pp.109 – 116, April 2004.
[15] R. C. Elliott and W. A. Krzymien, “Scheduling algorithms for high-throughput packet data service in cellular radio systems,” Electrical and Computer Engineer- ing, Vol. 29, pp.117 – 127, April 2004.

[16] J. M. Holtzman, Q. Inc and C. A. San Diego, “Asymptotic analysis of propor- tional fair algorithm,” Personal, Indoor and Mobile Radio Communications (IEEE PIMRC) . vol.2, pp.F-33 - F-37, Oct. 2001.
[17] S. Shakkottai and A. L. Stolyar, “Scheduling algorithms for a mixture of real-time and non-real-time data in HDR,” in Proc. 17th Int. Teletraffic Congress (ITC-17), Sept. 2001.
[18] S. Shakkottai and A. Stolyar, “Scheduling for Multiple flows Sharing a Time -Varying Channel: The Exponential Rule, ” American Mathematical Society Translations, Series 2, A volume in memory of F. Karpelevich, Yu. M. Suhov, Editor, Vol. 207, 2002.
[19] R. Jain, The art of computer systems performance analysis, Wiley- Interscience, New York , NY, April 1991.
[20] R. Laroia, Li. Junyi, S. Rangan and M. Srinivasan, “Enhanced opportunistic beam- forming, ” Veh. Technol. Conf., 2003. VTC 2003-Fall. Vol. 3, pp.1762 – 1766, Oct. 2003.
[21] D. G.. Brennan, “ Linear diversity combining technique,” Proceeding of the RE, vol.47, pp.1075–1102, June 1959.
[22] H. J. Bang, T. Ekman and D. Gesbert, “Channel predictive proportional fair sche- duling,” IEEE Trans. Wireless Commun., vol.7, pp.482–487, February 2008.
[23] S. Haykin, Adaptive Filter Theory, Prentice - Hall, Englewood Cliffs, 1986.