Full metadata record
DC FieldValueLanguage
dc.contributor.author徐信琪en_US
dc.contributor.authorHsin-chi Hsuen_US
dc.contributor.author陳伯寧en_US
dc.contributor.authorPo-Ning Chenen_US
dc.date.accessioned2014-12-12T02:23:30Z-
dc.date.available2014-12-12T02:23:30Z-
dc.date.issued1999en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT880435034en_US
dc.identifier.urihttp://hdl.handle.net/11536/65870-
dc.description.abstract在本論文中,我們使用MLSDA這個以code-tree為基礎的演算法來做渦輪碼(turbo code)的解碼。不像在[3]裡面所用到的疊代式解碼演算法(iterative decoding algorithm)是一個次於理想的解碼演算法,對於渦輪碼的解碼來說,MLSDA是最大概度(maximum-likelihood)的演算法。我們以這個新的最大概度演算法來對長度短的渦輪碼做”error floor”現象[3]的研究。令人驚訝的是,”error floor”現象是起因於疊代式解碼演算法而不是碼的頻譜(code spectrum)本身。另外從模擬的結果也得知,疊代式解碼演算法在長度短的渦輪碼會有很差的表現。zh_TW
dc.description.abstractIn this thesis, we apply a code-tree based algorithm (MLSDA) proposed in [1] to the decoding of turbo codes. Unlike the iterative decoding algorithm proposed in [3], which is a suboptimal decoding algorithm, the MLSDA turns out to be a maximum-likelihood decoding algorithm for turbo codes. We also investigate the error floor phenomenon [2] for short turbo codes based on the new ML decoding algorithm. Surprisingly, the error floor phenomenon for the code is resulted by the iterative decoding algorithm not the distance spectrum of the code itself. By the simulation results, the iterative decoding algorithm proposed originally performs badly on these short turbo codes.en_US
dc.language.isoen_USen_US
dc.subject渦輪碼zh_TW
dc.subjectturbo codeen_US
dc.subjectparallel concatenated convolutional codeen_US
dc.subjecterror flooren_US
dc.subjectmaximum-likelihooden_US
dc.subjectturbo codesen_US
dc.subjectdecoding algorithmen_US
dc.title平行串接迴旋碼之最大概度解碼演算法zh_TW
dc.titleA Maximum-Likelihood Decoding Algorithm for Parallel Concatenated Convoltional Codeen_US
dc.typeThesisen_US
dc.contributor.department電信工程研究所zh_TW
Appears in Collections:Thesis