請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24429完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林茂昭 | |
| dc.contributor.author | Che-Wei Chang | en |
| dc.contributor.author | 張哲濰 | zh_TW |
| dc.date.accessioned | 2021-06-08T05:25:41Z | - |
| dc.date.copyright | 2005-07-30 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-21 | |
| dc.identifier.citation | [1]Shu Lin, Daniel J. Costello,Jr., Error Control Coding, second ED, Prentice Hall.
[2]Robert H. Morelos-Zaragoza., The art of error correcting coding, Wiley, 2002. [3]Jyh-Huei Guo and Chin-Liang Wang, “systolic array implementation of Euclid’s algorithm for inversion and division in GF(2^m),” IEEE, 1996. [4]Yanni Chen , Keshab K. Parhi., “Small Area efficient parallel decoder architecture for long BCH codes,” IEEE Transaction on VLSI systems, vol. 12, No. 5, MAY, 2004. [5]Arash Reyhani-Masoleh, M. Anwar Hasan, “Low Complexity Bit Parallel Architecture for Polynomial Basis Multiplication over ,” IEEE Transaction on Computers, vol.53, No. 8, AUGUST 2004. [6]E.D. Mastrovito, “VLSI Designs for Multiplication over Finite Fields ,” Proc. Sixth Symp. Applied Algebra, Algebraic Algorithm, and Error Correcting Codes (AAECC-6), pp. 297-309, July1988. [7]E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields” Ph D thesis, Linkoping Univ. Linkoping, Sweden, 1991. [8]L. Song, M.-L. Yu, and M. S. Shaffer, “10- and 40-Gb/s forward error correction devices for optical communications” IEEE J. Solid-State Circuits, vol. 37, pp. 351-354. [9]H. C. Chang, C. C. Lin, and C. Y. Lee, “A low power Reed-Solomon decoder for STM-16 optical communications “ in IEEE proc. Asia-Pacific Conf. ASIC, 2002, pp. 351-354. [10]M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan, “Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common sub-expression elimination” IEEE Trans. Computer-Aided Design, vol. 15, pp. 151-165, Feb. 996. [11]Hanho Lee, Meng-Lin Yu, Leilei Song “VLSI Design of Reed-Solomon Decoder Architectures” ISCAS 2000-IEEE International Symposium on Circuits and Systems, May 28-31, 2000. [12]H. M. Shao, T. K. Truong, L. J. Deutsch, J. H. Yuen and I. S. Reed, “A VLSI Design of a Pipeline Reed-Solomon Decoder” IEEE Trans. on Computers, Vol. C-34, No. 5, pp. 393-403, May 1985. [13]R.P. Brent and H.T. Kung, “Systolic VLSI arrays for polynomial GCD computations,” Dep. Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, Rep., 1982. [14]Howard M. Shao, T. K. Truong, Leslie J. Deutsch, Joseph H. Yuen and Irving S. Reed, “A VLSI design of a pipeline Reed-Solomon decoder” IEEE Transactions on computers, vol. c-34, No.5, May 1985. [15]Stephen B. Wicker, “Error control systems for digital communication and storage,” Prentice hall international, Inc. [16]D. Rossi, C. Metra, B. Ricco,“Fast and compact error correcting scheme for reliable multilevel Flash memories”, IEEE International Workshop on Memory Technology, Design and Testing, MTDT 2002, Italy. [17]R. Blahut, “Theory and Practice of Error Control Codes,” Addison-Wesley Co., 1983. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/24429 | - |
| dc.description.abstract | 由於新一代的快閃記憶體儲存單元越來越小，資料的干擾問題和維持問題卻變的越來越嚴重，也因此降低了記憶體的可靠度。因此錯誤更正碼得研究也越來越重要。
記憶體之錯誤更正碼設計已有一些相關研究。BCH 和 RS 碼是其中兩種最有效的代數碼也是最廣泛使用的方式。在不同之錯誤型態及不同之訊息位元數、檢查位元數等考量之下有多種不同之設計。本論文針對位元已經過擾亂器(interleaver)之處理且錯誤發生率可視為獨立(independent)之情形，考慮BCH(8191,8087,t=8)作編解碼設計。此系統中整合各種先進的架構，其中平行架構可以應用在徵狀(syndrome)區塊及Chien 搜尋區塊減少時脈週期數目，使用修正的歐幾里德的演算法可以解出關鍵方程式，還有分組匹配演算法可以有效降低Chien搜尋區塊乘法器的複雜度，最後將以Xilinx FPGA模擬其效能。 | zh_TW |
| dc.description.abstract | In new-generation Flash memories, issues such as disturbs and data retention become more and more critical as a consequence of reduced cell size, and hence it will decrease the reliability of memories. Then, the research of error control coding becomes very important.
There are already some researchs of the hardware design of error correcting code in storage equipments. BCH and RS codes form the core of the most powerful known algebraic codes and are widely used .In this thesis, we focus on the encoder/decoder design of BCH(8191,8087,t=8) code under the condition that the error probabily of all bits are independent due to interleaver operation. We integrate various advanced architecture in our system. The parallel architecture is used to syndrome block and Chien search block in order to reduce system’s clock cycles. Modified Euclidean algorithm is chosen to solve the key equation. And group matching algorithm is to minimize the complexity of the multipliers in Chien search architecture. Finally, the encoder/decoder architecture will be confirmed and simulated by XilinxFPGA. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-08T05:25:41Z (GMT). No. of bitstreams: 1 ntu-94-R92942070-1.pdf: 473508 bytes, checksum: 2fd4a9fe9233c188e848877d5a53097b (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | Chapter 1.Introduction 1
Chapter 2.Overview of BCH codes 5 2-1.BCH codes 5 2-2.Encoder of BCH code 5 2-3.Decoder of BCH code 8 2-3-1.Syndrome polynomial 9 2-3-2.Key equation 9 A.Greatest Common Divisor (GCD) 11 B.Euclidean algorithm 12 C.Modified Euclidean Algorithm 13 D.Extended GCD Problem 14 2-3-3.Chien search 16 Chapter 3.Hardware Design of BCH the code 17 3-1.Hardware design of multiplier 17 3-1-1.Polynomial Basis Multiplication over 17 3-1-2.Low complexity bit parallel (LCBP) multiplier 20 3-2.BCH encoder architecture 23 3-3.BCH decoder architecture 24 3-3-1.Syndrome generator 24 3-3-2.Solving key equation 26 A.Euclidean algorithm 26 B.Modified Euclidean algorithm architecture 27 3-3-3.Chien search architecture 29 A.Iterative Matching Algorithm 32 B.Concept of Group Matching 3 Chapter 4.Simulation Results 39 4-1.Multiplier 39 4-2.Encoder 41 4-3.Decoder 42 4-3-1.Syndrome generator 42 4-3-2.Modified Euclidean algorithm 44 4-3-3.Chien search 46 4-3-4.Encode/Decode Module and Correct Module 50 4-4.Results 52 Chapter 5.Conclusions 55 Bibliography 57 | |
| dc.language.iso | en | |
| dc.title | 一個長二元BCH碼之IC設計 | zh_TW |
| dc.title | The IC design of a Long BCH code | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 趙啟超,楊谷章,呂忠津,蘇賜麟 | |
| dc.subject.keyword | 碼,設計,硬體, | zh_TW |
| dc.subject.keyword | BCH,code,IC, | en |
| dc.relation.page | 59 | |
| dc.rights.note | 未授權 | |
| dc.date.accepted | 2005-07-21 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 目前未授權公開取用 | 462.41 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。