Responsive image
博碩士論文 etd-0921116-124712 詳細資訊
Title page for etd-0921116-124712
論文名稱
Title
以期望傳播對多天線系統預編碼之研究
Study on Expectation Propagation Precoding for MIMO System
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
59
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2016-09-30
繳交日期
Date of Submission
2016-10-21
關鍵字
Keywords
預編碼、期望傳播演算法、功率峰均值比、大規模多天線系統、多輸入多輸出天線陣列
MIMO antenna array, large scale MIMO, precoding, expectation propagation, peak-to-average-power-ratio
統計
Statistics
本論文已被瀏覽 5663 次,被下載 34
The thesis/dissertation has been browsed 5663 times, has been downloaded 34 times.
中文摘要
近年來通訊技術不斷的提升,人們對於資料的傳輸速度及資料吞吐量的需求也隨之增加。因此常見的方法就是增加基地台與手機的天線數目,通常基地台設有數十至數百根天線來增加資料的吞吐量,但因為功率放大器的數量龐大,在硬體實現上必需考量成本,較低成本的功率放大器線性度不佳,無法處理高功率峰均值比 (Peak-to-Average-Power-Ratio, PAPR) 的系統。參考文獻中所提到的低功率峰均值預編碼可以解決這個問題,但因其使用的梯度下降演算法計算複雜度極高,大幅降低其求解的速度,本篇論文提出期望傳播演算法(Expectation Propagation, EP) 來求解,雖然比近似信息演算法 (Approximated Message Passing, AMP) 的複雜度高,但是能夠改良近似訊息演算法在常數封包預編碼效能較差的問題,而且相較於序列式梯度下降演算法,雖然有較高的運算複雜度,但能有超越序列式梯度下降演算法的效能,而使得期望傳播演算法相較於序列式梯度下降演算法在大規模多天線預編碼系統上有更好的效能表現。
Abstract
With growing applications in multimedia, we have increasing demand in the higher data transmission rate and the more effective data throughput. One way to meet this demand is to use the massive antenna technique where one base station is equipped with tens to hundreds antennas to increase data throughput. However, we have to consider the tradeoff between the cost and the effectiveness of power amplifiers. Low cost power amplifier has poor linearity and cannot deal with high peak-to-average-power-ratio (PAPR) systems. The low PAPR precoding such as the gradient descent algorithm (GD) and sequential gradient descent algorithm (SGD) were proposed to solve this problem, they have highly computational complexity and thus significantly reduce the speed of system. In this thesis, we use the expectation propagation (EP) algorithm to solve this problem. Although the EP algorithm is much more complicated than the approximated message passing (AMP) algorithm, it can improve the poor performance of the AMP algorithm as the constant envelope precoding is considered. Compared with the SGD algorithm, the EP algorithm has the higher computation complexity while with performance better than the SGD, making it a preference technique in the massive MIMO precoding system.
目次 Table of Contents
論文審定書 i
誌謝 ii
摘要 iii
Abstract iv
目錄 v
圖次 vi
表次 viii
第一章 緒論 1
1.1 前言及研究動機 1
1.2 論文架構 4
第二章 系統架構 5
2.1 多輸入多輸出系統架構 5
2.2 多天線常數封包預編碼系統 7
第三章 演算法 9
3.1 梯度下降法 (Gradient Descent) 9
3.2 序列式梯度下降法 (Sequentional Gradient Descent) 11
3.3 近似訊息演算法 (Approximate Message Passing) 14
3.4 期望傳播演算法 (Expectation Propagation) 24
第四章 模擬與結果分析 31
4.1 收斂情況分析 31
4.2 大規模多天線常數封包預編碼系統 39
4.3 小規模多天線常數封包預編碼系統 42
4.4 大規模多天線環形預編碼系統 45
第五章 結論 47
參考文獻 48
參考文獻 References
[1] F. Rusek, D.Persson, B.K. Lau, E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, ”Scaling up MIMO: opportunities and challenges with very large arrays,” IEEE Signal Process. Mag., vol. 30, no. 1, pp. 40-60, Jan. 2013.
[2] E. G. Larsson, O. Edfors, F. Tufvesson and T. L. Marzetta, ”Massive MIMO for next generation wireless systems,” IEEE Commun. Mag., vol. 52, no. 2, pp. 186-195, Feb. 2014.
[3] S. K. Mohammed and E. G. Larsson, ”Per-antenna constant envelope precoding for large multi-uer MIMO systems,” IEEE Trans. Commun., vol. 61, no. 3, pp. 1059-1071, Mar. 2013.
[4] S. K. Mohammed and E. G. Larsson, ”Constant-envelope multi-user precoding for frequency-selective massive MIMO systems,” IEEE Wireless Commun. Lett., vol. 2, no. 5, pp. 547-550, Oct. 2013.
[5] J. C. Chen, C. K. Wen and K. K. Wong, ”Improved constant envelope multiuser precoding for massive MIMO systems,” IEEE Commun. Lett., vol. 18, no. 8, pp. 1311-1314, Aug. 2014.
[6] J. Zhang, Y. Huang, J. Wang, B. Ottersten and L. Yang, ”Per-antenna constant envelope precoding and antenna subset selection: a geometric approach,” IEEE Trans. Signal Process, vol. 64, no. 23, pp. 6089-6104, Dec. 2016.
[7] S. Mukherjee and S. K. Mohammed, ”Constant-envelope precoding with time-variation constraint on the transmitted phase angles,” IEEE Wireless Commun. Lett., vol. 4, no. 2, pp. 221-224, Apr. 2015.
[8] J. Zhu, N. Wang and V. K. Bhargava, ”Per-antenna constant envelope precoding for secure transmission in large-scale MISO systems,” in IEEE/CIC International Conference on Communications in China (ICCC), Shenzhen, China, Nov. 2015, pp. 1-6.
[9] I. Iofedov and D. Wulich, ”On optimal precoding for MISO with nonlinear power amplifiers,” IEEE Wireless Commun. Lett., vol. 5, no. 3, pp. 240-243, Jun. 2016.
[10] J. Pan and W. K. Ma, ”Constant envelope precoding for single-user large-scale MISO channels: efficient precoding and optimal designs,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 982-995, Oct. 2014.
[11] S. Zhang, R. Zhang and T. J. Lim, ”Constant envelope precoding with adaptive receiver constellation in fading channel,” in 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA, Dec. 2015, pp. 1-6.
[12] J. C. Chen, C. J. Wang, K. K. Wong and C. K. Wen, ”Low-complexity precoding design for massive multiuser MIMO systems using approximate message passing,” IEEE Trans. Veh. Commun., vol. 65, no. 7, pp. 5707-5714, Jul. 2016.
[13] C. Mollén, ”Low-PAR precoding for very-large multi-user MIMO systems,” M.S thesis, Dept. Elect. Eng., Linköping Univ. Sweden, Linköping, Sweden, Jun. 2013.
[14] J. Céspedes, P. M. Olmos, M. Sánchez-Fernández and F. Perez-Cruz, ”Expectation propagation detection for high-order high-dimensional MIMO systems,” IEEE Trans Commun, vol. 62, no. 8, pp. 2840-2849, Aug. 2014.
[15] D. L. Donoho, A. Maleki, and A. Montanari, ”Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci., vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009.
[16] F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, ”Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices,” J. Stat. Mech. Theory Exp., vol. 2012, no. 8, Aug. 2012.
[17] F. R. Kschischang, B. J. Frey and H. A. Loeliger, ”Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code