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.