時序電路的冗余狀態(tài)變換確認研究
STATE TRANSITION REDUNDANCE IDENTIFICATION
-
摘要: 本文以狀態(tài)跳變圖為基礎(chǔ),深入分析冗余變換與非法變換的特征,提出結(jié)構(gòu)冗余和功能冗余的概念,并討論了可測、不可測故障與冗余之間的聯(lián)系。最后結(jié)合驗證和測試生成,提出狀態(tài)冗余的隱含遍歷確認策略。
-
關(guān)鍵詞:
- 測試生成; 驗證; 有限狀態(tài)機
Abstract: The BDD (Binary Decision Diagram) is very important for representing synchronous circuits. After analyzing and reducing the BDD, the state traversing is proposed on the basis of collapsing of input, routes and states on STG. Finally, the verification for the non-reset circuits has been described. -
Cho H, Hachteland G D. Fast sequential ATPG based on implicit state enumeration. ITC91 1991, 67-74.[2]Calazans N. Advanced ordered and manipulation tecniques for BDD. DA92, 1992, 452-457. -
計量
- 文章訪問數(shù): 2011
- HTML全文瀏覽量: 77
- PDF下載量: 553
- 被引次數(shù): 0