請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43619
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 陳少傑(Sao-Jie Chen) | |
dc.contributor.author | Yu-Te Huang | en |
dc.contributor.author | 黃宇德 | zh_TW |
dc.date.accessioned | 2021-06-15T02:24:30Z | - |
dc.date.available | 2014-08-19 | |
dc.date.copyright | 2009-08-19 | |
dc.date.issued | 2009 | |
dc.date.submitted | 2009-08-18 | |
dc.identifier.citation | REFERENCE
[1] R. G. Gallager, Low-Density Parity-Check Codes, M.I.T. Press, 1963. [2] S. Lin and D.J. Costello, Jr., Error Control Coding, Pearson Education, Inc., Upper Saddle River, NJ, 2004. [3] S. Y. Chung, G. D. Forney, Jr, T. J. Richardson, and R. Urbanke, “On the Design of Low-density Parity-check Codes within 0.0045 dB of the Shannon Limit,” IEEE Commun. Letters, vol. 5, no. 2, pp. 58-60, Feb. 2001. [4] D. J. C Mackey and R. M. Neal, “Near Shannon Limit Performance of Low Density Parity check codes,” Electronics Letters, vol. 32, no. 18, pp. 1645-1646, Aug. 1996. [5] D. J. C Mackey, “Good Error-Correcting Codes Based on Very Sparse Matrices,” IEEE Trans. Inf. Theory, vol. 45, no.2, pp.399-431, Mar. 1999. [6] R. M. Tanner, “A Recursive Approach to Low-complexity Codes,” IEEE Trans. Inform. Theory, vol. IT-27, no.5, pp. 533-547, Sep. 1981. [7] F. Kschischnag, B. Frey, and H. Loeliger, “Factor Graphs and the Sum-product Algorithm,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp.498-519. Feb. 2001. [8] Y. Mao and A. Banihashemi, ”A Heuristic Search for Good for Good Low-Density Parity-Check code as short blocks,” in Proc. IEEE Int. conf. on Comm., pp.41-44, Jun. 2001. [9] Y. Kou, S. Lin, and M. Fossorier, “Low Density Parity-Check Codes: Construction based on Finite Geometries,” in Proc. IEEE Global Telecommunications Conference, vol. 2, pp.825-829, Nov. 2000. [10] Y. Kou, S. Lin, and M. Fossorier, “Low Density Parity-Check Codes based on Finite Geometries: A discovery and new results,” IEEE Trans. Inf. Theory, vol. 47, no. 11, pp.2711-2736, Nov. 2001. [11] M. P. C Fossorier, “Quasi-Cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices,” IEEE Trans. on Inf. Theory, vol. 50, no. 8, pp.1788-1793, Aug. 2004. [12] S. Chung, T. Richardson, and R. Urbanke, “Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation,” IEEE Trans. on Inform. Theory, vol. 47, no. 2, pp.657-670, Feb. 2001. [13] L. Chen, J. Xu, I. Djurdjevic, and S. Lin, “Near-Shannon-limit Quasi-cyclic Low-density Parity-Check Codes,” IEEE Trans. Commun., vol. 52, no.7, pp.1038-1042, Jul. 2004. [14] B.Honary, A. Moinian and B. Ammar, “Construction of Well-structured Quasi-Cyclic Low-Density Parity Check Codes,” IEE Proc. Commun., vol.152, no.6, pp. 1081-1085, Dec. 2005. [15] O. Milenkovic, N. Kashyap and D. Leyba, “Shortened Array Codes of Large Girth,” IEEE Trans. Inf. Theory, vol.52, no.8, pp.3707-3722, Aug. 2006. [16] E. Eleftheriou and S. Olcer, “Low-density Parity-Check Codes for Digital Subscriber Line,” in Proc. IEEE Int. Conf. on Communication, pp. 1752-1757, Apr. 2002. [17] T. J. Richardson and R. L. Urbanke, “Efficient Encoding of Low-Density Parity-Check Codes,” IEEE Trans. Inf. Theory, vol. 47, no.2, pp. 638-656, Feb. 2001. [18] Z. Li, L. Chen; L. Zeng, S. Lin W. Fong, “Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes” IEEE Trans. Commun., vol.54, no.1, pp.71-81, Jan. 2006. [19] C. Howland and A. Blanksby, “Parallel Decoding Architectures for Low Density Parity Check Codes,” in Proc. IEEE International Symposium on Circuits and Systems, vol. 4, pp 742-745, May 2001. [20] C. Howland and A. Blanksby, “A 220mW 1-Gbits/s 1024-Bit Rate-1/2 Low Density Parity Check Code Decoder,' in Proc. IEEE Custom Integrated Circuits Conference, pp.293-296, May 2001. [21] A. Blanksby and C. J. Howland, “A 690mW 1-Gbits/s 1024-Bit Rate1/2 Low Density Parity Check Code Decoder,' IEEE J. Sold-State Circuits, vol.37, no. 3, pp.404-412, Mar. 2002. [22] E Boutillon, J Castura, and F. R. Kschischang, “Decoder-First Code Design,” in Proc. The 2nd International Symposium on Turbo Codes and Related Topics, pp.459-462, Sep. 2000. [23] E. Yeo, P. Pakzad, B. Nikolic, and V. Anantharam, “High Throughput Low-Density Parity-Check Decoder Architectures,” in Proc. IEEE Global Telecommunications Conference, pp.3019-3024, Nov. 2001. [24] T.Zhang and K.K. Parhi, “VLSI Implementation-Oriented (3, K)-Regular Low-Density Parity Check Codes,” in Proc. IEEE Workshop on Signal Processing System (SiPs), pp.25-36, Sep. 2001. [25] T. Zong and K. K. Parhi, “A 54 Mbps (3, 6)-Regular FPGA LDPC Decoder,” in Proc. IEEE Workshop on Signal Processing System (SiPs), pp.127-132, Oct. 2002. [26] M. Mansour and N. Shanbhag, “Low Power VLSI Decoder Architectures for LDPC Codes,” in Proc. International Symposium on Low Power Electronics and Design, pp.284-289, Aug. 2002. [27] M. Karkooti and J. R. Cavallaro, “Semi-Parallel Reconfigurable Architectures for Real-time LDPC Decoding,” in Proc. International Conference on Information Technology: Coding and Computing, pp.579-585, Apr. 2004. [28] Y. Li, M.Elassal, and M. Bayoumi, “Power Efficient Architecture for (3, 6)-regular Low Density Parity Check Code Decoder,” in Proc. IEEE International Symposium on Circuits and Systems, vol. 4, pp.81-84, May 2004. [29] G. Masera, F. Quaglio, and F. Vacca, “Finite Precision Implementation of LDPC Decoders,” Commun., IEE Proceedings ,vol. 152, no. 6, pp.1098-1102. Dec. 2005. [30] M. P. C. Fossorier, M. Mihaljevi , and H. Imai, “Reduced Complexity Iterative Decoding of Low-density Parity Check Codes Based on Belief Propagation,” IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999. [31] J. Chen and M. Fossorier, “Near Optimum Universal Belief Propagation Based Decoding of Low-density Parity Check Codes,” IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002. [32] J. Zhao, F Zarkeshvari, AH Banihashemi, “On Implementation of Min-Sum Algorithm and its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes,” IEEE Trans. Commun., vol.53, no.4, pp. 549-554, Apr. 2005. [33] Z. Cui and Z. Wang, “Efficient Message Passing Architecture for High Throughput LDPC Decoder,” in Proc. IEEE International Symposium on Circuits and Systems, pp 917-920, May 2007. [34] J. Heo, “Analysis of Scaling Soft Information on Low Density Parity Check Codes,” Elect. Letters, vol.39, no.2, pp.219-221, Jan. 2003. [35] Y. Chen and K. K. Parhi, “Overlapped Message Passing for Quasi-Cyclic Low Density Parity Check Codes,” IEEE Trans. Circuits Systems, vol.51, no. 6, pp. 1106-1113, June 2004. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43619 | - |
dc.description.abstract | 文探討一種錯誤更正碼的技術,低密度同位元檢查碼(Low-Density Parity- Check Code, LDPC),其中包含碼的組成、碼的編解碼、及其遞迴解碼演算法,進而引入硬體設計的概念,分別探討完全平行式解碼架構、序列解碼架構、部份平行式解碼架構。不同的方式應用於不同的實際情況中。
具有quasi-cyclic半循環特性的同位元檢查矩陣有 個子矩陣,每一個子矩陣為單位矩陣或是其circulant矩陣,以上通稱為circulant 矩陣,其特點為每一個列為上一列的右移。此種矩陣可以建構出一系列的(QC_LDPC) 碼,可藉由定義每一個子矩陣的第一列的第一個一的位置,可找出適合的低密度同位元檢查碼且具有好的解碼效能。 此種半循環低密度同位元檢查碼亦適合部份平行式的解碼器實作,此部份平行式解碼器具有很高的彈性。此外介紹解碼器中主要的運算功能單元,諸如位元點單元及檢查點單元。部份平行式的解碼器結合完全平行式及序列式低密度同位元檢查碼解碼器優點,提供非常好硬體的方案,諸如可避免完全式解碼器大量繞線的問題,及序列式速度慢且需要大面積的記憶體,因此部份平行式的同位元檢查碼解碼器已成為現今低密度同位元檢查碼解碼器設計主流。 最終探討及實作部份平行式的同位元檢查碼解碼器,此架構之解碼器之同位元檢查矩陣具有特殊規律的結構,其優點為方便編碼器實作於移位暫存器。而解碼器之負責運算功能單元間的訊息的傳遞控制邏輯,可藉由簡單的累加器來產生所需要的記憶體位址,大幅降低以完全平行式設計方式所需的大量繞線。 | zh_TW |
dc.description.abstract | This Thesis discusses an error correction technology, Low-Density Parity Check (LDPC) code, as well as its code constructions, encoding methods and decoding algorithms.
Partially parallel decoder design methodology provides appropriate trade-off between hardware complexity and decoding throughput. Partially parallel decoder also combines the advantages from both the LDPC fully parallel decoder and serial decoder. Many Quasi-Cyclic LDPC codes have been studied and developed. These kinds of QC_LDPC codes not only reduce the memory addressing complexity in a decoder design but also the encoding complexity. Other compatible QC_LDPC codes have also been proposed. In this Thesis, we choose a code construction method similar to [27] to implement a partially parallel decoder suitable for the family of (3, 6)-regular LDPC codes. A array of circulant sub-matrices can be used to represent the parity check matrix Hqc of a QC_LDPC code. A family of structured QC_LDPC codes can be constructed by shifting the identity sub-matrix into different circulant sub-matrices. These kinds of QC_LDPC codes are suitable for partially parallel decoder. And its construction provides flexibility in hardware design. | en |
dc.description.provenance | Made available in DSpace on 2021-06-15T02:24:30Z (GMT). No. of bitstreams: 1 ntu-98-J93921044-1.pdf: 709215 bytes, checksum: 61d3f181a2cb19a03e243411609f6b72 (MD5) Previous issue date: 2009 | en |
dc.description.tableofcontents | TABLE OF CONTENTS
ABSTRACT i LIST OF FIGURES vii LIST OF TABLES ix CHAPTER 1 INTRODUCTION 1 1.1 LDPC Code Encoding 1 1.2 LDPC Code Decoding 2 1.3 Interesting Issues in VLSI Implementation of LDPC Decoder 2 1.3.1 Code Constructions 2 1.3.2 Functional Units of Decoder 3 1.3.3 Decoding Algorithms 3 1.3.4 Toward Good Performance 3 1.4 Thesis Organization 4 CHAPTER 2 BACKGROUND INFORMATION 5 2.1 Low-Density Parity Check Codes 5 2.2 Quasi-Cyclic LDPC Codes 9 2.3 Quasi-Cyclic LDPC Constructions 9 2.3.1 Array Based LDPC Constructions 10 2.4 Efficient LDPC Code Encoding 10 2.4.1 Quasi-Cyclic LDPC Encoding 12 CHAPTER 3 DECODING ALGORITHMS 13 3.1 LDPC Code Decoding Overview 13 3.2 Message Passing Algorithm 15 3.2.1 Summary of Log -Message Passing Algorithm 17 3.3 Tanh Rules 18 3.3.1 Multitiplicative Form 19 3.3.2 Additive Form 20 3.4 Min-Sum Algorithm 23 3.4.1 Summary of Min-Sum Algorithm 24 3.5 Modified Min-Sum Algorithm 25 3.5.1 Summary of Modified Min-Sum Algorithm 26 3.6 Summary of Decoding Algorithms 26 CHAPTER 4 LDPC DECODER ARCHITECTURES 31 4.1 LDPC Decoder Architectures Overview 31 4.2 Partially Parallel Based LDPC Decoder Architectures 34 4.2.1 Partially Parallel Based LDPC Decoder Architectures Processing 36 4.2.2 Memory Addressing 37 4.3 Key Functional Units in LDPC Decoder 38 4.3.1 Bit-Node-Unit 39 4.3.2 Check-Node Unit 41 4.4 Partially Parallel LDPC Decoder Diagram 45 4.4.1 A Prototype Partially Parallel LDPC Decoder 45 CHAPTER 5 DECODER PROTOTYPING IMPLEMENTATION AND DISCUSSION 47 5.1 Prototype (3, 6) Partially Parallel LDPC Decoder Specification 47 5.2 Simulation Results 48 5.3 Evaluation 56 5.3.1 Finite State Machine Design 57 5.3.2 Synthesis Results and Discussions 59 CHAPTER 6 CONCLUSION AND FUTURE WORK 65 6.1 Conclusion 65 6.2 Future Work 65 6.2.1 Encoding Methods 66 6.2.2 Code Constructions 66 6.2.3 Functional Units 66 6.2.4 Decoding Process 67 REFERENCE 69 | |
dc.language.iso | en | |
dc.title | 低密度同位元檢查碼解碼器架構研究及設計 | zh_TW |
dc.title | Low Density Parity Check Code Decoder Architecture Study and Design | en |
dc.type | Thesis | |
dc.date.schoolyear | 97-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 闕志達(Tzi-Dar Chiueh),顧孟凱,游竹 | |
dc.subject.keyword | 低密度同位元檢查碼解碼器,半循環,部份平行式, | zh_TW |
dc.subject.keyword | partially parallel decoder,ldpc,quasi-cyclic,FPGA, | en |
dc.relation.page | 72 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2009-08-18 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-98-1.pdf 目前未授權公開取用 | 692.59 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。