以模擬為基礎之組合電路冗餘線路識別器｜國立清華大學博碩士論文庫

簡易檢索 / 詳目顯示

回結果列表

研究生：	黃意元 Yi-Yuan Huang
論文名稱：	以模擬為基礎之組合電路冗餘線路識別器 A Simulation-based Redundancy Identification in Combinational Circuits
指導教授：	王俊堯 Chun-Yao Wang
口試委員:
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 資訊工程學系 Computer Science
論文出版年：	2007
畢業學年度：	95
語文別：	英文
論文頁數：	34
中文關鍵詞：	冗餘線路、組合電路、最佳化
外文關鍵詞：	redundant, combinational circuit, optimization
相關次數：	點閱：78 下載：0
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

冗餘線路的移除在組合電路的最佳化中是重要的一環。傳統的冗餘線路辨別的演算法是建立在自動測試圖樣產生之上。然而，自動測試圖樣產生系統需要耗費大量的時間去確定一個錯誤是不可測試的，即此錯誤是冗餘的。一條線路要確定是冗餘的並非那麼容易，然而，要確定它不是冗餘的卻是容易的多。在這篇論文中，我們提出了一個有效率的冗餘線路識別器以至於非冗餘的線路可輕易得被辨別出來。實驗結果顯示我們所提出的方法對於大部份的測試電路可辨別出全部的非冗餘線路。

Redundancy removal is an important operation in combinational logic optimization. Traditional redundancy identification algorithms are based on automatic test pattern generation algorithms. However, automatic test pattern generation algorithms spend much CPU time to determine if a fault on a wire is untestable, and thus redundant. To determine if a wire is redundant is not easy, however, to determine if a wire is irredundant is much easier. In this thesis, we present an efficient redundancy identifier such that irredundant wires can be easily filtered out. The experimental results show that the presented method can identify all irredundant wires in most benchmark circuits.

Contents
摘要......................................................i
Abstract.................................................ii
Acknowledgements........................................iii
Contents.................................................iv
List of Figures..........................................vi
List of Tables..........................................vii
Chapter 1   Introduction..................................1
1.1 Motivation............................................1
1.2 Problem formulation...................................1
1.3 Existing approaches to RID............................2
1.4 Our contributions.....................................4
1.5 Overview..............................................4
Chapter 2 Background......................................5
2.1 Random pattern generator..............................6
2.2 Fanout-free region....................................6
2.3 Parallel pattern simulation...........................7
2.4 Critical path tracing.................................8
Chapter 3 Our Approach...................................11
3.1 Parallel simulation..................................11
3.2 Stem-criticality evaluation..........................12
3.3 Stem-analysis........................................19
3.4 Irredundancy identification..........................20
3.4 Overall flow.........................................22
Chapter 4 Experimental Results and Analysis..............24
4.1 Experimental setup...................................24
4.2 Experimental results and analysis of our approach....25
4.3 The application with our approach....................26
4.4 Experimental results and analysis of the application.26
Chapter 5 Conclusions....................................30
References...............................................31
List of Figures
2.1 A circuit with redundant wires w(c → g1) and w(g2 → g4).......................................................5
2.2 The architecture of RPG...............................6
2.3 The graph representation G = (V, E) of a circuit C ........................................................7
2.4 The FFR decomposition of G, Gπ = (Vπ, Eπ)........................................................7
2.5 Sensitivity relationship .............................8
2.6 AND gate..............................................9
2.7 NOT gate..............................................9
3.1 An example to demonstrate the derivation of stem-criticality..............................................13
3.2 Flow chart...........................................23
List of Tables
4.1 The comparison among SIS ATPG, SIS ATPG with RPG, and our approach............................................ 28
4.2 The comparison between SIS ATPG with RPG and SIS ATPG with our approach........................................29

                                

