跳到主要內容

臺灣博碩士論文加值系統

(216.73.217.99) 您好!臺灣時間:2026/11/05 23:54
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:郭沅竹
研究生(外文):Guo, Yuan-Zhu
論文名稱:單輸入多輸出回饋記憶型衰減通道之漸進通道容量
論文名稱(外文):The Asymptotic Capacity of Noncoherent Single-Input Multiple-Output Fading Channels with Memory and Feedback
指導教授:莫詩台方、陳伯寧
指導教授(外文):Stefan M. Moser、Po-Ning Chen
學位類別:碩士
校院名稱:國立交通大學
系所名稱:電信工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2013
畢業學年度:101
語文別:英文
論文頁數:49
中文關鍵詞:率減數、回授、衰減通道、漸進通道容量、單輸入多輸出
外文關鍵詞:fading number、feedback、fading channel、asymptotic capacity、single-input multiple-output
相關次數:
  • 被引用被引用:0
  • 點閱點閱:268
  • 評分評分:
  • 下載下載:5
  • 收藏至我的研究室書目清單書目收藏:0
在本篇論文中,我們針對一個廣義非同調規律、單輸入多輸出、 且具有迴授系統的記憶性衰減通道,作漸近通道容量(asymptotic channel capacity)的探討。我們假設通道的衰減過程可以是任意地 穩定態且均勻遍歷(ergodic)的隨機過程,同時此隨機過程的能量與 微分熵量比率(differential entropy rate)皆是有限的。而對於迴授系 統的通道部份,則假設其是無任何雜訊影響的,即有無限的通道容 量,但是具有因果關係的(causal)。

研究結果顯示,具有迴授系統的漸近通道容量依然隨著能量呈雙 對數(double-logarithmically) 的速度成長。此外,我們也證明,在漸 進通道容量展開式中的第二項,通稱為衰衰減數(fading number),與 沒有迴授系統時,兩者的衰減數是一樣的。
In this thesis, the channel capacity of a general noncoherent regular single-input multiple-output fading channel with memory and with feedback is investigated. The fading process is assumed to be a general stationary and ergodic random process of finite energy and finite differential entropy rate. The feedback is assumed to be noisefree (i.e., it is of infinite capacity), but causal.

We show that the asymptotic capacity grows double-logarithmically in the power and that the second term in the asymptotic expansion, the fading number, is un- changed with respect to the same channel without feedback.
Chinese Abstract I
Abstract I
Acknowledgments II
1 Introduction 1
2 Channel Model 3
3 Mathematical Preliminaries 5
3.1 Differential Entropy ............................... 5
3.1.1 h+(X)................................... 5
3.1.2 hλ(·).................................... 5
3.1.3 Differential Entropy and Expectation of Logarithms . . . . . . . . . . 6
3.2 Markov’s Inequality ............................... 6
3.3 CausalInterpretation............................... 7
4 Capacity and Fading Number without Feedback 9
5 Capacity and Fading Number with Feedback 11
6 Proof of Theorem 5.4 16
6.1 Main Line Through the Proof.......................... 16
6.2 Detailed Derivations forThreeTerms in(6.24) . . . . . . . . . . . . . . . . 29
6.2.1 FirstTerm ................................ 29
6.2.2 SecondTerm ............................... 30
6.2.3 ThirdTerm................................ 30
7 Discussion and Conclusion 34
A Upper Bound (6.46) 35
B Upper Bound (6.81) 38
C Upper Bounds (6.97) and (6.102) 42
C.1 δ1(κ,ξmin)..................................... 42
C.2 δ2(κ,ξmin)..................................... 44
D Causal Interpretations for Independence 46
Bibliography 48
[1] I ̇. E. Telatar, “Capacity of multi-antenna Gaussian channels,” European Transactions on Telecommunications, vol. 10, no. 6, pp. 585–595, November–December 1999.
[2] G. Durisi, U. G. Schuster, H. Bo ̈lcskei, and S. Shamai (Shitz), “Noncoherent capacity of underspread fading channels,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 367–395, January 2010.
[3] T. L. Marzetta and B. M. Hochwald, “Capacity of a mobile multiple-antenna com- munication link in Rayleigh flat fading,” IEEE Transactions on Information Theory, vol. 45, no. 1, pp. 139–157, January 1999.
[4] L. Zheng and D. N. C. Tse, “Communicating on the Grassmann manifold: a geomet- ric approach to the non coherent multiple-antenna channel,” IEEE Transactions on Information Theory, vol. 48, no. 2, pp. 359–383, February 2002.
[5] Y. Liang and V. V. Veeravalli, “Capacity of noncoherent time-selective Rayleigh- fading channels,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3095–3110, December 2004.
[6] T. Koch and A. Lapidoth, “Degrees of freedom in non-coherent stationary MIMO fading channels,” in Proceedings Winter School on Coding and Information Theory, Bratislava, Slovakia, February 20–25, 2005, pp. 91–97.
[7] ——, “The fading number and degrees of freedom in non-coherent MIMO fading chan- nels: a peace pipe,” in Proceedings IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, September 4–9, 2005, pp. 661–665.
[8] 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.
[9] S. M. Moser, “The fading number of multiple-input multiple-output fading channels with memory,” IEEE Transactions on Information Theory, vol. 55, no. 6, pp. 2716– 2755, June 2009.
[10] ——, “Duality-based bounds on channel capacity,” Ph.D. dissertation, ETH Zurich, October 2004, Diss. ETH No. 15769. [Online]. Available: http://moser.cm.nctu.edu. tw/publications.html
[11] R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1962.
[12] J. L. Massey, “Causal interpretations of random variables,” Problemy Peredachi Infor- matsii (Problems of Information Transmission), vol. 32, no. 1, pp. 131–136, January– March 1996.
[13] ——, “Correction to ‘Causal interpretations of random variables’,” Problemy Peredachi Informatsii (Problems of Information Transmission), May 16, 1997.
[14] R. L. Dobruˇsin, “General formulation of Shannon’s main theorem in information theory,” in Proceedings American Mathematical Society Translations, ser. 2, 1963, vol. 33, pp. 323–438.
[15] A. Lapidoth and S. M. Moser, “The fading number of single-input multiple-output fading channels with memory,” IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 437–453, February 2006.
[16] G.-R. Lin and S. M. Moser, “The fading number of a multiple-access Rician fading channel,” IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 4983–4991, August 2011.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top