自检乘法和除法数组的有效实现

M. Nicolaidis, H. Bederr
{"title":"自检乘法和除法数组的有效实现","authors":"M. Nicolaidis, H. Bederr","doi":"10.1109/EDTC.1994.326816","DOIUrl":null,"url":null,"abstract":"In this paper we present efficient self checking implementations for multiply and divide arrays. These implementations are strongly fault secure or totally self-checking for a comprehensive fault model which includes stuck-at, stuck-on and stuck-open faults. They are compatible with data paths checked by the parity code (i.e. no code translators are needed), so that the self checking implementation of the whole data path is simplified.<<ETX>>","PeriodicalId":244297,"journal":{"name":"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Efficient implementations of self-checking multiply and divide arrays\",\"authors\":\"M. Nicolaidis, H. Bederr\",\"doi\":\"10.1109/EDTC.1994.326816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present efficient self checking implementations for multiply and divide arrays. These implementations are strongly fault secure or totally self-checking for a comprehensive fault model which includes stuck-at, stuck-on and stuck-open faults. They are compatible with data paths checked by the parity code (i.e. no code translators are needed), so that the self checking implementation of the whole data path is simplified.<<ETX>>\",\"PeriodicalId\":244297,\"journal\":{\"name\":\"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDTC.1994.326816\",\"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 of European Design and Test Conference EDAC-ETC-EUROASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDTC.1994.326816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

本文给出了乘法和除法数组的有效自检实现。这些实现是强故障安全或完全自检的一个全面的故障模型,包括卡,卡上和卡开故障。它们与奇偶校验码检查的数据路径兼容(即不需要代码翻译器),从而简化了整个数据路径的自检实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient implementations of self-checking multiply and divide arrays
In this paper we present efficient self checking implementations for multiply and divide arrays. These implementations are strongly fault secure or totally self-checking for a comprehensive fault model which includes stuck-at, stuck-on and stuck-open faults. They are compatible with data paths checked by the parity code (i.e. no code translators are needed), so that the self checking implementation of the whole data path is simplified.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信