Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42502
Title: 基於IEEE802.16e標準之快速收斂低密度奇偶校驗編碼硬體解碼器設計與實作
Design and Implementation of a Fast Convergence LDPC Decoder for IEEE802.16e Standard
Authors: Yi-Ting Liu
劉奕廷
Advisor: 顧孟愷
Keyword: 低密度奇偶校驗編碼,快速收斂,解碼器,全球互通微波存取,動態情報排程,錯誤更正碼,
LDPC,Fast Convergence,Decoder,WiMAX,Informed Dynamic Scheduling,Channel Coding,
Publication Year : 2009
Degree: 碩士
Abstract: 在這篇論文,我們提出了基於一種先進動態情報排程的快速收斂排程方法用在低密度奇偶校驗編碼之解碼器。另外,我們設計了是用於此方法的硬體架構適用於IEEE 802.16e,也是大家所知的全球互通微波存取。從電腦模擬結果顯示,提出的方法跟水平階層解碼演算法比約減少解碼次數46.92%在信號雜訊比為1分貝之下和最大解碼次數設為20。另外,我們方法的位元錯誤率也只有可忽略的退步。我們實作提出演算法於賽靈思公司的元件可編程邏輯閘陣列版上驗證其正確性。實作結果得知額外的硬體開銷跟記憶體使用很小。因為較低的解碼次數,整個系統的吞吐量也提高許多。跟原本動態情報排程設計比較,我們提出的演算法之複雜度是低得多,而可以在硬體上很容易實作。
In this thesis, we propose the fast convergence scheduling method based on the novel technique named Informed Dynamic Scheduling for low-density parity-check code decoder. In addition, we design the hardware architecture to fit with the proposed method applied to IEEE 802.16e standard which is known as WiMAX. From the computer simulation result, the proposed method decreases the decoding iteration up to 46.92% compared with the horizontal layer decoding algorithm when Signal-to-noise ratio is 1dB and the maximum decoding iteration is 20. Furthermore, the BER performance of our method has only small degradation which can be ignored. We also implement the proposed algorithm on Xilinx FPGA board to verify the correctness. The implementation result shows that the extra hardware cost and memory usage is small. The total system throughput also improves because of the lower decoding iterations. Compare with the origin Informed Dynamic Scheduling method, the complexity of our proposed algorithm is much lower that can be implemented on the hardware easily.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42502
Fulltext Rights: 有償授權
Appears in Collections:資訊工程學系

Files in This Item:
File SizeFormat 
ntu-98-1.pdf
  Restricted Access
2.43 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved