Robust Code Design over Fast Fading Channels

Abstract

西元2002年史克蘭等研究者提出結合通道編碼、通道估計和錯誤更正的非線性區塊編碼，並證實可以增進系統效能[10]；但編碼方式是以電腦搜尋得到，此種結構在解調時效率不高。而在西元2007年，吳佳龍等研究者提出具有規則的區塊編碼，其效能與電腦搜尋的編碼幾近相同，但編碼的效率大為提高[13]。在本論文中，將利用規則建立的自正交編碼概念，延伸使用在快速衰減通道下，在分析模擬中並採用一階高斯馬可夫通道作為在傳送區塊內衰減係數改變的模型，驗證所設計的編碼，不論是特定快速衰減通道下，或是在半穩態衰減通道下傳送，均有不錯的效能。

Nonlinear block codes that combine channel estimation, channel equalization and error protection have recently been proposed and confirmed their improvement in system performance by Skoglund et al in 2002 [10]. The design of Skoglund et al block codes, however, is based on computer search, and thus, has no efficient structure for decoding. In 2007, Wu et al have proposed a rule-constructed structural block code, and shown that the code has comparable performance to the computer-searched non-linear code of equal rate [13]. In this thesis, we extend the concept of rule-constructed self-orthogonal code design from the quasi-static fading channel to the non-static fading channel. We then examine the performance of our extension code over the first-order Gauss-Markov fading channel, and found that our extension code performs well not only in the target fast fading channel but also in the quasi-static fading channel.