請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22397
標題: | 改良式A*軟式線性區塊碼解碼器的設計與實作 Design and Implementation of a Soft Linear Block Code Decoder with a Modified A* algorithm |
作者: | Chao-Liang Tai 戴肇良 |
指導教授: | 林茂昭(Mao-Chao Lin) |
關鍵字: | 線性區塊碼,樹狀搜尋法, linear block code,A* algorithm,soft decoding, |
出版年 : | 2010 |
學位: | 碩士 |
摘要: | A*是一種樹狀搜尋法,常用來解圖形中的最短路徑,此種演算法評估各個分支與目標的度量,在搜尋的早期階段停止展開大量不適用的解,在短時間內找到最可能的解,達到增加效率的目的。A*解碼法目前已經被使用在線性區塊碼的最大相似解碼上,它可以減少搜索路徑,提高最大相似解碼的速度。本文提出一個改良的A*解碼法,與A*演算法原型比較,更可以有效的及早停止展開不適用的解。在VLSI中,此方法不僅解碼速度較快,錯誤率的表現較好,甚至複雜度也可以略微降低,本文將提出QR(80,40)的相關IC設計的架構,對於複雜度降低的部分加以佐證。 A* algorithm is a tree search algorithm, which is used to find the shortest path within a graph with branch and bound approach to determine the metric of each vertex in a tree. This algorithm estimates metrics between each vertex and target so that it can prune irrelevant vertexes in the early searching phase so as to find the most likely answer in a short period of time and achieve the goal of increasing efficiency. A* algorithm has been used to implement maximum-likelihood soft-decoding of linear block codes. It can minimize the search edges so as to improve the searching speed. This thesis proposes a modified A* algorithm. This algorithm can prune more irrelevant codeword in the early searching phase. Thus it is faster, has better BER performance, and even has lower complexity compare with A* algorithm. This thesis deals with the design and implementation of QR (80, 40) linear block code, and simulates this design to prove that our algorithm has lower complexity. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22397 |
全文授權: | 未授權 |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-99-1.pdf 目前未授權公開取用 | 2.27 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。