Minimization of the High-Level Fault Model for Microprocessor Control Parts

R. Ubar, Adeboye Stephen Oyeniran, Olusiji O. Medaiyese
{"title":"Minimization of the High-Level Fault Model for Microprocessor Control Parts","authors":"R. Ubar, Adeboye Stephen Oyeniran, Olusiji O. Medaiyese","doi":"10.1109/BEC.2018.8600980","DOIUrl":null,"url":null,"abstract":"The paper presents a method for representing the instruction set truth tables of microprocessors with High-Level Decision Diagrams (HLDD). A behavior level fault model is defined for the microprocessor control parts on the basis of instruction level truth tables (TT). Two methods are proposed for creating HLDDs from TTs with minimization of the edges on graphs: greedy algorithm, and branch and bound algorithm (B&B). A simple and fast computable lower bound is proposed to be used for pruning the search space of the B&B algorithm. Experimental data of using the fault model for several microprocessors and comparison data are provided to show the efficiency of the proposed high-level fault model over the gate-level Stuck-at-Fault (SAF) model.","PeriodicalId":140384,"journal":{"name":"2018 16th Biennial Baltic Electronics Conference (BEC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 16th Biennial Baltic Electronics Conference (BEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BEC.2018.8600980","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The paper presents a method for representing the instruction set truth tables of microprocessors with High-Level Decision Diagrams (HLDD). A behavior level fault model is defined for the microprocessor control parts on the basis of instruction level truth tables (TT). Two methods are proposed for creating HLDDs from TTs with minimization of the edges on graphs: greedy algorithm, and branch and bound algorithm (B&B). A simple and fast computable lower bound is proposed to be used for pruning the search space of the B&B algorithm. Experimental data of using the fault model for several microprocessors and comparison data are provided to show the efficiency of the proposed high-level fault model over the gate-level Stuck-at-Fault (SAF) model.
微处理器控制部件高级故障模型的最小化
提出了一种用高级决策图(HLDD)表示微处理器指令集真值表的方法。在指令级真值表的基础上,定义了微处理器控制部件的行为级故障模型。提出了两种从图上最小化边的TTs生成hld的方法:贪心算法和分支定界算法(B&B)。提出了一种简单、快速可计算的下界,用于对B&B算法的搜索空间进行剪枝。通过对多台微处理器故障模型的实验数据和对比数据,验证了所提出的高级故障模型比门级故障卡滞模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信