基於髒紙編碼下多輸入多輸出下鏈通訊的總傳輸率與公平性之權衡

Sum RateFairness Tradeoff of MIMO Downlink Communications Based on Dirty Paper Coding

蔡秉叡(Ping-Jui Tsai)

指導教授 ： 陸曉峯

國立交通大學/電機學院/電信工程系所/碩士(2020年)

摘要

基於最近提出的公平性測度名為L1距離測度，本文提供了在多天線下鏈通訊中，可達到的總傳輸率與公平性之間的權衡。對於多天線廣播通道，我們介紹了兩種編碼方案，分別是髒紙編碼方案以及連續迫零髒紙編碼方案。我們提供了一個演算法來找到髒紙編碼方案下可達到的權衡曲線，並且與連續迫零髒紙編碼方案下最佳權衡曲線比較。模擬結果顯示，髒紙編碼方案下可達到的權衡優於連續迫零髒紙編碼方案的最佳權衡。

關鍵字

髒紙編碼 ； 公平性 ； 下鏈通訊 ； 多輸入多輸出

並列摘要

Based on a recently proposed L1-distance fairness measure, an achievable tradeoff between sum rate and fairness of multiple-input multiple-output (MIMO) downlink communications is provided in this thesis. Two communication schemes for MIMO broadcast channel (BC), the dirty paper coding (DPC) scheme and successive zero-forcing DPC (SZFDPC) scheme, are considered in this thesis. We propose an algorithm to find the achievable tradeoff of DPC scheme, and compare it to the optimal tradeoff of SZFDPC scheme. Simulation results show that the DPC scheme has a better sum rate-fairness tradeoff performance than SZFDPC.

並列關鍵字

DPC ； fairness ； downlink ； MIMO

參考文獻

[1] M. H. M. Costa, “Writing on dirty paper,” IEEE Tran. Inf. Theory, vol. 29, no. 3, pp. 439–441, May 1983.

[2] N. Jindal, S. Vishwanath, and A. Goldsmith, “On the duality of Gaussian multiple-access and broadcast channels,” IEEE Tran. Inf. Theory, vol. 50, no. 5, pp. 768–783, May 2004.

[3] S. Vishwanath, N. Jindal, and A. Goldsmith, “Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels,” IEEE Tran. Inf. Theory, vol. 49, no. 10, pp. 2658–2668, Oct. 2003.

[4] H. Weingarten, Y. Steinberg, and S. Shamai, “The capacity region of the Gaussian multiple-input multiple-output broadcast channel,” IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3936–3964, Sept. 2006.

[5] N. Jindal, S. A. J. W. Rhee, S. Vishwanath, and A. Goldsmith, “Sum power iterative water-filling for multi-antenna Gaussian broadcast channels,” IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1570–1580, Apr. 2005.