多重存取萊斯衰減通道之通道容量分析

Capacity Analysis of Multiple-Access Rician Fading Channel

林谷嶸(Gu-Rong Lin)

指導教授 ： 莫詩台方

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

https://doi.org/10.6842/NCTU.2009.00309

摘要

本篇論文中探討的是非同調多重存取萊斯衰減通道的通道容量。在此通道中，所傳送的訊號會遭遇相加高斯雜訊以及萊斯衰減；也就是說，此衰減通道程序為高斯分佈並且有一個可目視的路徑成分。在傳送端使用者之間不允許相互合作通訊，因此各使用者假設在統計特性上獨立。

我們的任務是根據已知的單使用者衰減通道的漸進通道容量，推廣到多使用者多重存取的總通道容量。我們只探討單一天線的情況：所有傳送端的使用者及接收端都僅使用單一天線。如果使用者間的獨立限制被放寬，我們可以得到自然的通道容量上限，也就是多傳送天線單一接收天線的通道容量。而如果只有一個使用者傳送其餘皆不傳送，我們可以得到通道容量的下限，也就是單傳送天線單接收天線的通道容量。我們在本論文中改善此上下限，並且得到此通道的確切漸進通道容量。

在本論文中用到的主要概念是輸入信號的機率分佈逃脫到無限，意思是當可用的功率趨近無限大時，輸入信號也要使用隨之趨近無限大的符號。我們提出在多重存取衰減通道中，至少要有一個使用者使用輸入信號分佈逃脫到無限。由此我們得到的結果是此漸進總通道容量等於之前所提的下限：也就是單使用者單傳送天線單接收天線的通道容量。我們推斷出在多重存取的系統中，為了得到最佳的總通道容量，我們必須停止擁有較差通道的使用者傳送，並且只允許有最好通道的使用者傳送。

關鍵字

通道容量 ； 多使用者 ； 多重存取 ； 萊斯衰減通道 ； 消息理論

並列摘要

In this thesis the channel capacity of the noncoherent multiple-access Rician fading channel is investigated. In this channel, the transmitted signal is subject to additive Gaussian noise and Rician fading, i.e., the fading process is Gaussian in addition to a line-of-sight component. On the transmitter side the cooperation between users is not allowed, i.e., the users are assumed to be statistically independent.

Based on the known result of the asymptotic capacity of a single-user fading channel, our work is to generalize it to the multiple-user sum-rate capacity. We study the single-antenna case only: all transmitters and the receiver use one antenna. We get a natural upper bound on the capacity if the constraint of independence between the users is relaxed, in which case the channel becomes a multiple-input single-output (MISO) channel. Also, a lower bound can be obtained if all users apart from one are switched off, which corresponds to a single-input single-output (SISO) channel. We improve these bounds and get an exact formula of the asymptotic capacity.

The main concept we use in this thesis is escaping to infinity of input distributions, which means that when the available power tends to infinity, the input must use symbols that also tend to infinity. We propose that in the multiple-access fading channel, at least one user's distribution must escape to infinity. Based on this we obtain the result that the asymptotic sum-rate capacity is identical to the previously mentioned lower bound: the single-user SISO capacity. We conclude that in order to achieve the best sum-rate capacity in the multiple-access system, we have to switch off the users with bad channels and only allow those with the best channel to transmit.

並列關鍵字

Channel Capacity ； Multiple-Access Channel ； Rician Fading ； Information Theory

參考文獻

[1] C. E. Shannon, “A mathematical theory of communication,” Bel l System Technical Journal, vol. 27, pp. 379–423 and 623–656, July and October 1948.

[2] A. Lapidoth and S. M. Moser, “Capacity bounds via duality with applications to multiple-antenna systems on flat fading channels,” IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2426–2467, October 2003.

[3] S. M. Moser, “Duality-based bounds on channel capacity,” Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, October 2004, Diss. ETH No. 15769.

[Online]. Available: http://moser.cm.nctu.edu.tw/

[4] ——, “The fading number of memoryless multiple-input multiple-output fading channels,” IEEE Transactions on Information Theory, vol. 53, no. 7, pp. 2652–2666, July 2007.