本篇論文主要在所有傳輸端皆了解通道狀態資訊下， 提供多輸入多輸出、放大前送中繼策略的多跳傳輸系統，其系統容量的漸進式分析。雖然我們在漸進式的分析裡，主要假設所使用的天線數目非常多，但在模擬結果裡卻可看到當天線數目很小時也可得到令人滿意的準確度。並與現行論文的結果比較起來，我們所提出的演算法精確度高出許多。緊接著我們利用此漸進式在不同需求的功\率分配策略下， 將其問題轉化為幾何規劃問題來求得最佳解。在功率分配策略方面，我們主要提供: (i) 在單一使用者環境裡，降低每個傳輸節點所需功率。(ii) 在單一使用者環境裡，將系統容量提升至最大。(iii) 在多使用者環境裡,，降低所有使用者所需功率。若是在有限的功\率環境下， 並無法滿足所有使用者的需求。故我們也提供了允許控制機制與功\率分配策略相結合的問題。但此結合問題在求解上難度太高, 因此我們也制定一套演算法來降低其複雜度並獲得良好的結果。

With perfect channel state information at all the transmission terminals, the asymptotic capacity of multi-hop multiple-input multiple-output(MIMO) amplify-andforward(AF) relay channels is derived. Although the derivation is based on the assumption of a large number of antennas, simulation results show that the derived expression is surprisingly accurate for even a small number of antennas, and may even be superior to existing results. In addition, based on the asymptotic result, we present different power allocation schemes to (i) minimization the transmit power; (ii) maximization the network throughput; (iii) minimization the transmit power over all source. Fortunately, the proposed power allocation problems can be formulated using geometric programming(GP). Therefore, the optimal power distribution among the multi-hop relay can be obtained efficiently. For multiuser scenarios, since it is possible that the QoS of each user cannot be satisfied simultaneously, we study jointly admission control and power allocation optimization problem. This joint problem is NP-hard. Therefor, we propose an iterative algorithm to reduced the complexity.

摘要i
Abstract ii
目錄iii
圖次v
表次vi
1 緒論1
1.1 背景以及動機. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 論文組織介紹. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
2 基本技術概要3
2.1 中繼站技術概念. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 幾何規劃問題. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3 系統模型7
4 系統容量近似解分析10
5 功率分配16
5.1 單一使用者環境. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
5.1.1 降低每個傳輸節點的功率. . . . . . . . . . . . . . . . . . . . . 17
5.1.2 提升系統容量. . . . . . . . . . . . . . . . . . . . . . . . . . . 18
5.2 多使用者環境. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
5.2.1 降低訊號端所需功率. . . . . . . . . . . . . . . . . . . . . . . . 22
5.2.2 於允許控制機制下降低訊號端所需功\率. . . . . . . . . . . . . . 23
6 模擬結果27
6.1 漸進式模擬分析. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.2 模擬單一使用者環境下最佳化降低每個節點的使用功率. . . . . . . . . . 29
6.3 模擬單一使用者環境下最佳化提升系統容量問題. . . . . . . . . . . . . . 29
6.4 模擬多使用者環境下降低訊號端所需功率. . . . . . . . . . . . . . . . . 31
6.5 模擬允許控制機制下降低訊號端所需功\率. . . . . . . . . . . . . . . . . 35
7 結論38
參考文獻39
中英對照表39

[1] R. Yue and H. Yingbo, “Optimality of diagonalization of multi-hop mimo relays,” IEEE Trans. Wireless Commun., vol. 8, no. 12, pp. 6068–6077, 2009.
[2] N. Fawaz, K. Zarifi, M. Debbah, and D. Gesbert, “Asymptotic capacity and optimal precoding in mimo multi-hop relay networks,” IEEE Trans. Info., vol. 57, no. 4, pp. 2050–2069, 2011.
[3] S.-P. Yeh and O. Leveque, “Asymptotic capacity of multi-level amplify-andforward relay networks,” in Information Theory, 2007. ISIT 2007. IEEE International Symposium on, 2007, pp. 1436–1440.
[4] R. Yue, T. Xiaojun, and H. Yingbo, “A unified framework for optimizing linear nonregenerative multicarrier mimo relay communication systems,” IEEE Trans. SignSignal Processing., vol. 57, no. 12, pp. 4837–4851, 2009.
[5] S. Geman, “A limit theorem for the norm of random matrices,” The Annals of Probability, vol. 8, no. 2, pp. 252–261, 1980.
[6] A. F. Karr, Probability, ser. Springer texts in statistics. New York: Springer, 1993, alan F. Karr.
[7] S. Govindasamy, D. Bliss, and D. Staelin, “Asymptotic spectral efficiency of multi-antenna links in wireless networks with limited tx csi,” Arxiv preprint arXiv:1009.4128, 2010.
[8] Z. Bai, “Methodologies in spectral analysis of large-dimensional random matrices, a review,” Statist. Sinica, vol. 9, no. 3, pp. 611–677, 1999.
[9] E. Matskani, N. Sidiropoulos, L. Zhi-quan, and L. Tassiulas, “Convex approximation techniques for joint multiuser downlink beamforming and admission control,” IEEE Trans. Wireless Commun., vol. 7, no. 7, pp. 2682– 2693, 2008.
[10] K. T. Phan, L.-N. Tho, S. A. Vorobyov, and C. Tellambura, “Power allocation in wireless multi-user relay networks,” IEEE Trans. Wireless Commun., vol. 8, no. 5, pp. 2535–2545, 2009.
[11] M. Grant and S. Boyd, “Cvx: Matlab software for disciplined convex programming (web page and software),” http://cvxr.com/cvx/, 2009.
[12] L. Kyoung-Jae, K. Jin-Sung, G. Caire, and L. Inkyu, “Asymptotic ergodic capacity analysis for mimo amplify-and-forward relay networks,” IEEE Trans. Wireless Commun., vol. 9, no. 9, pp. 2712–2717, 2010.
[13] S. P. Boyd and L. Vandenberghe, Convex optimization. Cambridge, UK ; New York: Cambridge University Press, 2004, 2003063284 Stephen Boyd, Lieven Vandenberghe. ill. ; 26 cm. Includes bibliographical references (p. [685]-696) and index.
[14] S. Peters, A. Panah, K. Truong, and R. Heath, “Relay architectures for 3gpp lte-advanced,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, pp. 1–14, 2009.