請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22397
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 林茂昭(Mao-Chao Lin) | |
dc.contributor.author | Chao-Liang Tai | en |
dc.contributor.author | 戴肇良 | zh_TW |
dc.date.accessioned | 2021-06-08T04:16:55Z | - |
dc.date.copyright | 2010-08-02 | |
dc.date.issued | 2010 | |
dc.date.submitted | 2010-07-30 | |
dc.identifier.citation | [1] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo codes,” in Proc.1993 IEEE Int. Conf. on Communications Geneva, Switzerland, 1993, pp. 1064-1070.
[2] D. J. C. Mackay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996. [3] van Lint, J.; MacWilliams, F., “Generalized quadratic residue codes,” in Information Theory, IEEE Transactions on, Volume 24, Issue 6, Nov 1978 pp. 730-737. [4] Laura Ekroot and Sam Dolinar, “A* Decoding of Block Codes,” IEEE Transaction on Communication, vol.44, pp. 1052-1056, September 1996. [5] M. P. C. Fossorier and S. Lin, “Soft-Decision Decoding of Linear Block Codes based on Ordered Statistics,” IEEE Transaction on Information Theory, vol. 41, pp. 1379-1396, Sept. 1995. [6] D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Transaction on Information [7] S. Fragiacomo, C. Matrakidis, and J. O’Reilly, “Novel near maximum likelihood soft decision decoding algorithm for linear block codes,” Proc. Inst. Elect. Eng., pt. Comm., vol. 146, no. 5, pp. 265–270, Oct.1999. [8] Chia-Fu Chang and Mao-Chao Lin, “An Improved A* Algorithm for Decoding Linear Block Codes,” 2010 IEEE Wireless Communications and Networking Conference, Sydney, Australia, Apr. 2010 [9] R. M. Pyndiah, “Near-optimum decoding of product codes: Block turbo codes,” IEEE Trans. Comm., vol. 46, pp. 1003–1010, Aug. 1998. [10] Han. Y.S., Hartmann C.R.P., and Chih-Chieh Chen, “Efficient priority first search maximum-likelihood soft-decision decoding of linear block codes,” IEEE Transaction on Information Theory, vol. 39, pp. 1514-1523, September 1993. [11] Pierre Lavoie, Yvon Savaria,”A Systolic Architecture for Fast Stack Sequential Decoders” IEEE Transaction on communications, vol. 42, no. 21314, February 1994 [12] Costin FODOR, David HACCOUN, ”An evaluation of the systolic stack sequential decoder” annals of Telecommunications, vol. 50,no. 9-10,1995 | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22397 | - |
dc.description.abstract | A*是一種樹狀搜尋法,常用來解圖形中的最短路徑,此種演算法評估各個分支與目標的度量,在搜尋的早期階段停止展開大量不適用的解,在短時間內找到最可能的解,達到增加效率的目的。A*解碼法目前已經被使用在線性區塊碼的最大相似解碼上,它可以減少搜索路徑,提高最大相似解碼的速度。本文提出一個改良的A*解碼法,與A*演算法原型比較,更可以有效的及早停止展開不適用的解。在VLSI中,此方法不僅解碼速度較快,錯誤率的表現較好,甚至複雜度也可以略微降低,本文將提出QR(80,40)的相關IC設計的架構,對於複雜度降低的部分加以佐證。 | zh_TW |
dc.description.abstract | 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. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T04:16:55Z (GMT). No. of bitstreams: 1 ntu-99-R97942102-1.pdf: 2321114 bytes, checksum: 846ec657a29094210d5e318cc04801a6 (MD5) Previous issue date: 2010 | en |
dc.description.tableofcontents | 口試委員會審定書 2
誌謝 i 中文摘要 ii ABSTRACT iii CONTENTS iv LIST OF FIGURES vi LIST OF TABLES viii Chapter 1 Introduction 1 Chapter 2 Decoding Algorithm 4 2.1 Establish Codeword Tree of Linear Block Code 5 2.2 A* Decoding algorithm 7 2.2.1 A* Decoding Process 8 2.3 Sorting the received signals 11 2.3.1 Ekroot A* Decoding Process with sorting received signals first 12 2.4 Heuristic function 13 2.4.1 Simplify the calculation of path metric 14 Chapter 3 Modified A* algorithm 17 3.1 Chang-Lin A* algorithm 17 3.1.1 Stack state of Chang-Lin A* algorithm 21 3.2 Han’s A* algorithm 22 3.2.1 Simulation result of Chang-Lin A* algorithm and Han’s algorithm 22 3.3 Modified A* algorithm 23 3.3.1 Simply the Modified A* algorithm 24 3.4 Compare the Chang-Lin A* algorithm and the modified A* Algorithm 27 3.5 Compare A* algorithm and Modified A* algorithm 29 Chapter 4 Design and Impletation of QR(80,40) 31 4.1 Basic Design 32 4.1.1 Quantization 32 4.1.2 Sort the received data 33 4.1.3 Predict the parity bits 37 4.2 Design of A* Algorithm 38 4.3 Design of Modified A* Algorithm 41 Chapter 5 Simulation Result 46 Chapter 6 Conclusions 50 REFERENCE 52 | |
dc.language.iso | en | |
dc.title | 改良式A*軟式線性區塊碼解碼器的設計與實作 | zh_TW |
dc.title | Design and Implementation of a Soft Linear Block Code Decoder with a Modified A* algorithm | en |
dc.type | Thesis | |
dc.date.schoolyear | 98-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 趙啟超,呂忠津,韓永祥 | |
dc.subject.keyword | 線性區塊碼,樹狀搜尋法, | zh_TW |
dc.subject.keyword | linear block code,A* algorithm,soft decoding, | en |
dc.relation.page | 53 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2010-07-30 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-99-1.pdf 目前未授權公開取用 | 2.27 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。