完整後設資料紀錄
DC 欄位語言
dc.contributor.author蔣名駿en_US
dc.contributor.authorMing-Chun Chiangen_US
dc.contributor.author陳伯寧en_US
dc.contributor.authorPo-Ning Chenen_US
dc.date.accessioned2014-12-12T02:29:16Z-
dc.date.available2014-12-12T02:29:16Z-
dc.date.issued2004en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009213503en_US
dc.identifier.urihttp://hdl.handle.net/11536/69434-
dc.description.abstract在此篇碩士論文中,我們針對隨時間改變衰減的高斯-馬可夫傳輸管道,作管道傳輸極限 (capacity) 的探討。首先,我們根據實際通訊系統的傳送端與接收端是否分別具有「頻道狀態資訊」 (channel state information),定義出四種不同的管道傳輸極限公式。接著,我們推導高斯-馬可夫傳輸管道下的管道輸出與輸入信號間的管道轉換機率 (channel transition probability) 公式。由於,在傳送端與接收端均無「頻道狀態資訊」的情況下,管道傳輸極限的計算相當困難,因此我們轉而探討其「獨立上界」 (independent bound)。我們導出在不同的管道記憶級數 (memory order) 下的獨立上界公式,並依公式計算出獨立上界的數值解加以討論。zh_TW
dc.description.abstractIn this thesis, we focus on the capacity for the time-varying Gauss-Markov fading channels. We first remark on four different definitions of channel capacities according to whether the transmitter and the receiver have or have not the channel state information (CSI). We then provide detailed derivations for the channel transition probability of the Gauss-Markov channels. As the true capacity formula for blind-CSI in both transmitter and receiver is hard to obtain, we derive its independent upper bound instead, and establish a close-form expression of the independent bound for any memory order $M$. Discussions are finally given by numerical evaluation of the independent bounds.en_US
dc.language.isoen_USen_US
dc.subject頻道容量zh_TW
dc.subject高斯-馬可夫zh_TW
dc.subjectchannel capacityen_US
dc.subjectGauss-Markoven_US
dc.title高斯-馬可夫衰減通道下雙極傳輸的管道傳輸極限上界zh_TW
dc.titleUpper Bounds of Channel Capacity for Bipolar Transmission Over Gauss-Markov Fading Channelen_US
dc.typeThesisen_US
dc.contributor.department電信工程研究所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 350301.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。