結合錯誤更正與通道估計的籬笆型編碼之設計

Abstract

針對結合錯誤更正與通道估計的樹狀結構碼，本篇論文提供一演算法將其壓成離笆型編碼以降低解碼複雜度。此演算法中，使用者可以透過設定離笆每階層節點數上限來控制壓縮程度。模擬顯示樹狀結構碼被壓縮越多，解碼時需越少的記憶體和越低的複雜度，但效能亦會越差。而使用者可以藉由適當地設定節點數上限而從中做取捨。

In this thesis, we attempt to decrease the decoding complexity of self-orthogonal tree-structure codes designed for combined channel estimation and error correction by fitting them into a trellis structure subject to an upper bound on the number of trellis states at each level. Specifically, we provide an algorithm to compress the tree-structure codes into a trellis structure by selectively merging tree nodes. Simulations show that the more the merged nodes, the less the memory consumption and decoding complexity, but the worse the performance. A trade-off among these factors can therefore be controlled by a proper choice of maximum number of trellis states.