[1] M. Abramovici, P. R. Menon, and D. T. Miller, “Critical Path Tracing—An Alternative
to Fault Simulation,”in Proc. 20th Design Automation Conf., pp. 214–220, June 1983.
[2] V. D. Agrawal and S. C. Seth, Test Generation for VLSI Chips, IEEE Computer Society Press, 1988.
[3] D. B. Armstrong,“A Deductive Method for Simulating Faults in Logic Circuits,”IEEE Trans. on Computers, vol. C-21, no. 5, pp. 464–471, May 1972.
[4] K. J. Antreich and M. H. Schulz,“Accelerated Fault Simulation and Fault Grading in Combinational Circuits,”IEEE Trans. on Computer-Aided Design., vol. CAD-6, no. 5, Sep. 1987.
[5] S. T. Chakradhar, V. D. Agrawal, and S. G. Rothweiler, “A Transitive Closure Algorithm for Test Generation,” IEEE Trans. on Computer-Aided Design., vol. 12, no. 7,
July 1993.
[6] S.-C. Chang, D.-I. Cheng and C.-W. Yeh, “Removing Multiple Redundancies in Combinational Circuits,” in IEE Proc. Computer. Tech., vol. 149, no. 1, Jan. 2002.
[7] S.-C. Chang, L. P. P. P. van Ginneken, and M. Marek-Sadowska, “Circuit Optimization by Rewiring,” IEEE Trans. on Computers, vol. 48, no. 9, pp. 962–970, Sep. 1999.
[8] H. Fujiwara and T. Shimono, “On the Acceleration of Test Generation Algorithms,” IEEE Trans. on Computers, vol. C-32, no. 12, pp. 1137–1144, Dec. 1983.
[9] S.-J. Hong, “Fault Simulation Strategy for Combinational Logic Networks,” in Proc. 8th International Symp. Fault-Tolerant Computing, pp. 96–99, 1978.
[10] P. Goel, “An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits,” IEEE Trans. on Computers, vol. C-30, no. 3, pp. 215–222, Mar.
1981.
[11] M. A. Iyer and M. Abramovici, “FIRE: A Fault-independent Combinational Redundancy Identification Algorithm,” IEEE Trans. on Very Large Scale Integrated Syst., vol. 4, pp. 135–140, Apr. 1986.
[12] W. Kunz and D. K. Pradhan, “Recursive Learning: An Attractive Alternative to the Decision Tree for Test Generation in Digital Circuits,” in Proc. International Test Conf., pp. 816–825, Sep. 1992.
[13] K. P. Parker and E. J.McCluskey, “Probabilistic Treatment of General Combinational Networks,” IEEE Trans. on Computers, vol. C-24, pp. 668-670, 1975.
[14] J. P. Roth, “Diagnosis of Automata Failures: A Calculus and a Method,” IBM Journal of Research and Development, vol. 10, pp. 278-291, July 1966.
[15] J. Savir, G. S. Ditlow, and P. H. Bardell, “Random Pattern Testability,” IEEE Trans. on Computers, vol. C-33, pp. 79-90, Jan. 1984.
REFERENCES 33
[16] M. H. Schulz, E. Trischler, and T. M. Serfert,“SOCRATES: A Highly Efficient Automatic Test Pattern Generation System,” IEEE Trans. on Computer-Aided Design.,
vol. CAD-7, no. 1, pp. 126–137, Jan. 1988.
[17] J. P. M. Silva and K. A. Sakallah, “Grasp—A New Search Algorithm for Satisfiability,” in Proc. International Conf. on Computer-Aided Design, pp. 220–227, Nov. 1996.
[18] E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, “SIS: A System for
Sequential Circuit Synthesis,” Technical Report UCB/ERL M92/41, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, May 1992.
[19] O. Song and P. R. Menon, “Parallel Pattern Fault Simulation Based on Stem Faults in Combinational Circuits,” in Proc. International Test Conf., pp. 706-711, 1990.
[20] E. G. Ulrich, V. D. Agrawal and J. H. Abrabian, Concurrent and Comparative Discrete Event Simulation. Boston: Kluwer Academic Publishers, 1994.
[21] E. G. Ulrich and T. Baker, “The Concurrent Simulation of Nearly Identical Digital Networks,” Proc. 10th Design Automation Conf., pp. 145–150, June 1973.
[22] J. A. Waicukauski, E. B. Eichelberger, D. O. Forlenza, E. Lindbloom, and T. Mc-Carthy, “Fast Simulation for Structured VLSI,” VLSI Systems Design, vol. 6, no. 12,
pp. 20–32, Dec. 1985.
[23] D.-T. Wang, “An Algorithm for the Generation of Test Sets for Combinational Logic Network,” IEEE Trans. on Computers, vol. C-24, no. 7, pp. 742–746, July 1975.
[24] http://www.swox.com/gmp

全文公開日期本全文未授權公開 (校內網路)
全文公開日期本全文未授權公開 (校外網路)

簡易檢索 / 詳目顯示

相關論文