跳到主要內容

臺灣博碩士論文加值系統

(44.192.22.242) 您好!臺灣時間:2021/08/01 11:57
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:謝佩娟
研究生(外文):Pei-Chuan Hsieh
論文名稱:適用於多使用者多輸入多輸出系統的低複雜度線性使用者配對
論文名稱(外文):Low-Complexity Linear User Pairing Strategies for Downlink Multi-User MIMO Systems
指導教授:邱茂清邱茂清引用關係
指導教授(外文):Mao-Ching Chiu
口試委員:邱茂清沈文和陳喬恩劉維正李昌明
口試委員(外文):Mao-Ching ChiuWern-Ho SheenChiao-En ChenWei-Cheng LiuChang-Ming Lee
口試日期:2012-07-20
學位類別:碩士
校院名稱:國立中正大學
系所名稱:通訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:49
外文關鍵詞:MU-MIMOuser pairngpercoding
相關次數:
  • 被引用被引用:0
  • 點閱點閱:303
  • 評分評分:
  • 下載下載:1
  • 收藏至我的研究室書目清單書目收藏:0
在多名使用者採用多輸入多輸出( Multi-User Multi-Input-Multi-Output , MU-MIMO )無線通訊系統中,適當配對策略可以有效利用有限的頻寬來增進系統吞吐量。MU-MIMO系統欲達到最大限度資料吞吐量是一個使用者組合最佳化問題。每組合之使用者要找到最佳化的預編碼矩陣以達到最大限度的資料吞吐量是一個NP-hard問題。因此我們嘗試設計低複雜度的配對演算法希望可以快速為使用者進行配對,找出適當的組合合作。本論文中我們提出兩個複雜度較低的使用者配對方法,而兩種方法皆採用線性搜索降低複雜度。其一為最小均方根誤差( Minium Mean Square Error , MMSE )配對演算法。此演算法使用MMSE估測器概念來找尋被干擾影響最小的使用者,但此方法仍需在配對前進行預編碼矩陣的計算。另一個配對方法為軌跡( Trace )配對演算法。此方法只與通道狀態資訊( Channel State Information , CSI )的特徵值( Eigenvalue )有關,所以在配對之前無須計算預編碼矩陣以降低複雜度計算。根據模擬結果顯示,此兩種配對方法都可降低複雜度且仍達到不錯的效能。
In a multi-user multiple-input and multiple-output (MU-MIMO) wireless communication system, proper pairing schemes can facilitate the efficient of using radio resource and significantly improve the throughput of the system. However, for MU-MIMO systems, trying to maximum the sum rate is a combinatorial optimization problem and finding the optimal precoding matrix which maximizes the sum rate is an NP-hard problem for each user combination. Thus, we attempt to design low-complexity algorithms that can schedule users more quickly to share the same radio resource. In this paper, we propose two low-complexity user pairing algorithms with sequential search for the MU-MIMO downlink scenario. The first one is based on MMSE criterion to find the minor interference of each user. The second one is the trace user pairing algorithm which is based on eigenvalues of channel state information with regard of precoding matrices. According to the simulation results, the proposed algorithms can reach good performance and, however, have much lower complexity than the eigenvalue pairing algorithm.
致謝 i
中文摘要 ii
英文摘要 iii
目錄 iv
圖目錄 vi
表目錄 vii
第一章 導論 1
1.1 背景 1
1.2 論文架構 3
第二章 系統模型 5
2.1 MIMO系統模型 5
2.2 MU-MIMO系統模型 6
第三章 預編碼矩陣 9
3.1 簡介 9
3.2 強制零( Zero-Forcing , ZF )預編碼 9
3.3 聯合洩漏壓抑( Joint Leakage Suppression , JLS )預編碼 11
第四章 使用者配對演算法 15
4.1 問題表述 15
4.2 和率配對法與正交投影配對法 16
4.2.1 和率( Sum Rate )配對演算法 16
4.2.2正交投影配對演算法 17
4.3-軌跡( Trace )配對演算法 21
4.4 最小均方根誤差( Minium Mean Square Error , MMSE )配對演算法 25
第五章 電腦模擬與分析 31
第六章 結論 38
參考文獻 39

[1] Z. Pan, K. K. Wong, and T. S. Ng, “Generalized Multiuser Orthogonal Space-Division Multiplexing”, pp.1967-1973, Nov. 2004.
[2] H. Weingarten, Y. Sternberg, and S. Shamai(Shitz), “The capacity region of the Gaussian MIMO broadcast channel”, Proc. IEEE Int. Symp. Informaiton theory, pp. 174, Jun. 2004.
[3] Q. H. Spencer, A. L. Swindlehurst, and M. Haardt, “Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels", IEEE Trans. on Signal Processing, vol.52, no. 2, pp.461-471, Feb. 2004.
[4] H. Zhang, N. B. Mehta, A. F. Molisch, J. Zhang and H. Dai “Asynchronous Interfrence Mitigation in Cooperative Base Station Systems”, IEEE Transactions on Wireless Communications, vol. 7, no. 1, pp. 155-165. Jan. 2008.
[5] Ya-Feng Liu, Yu-Hong Dai and Zhi-Quan Luo, “On the complexity of optimal coordinated downlink beamforming”, 2010 IEEE International conference on Acoustics Speech and Signal Processing (ICASSP), vol., no., pp.3274-3277, 14-19 Mar. 2010.
[6] T. Yoo and A. Goldsmith, “On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming”, IEEE Journal on Selected Areas in Commun., vol.24, no.3, pp.528-541, Mar. 2006.
[7] G. Dimic and N. D. Sidiropoulos, “On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm”, IEEE Trans. on Signal Processing, vol.53, no.10, pp.3857-3868, Oct. 2005.
[8] T. Ji, C. Zhou, S. Zhou, Y. Yao, “Low complex user selection strategies for multi-user MIMO downlink scenario”, in Proc. IEEE Wireless Communications and Networking Conference (WCNC’07), pp. 1534-1539, Mar. 2007.
[9] Z. Shen, R. Chen, J. G. Andrews, R.W. Heath, B.L. Evans, “Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization”, IEEE Trans. on Signal Processing, vol.54, no.9, pp.3658-3663, Sep. 2006.
[10] C. Lv, S. Zhou, Y. Li, and T. Wang, “Low Complexity Scheduling Technique for Multi-User MIMO Systems”, Vehicular Technology Conference, 2008. VTC Spring, 2008. IEEE, vol., no., pp.1345-1349, 11-14 May 2008.
[11] S. Sigdel and W. A. Krzymie´n, “Simplified fair scheduling and antenna selection algorithms for Multiuser MIMO orthogonal space-division multiplexing downlink”, IEEE Transations on Vehicular Technology, vol.58, no.3, pp. 1329-1344,Mar. 2009.
[12] Y. H. Zeng, P. Shang , G. X. Zhu, and W. M. Wu, “Multiuser scheduling with orthogonal space-division multiplexing”, Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on, Sep. 2010.
[13] J. S. Kim, K. J. Lee, and Inkyu Lee ,” Low Complexity Joint User and Mode Selection Algorithmfor Multiuser MIMO Downlink Systems”, Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE, Dec. 2010.
[14] S. Yang, “ Low complexity user paring strategies for downlink Multi-User MIMO systems ”, Master thesis , National Chung Cheng University , R.O.C ,Jul. 2011.
[15] S. M. Kay, “Fundamentals of statistical signal processing: estimation theory” ,U.S.A, Rhode Island University, 1993.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top