臺灣大學: 電信工程學研究所許大山陳孝賢Chen, Hsiao-HsienHsiao-HsienChen2013-03-272018-07-052013-03-272018-07-052010http://ntur.lib.ntu.edu.tw//handle/246246/253133在隨機禮物通道中，除了受雜訊影響的訊號外，接收端可以額外收到一些代表傳送訊息的資訊，我們把這些額外的資訊稱為禮物。那些禮物可以在根源位元或是編碼符號中隨機選出，我們把這兩種禮物稱為根源位元禮物(SBG)和編碼符號禮物(ESB)。在這篇論文當中，首先，我們會介紹這兩種隨機禮物通道的通道容量，比較兩種不同種類禮物的效果，然後提供在渦輪碼以及低密度奇偶校驗碼中進行模擬的結果，驗證這兩種錯誤更正碼在不改變編碼架構的情形下是否能夠適合這些禮物。此外，由於系統化編碼將會使得禮物的作用降低，我們也提供了限制於系統化編碼的通道容量來估計造成的影響。最後，我們提供一些可以運用隨機禮物通道概念的應用，並且分析其效果，這些應用包含了混合式自動要求重傳、上傳軟式交遞，以及渦輪碼和低密度奇偶校驗碼的最大相似邊界。In a random gift channel, in addition to the distorted channel signals, the destination can also receive some information regarding the sent message, which we refer as gifts. The information can be randomly selected from the source bits or encoding symbols, and we call those two types of gifts as source bit gift(SBG) and encoding symbol gift(ESG). Among this thesis, first, we prove the channel capacity of random gift channel with SBG and ESG, compare the performance of those two types of gift, and give the simulation result of turbo code and LDPC code to see whether they can perfectly fit the gift without changing the code structure. Next, since systematic codes will decrease the effect of gifts, we also provide the capacity of random gift channel restrict on systematic code to estimate the effect. Finally, we give some applications that can use the concept of random gift channel and analysis the performance, including hybrid-ARQ, soft handover and finding the maximum likelihood bound for turbo code and LDPC code.1306198 bytesapplication/pdfen-US禮物根源位元禮物編碼符號禮物隨機禮物通道通道容量限制於系統化編碼的通道容量渦輪碼低密度奇偶校驗碼混合式自動要求重傳上傳軟式交遞最大相似邊界giftsource bit giftencoding symbol giftrandom gift channelchannel capacitychannel capacity contrained on systematic codeturbo codeLDPC codehybrid-ARQuplink soft handoverMaximum likelihood boundthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/253133/1/ntu-99-R96942024-1.pdf