請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43037完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 郭斯彥 | |
| dc.contributor.author | Yen-Po Liu | en |
| dc.contributor.author | 劉彥伯 | zh_TW |
| dc.date.accessioned | 2021-06-15T01:33:55Z | - |
| dc.date.available | 2014-07-30 | |
| dc.date.copyright | 2009-07-30 | |
| dc.date.issued | 2009 | |
| dc.date.submitted | 2009-07-20 | |
| dc.identifier.citation | [1] 'Moore's Law original issue found'. BBC News Online. 2005-04-22. Retrieved on 2007-07-10.
[2] 'FDIV Replacement Program: Description of the Flaw'. Intel. 2004-07-09. Retrieved on 2006-12-19. [3] Rich, D. “The evolution of SystemVerilog” IEEE Design and Test of Computers, July/August 2003 [4] Electronic Design Automation For Integrated Circuits Handbook, by Lavagno, Martin, and Scheffer, ISBN 0-8493-3096-3 A survey of the field. This article was derived, with permission, from Volume 2, Chapter 4, Equivalence Checking, by Fabio Somenzi and Andreas Kuehlmann. [5] http://www.cl.cam.ac.uk/~jrh13/slides/types-04sep99/slides1.pdf [6] Allen Emerson, E.; Clarke, Edmund M. (1980), 'Characterizing correctness properties of parallel programs using fixpoints', Automata, Languages and Programming, doi:10.1007/3-540-10003-2_69 [7] Edmund M. Clarke, E. Allen Emerson: 'Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic'. Logic of Programs 1981: 52-71. [8] Davis, Martin; Logemann, George, and Loveland, Donald (1962). 'A Machine Program for Theorem Proving [9] http://en.wikipedia.org/wiki/Ripple_adder#Ripple_carry_adder [10] Hardware algorithms for arithmetic modules, ARITH research group, Aoki lab., Tohoku University [11] http://en.wikipedia.org/wiki/Carry_select_adder [12] http://www.princeton.edu/~wolf/modern-vlsi/Overheads/CHAP6-1/sld016.htm [13] Brassard, G. and Bratley, P. Fundamental of Algorithmics, Prentice-Hall, 1996. [14] http://en.wikipedia.org/wiki/Binary_multiplier [15] V. Bertacco, Scalable Hardware Verification with Symbolic Simulation., Springer,2005. [16] P. Bjesse and A. Boralv, 'DAG-aware circuit compression for formal verification', Proc. ICCAD '04, pp. 42-49. [17] Robert B. Jones. “Applications of Symbolic Simulation to the Formal Verification of Microprocessors”. PhD thesis, Computer Systems Laboratory, Stanford University, August 1999. [18] A. Mishchenko, S. Chatterjee, and R. Brayton, 'DAG-aware AIG rewriting: A fresh look at combinational logic synthesis', Proc. DAC '06, pp. 532-536. [19] A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, .Symbolic model checking without BDDs., in Proc. International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) . Lecture Notes in Computer Science (LNCS) 1579, 1999, pp. 193-207. [20] A. Mishchenko, S. Chatterjee, R. Jiang, and R. K. Brayton, 'FRAIGs: A unifying representation for logic synthesis and verification'. ERL Technical Report, EECS Dept., UC Berkeley, March 2005. [21] A. Mishchenko, A. Chatterjee, and R. Brayton, “Improvements to Combinational Equivalence Checking”. Proc. ICCAD '06, pp. 836-843. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43037 | - |
| dc.description.abstract | 晶片驗證在晶片設計流程中扮演一個不可或缺的角色,拜半導體產業的技術與晶片設計的計密程度,驗證的工作變成是一個龐大問題與挑戰,通常晶片驗證工程師使用一種證明相同的方式下來驗證片,驗證由晶片設計師所設計出來的晶片與驗證工程師所設計出來的程式是否相同是一個非常大的挑戰,由於晶片設計師所使用的語言是低階的硬體描述語言,驗證工程師所使用的為高階的程式語言,所以唯一的克服方法為將兩種設計轉換成一種最低階的表示方式,將驗證工程師的設計轉換成低階的表示方式後在與原工程師所設計的硬體比較,通常我會將兩種設計轉換成低階的表示方式後,將他們合併在一起,去比較他們兩者之間的輸出是否相等,我們可以使用SAT引擎去解決相等的問題。
在本篇論文中我們將討論從高階的表示法轉換成低階的表示法之中的關係,與效能上的問題,不同的結構與不同的表示方式將導致有不同的效能,目的是找出最佳的結構以利於在提升驗證上面的速度。 | zh_TW |
| dc.description.abstract | IC verification plays an important role in the design flow and becomes a difficult work with the rising complexity of modern IC designs. Among all methods, equivalence checking is a commonly adopted approaching in IC verification. However, checking the equivalence of a system-level model and RTL design is a major challenge, since the system-level model is written in high level statement, while RTL model is written in the low level description, the challenges can only be overcome with a combination of bit-level and word-level reasoning techniques. For the system-level model, it’s need to translate to the word-level or bit-level representation and check the functionally of both RTL model and system-level model. Another equivalence checking approach, it’s usually combined those RTL model and system-level model in the word-level or bit level representation into a circuit. We use the SAT engine to solve the equivalence problem.
In this disquisition, we had discussed the relationship between the system-level model and bit-level representation, and difference architecture of the bit-level implementation cause different performance. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T01:33:55Z (GMT). No. of bitstreams: 1 ntu-98-R96943106-1.pdf: 359753 bytes, checksum: 3c4b331f0b710c1ee1cfb8d41cb619d5 (MD5) Previous issue date: 2009 | en |
| dc.description.tableofcontents | 摘要 v
Abstract vii Content ix List of Tables x List of Figures xii Chapter 1. Introduction 1 1.1. Motivation 1 1.2. Introduction to Verification 4 1.3. Simulation-Base Verification 6 1.4. Equivalence Checking 6 1.5. Formal Verification 8 1.6. Symbolic Simulation 9 1.7. Introduction to SAT 17 1.8. Organization of the thesis 20 Chapter 2. Preliminary 21 2.1. Assumption 21 2.2. Problem Definition 23 2.3. Problem Formulation 24 Chapter 3. Our Algorithm 25 3.1. Proof the Correctness 25 3.2. Traditional Concept 31 3.3. Our Method 34 Chapter 4. Experimental Results 46 Chapter 5. Conclusions and Future Work 49 Reference. Reference 50 | |
| dc.language.iso | en | |
| dc.subject | 符號驗證 | zh_TW |
| dc.subject | 晶片驗證 | zh_TW |
| dc.subject | 乘法器 | zh_TW |
| dc.subject | 正規驗證 | zh_TW |
| dc.subject | formal verification | en |
| dc.subject | equivalent checking | en |
| dc.subject | symbolic simulation | en |
| dc.subject | multiplier | en |
| dc.subject | Verification | en |
| dc.title | 單元級晶片驗證最佳化 | zh_TW |
| dc.title | Optimization of Block Level Chip Verification | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 97-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 雷欽隆,袁世一,王思齊,呂學坤 | |
| dc.subject.keyword | 晶片驗證,乘法器,正規驗證,符號驗證, | zh_TW |
| dc.subject.keyword | Verification,multiplier,equivalent checking,symbolic simulation,formal verification, | en |
| dc.relation.page | 51 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2009-07-20 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電子工程學研究所 | zh_TW |
| 顯示於系所單位: | 電子工程學研究所 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-98-1.pdf 未授權公開取用 | 351.32 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
