{"title":"一种新的规则和不规则并行前缀加法器故障模型","authors":"C. Arjhan, R. G. Deshmukh","doi":"10.1109/SECON.1998.673378","DOIUrl":null,"url":null,"abstract":"In this paper a new fault-detection model, pair faults (pf), is presented to show that the entire 'O' carry-tree of Brent-Kung adder is testable contrary to Becker's proof. This model is also used to detect multiple faults for both regular and irregular carry-tree layouts. There are n+1 test patterns which can be applied (n is the operand width) through pipelining the primary inputs of the carry-tree. For this purpose, three new lemmas, one pf-model and their proofs are presented.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"173 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A novel fault-model for regular and irregular parallel-prefix adders\",\"authors\":\"C. Arjhan, R. G. Deshmukh\",\"doi\":\"10.1109/SECON.1998.673378\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new fault-detection model, pair faults (pf), is presented to show that the entire 'O' carry-tree of Brent-Kung adder is testable contrary to Becker's proof. This model is also used to detect multiple faults for both regular and irregular carry-tree layouts. There are n+1 test patterns which can be applied (n is the operand width) through pipelining the primary inputs of the carry-tree. For this purpose, three new lemmas, one pf-model and their proofs are presented.\",\"PeriodicalId\":281991,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'\",\"volume\":\"173 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1998.673378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1998.673378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel fault-model for regular and irregular parallel-prefix adders
In this paper a new fault-detection model, pair faults (pf), is presented to show that the entire 'O' carry-tree of Brent-Kung adder is testable contrary to Becker's proof. This model is also used to detect multiple faults for both regular and irregular carry-tree layouts. There are n+1 test patterns which can be applied (n is the operand width) through pipelining the primary inputs of the carry-tree. For this purpose, three new lemmas, one pf-model and their proofs are presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
