一种自检有限状态机的状态编码

C. Bolchini, R. Montandon, F. Salice, D. Sciuto
{"title":"一种自检有限状态机的状态编码","authors":"C. Bolchini, R. Montandon, F. Salice, D. Sciuto","doi":"10.1109/ASPDAC.1995.486392","DOIUrl":null,"url":null,"abstract":"The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the output or for both. In this paper a state encoding in which the Hamming distance between each state and its possible next states is constant is proposed. The adoption of such an encoding and the application of specific techniques for achieving a complete fault detection property for faults occurring in the next-state logic are presented. Area overhead and fault coverage results on a set of MCNC benchmark FSMs are provided.","PeriodicalId":119232,"journal":{"name":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A state encoding for self-checking finite state machines\",\"authors\":\"C. Bolchini, R. Montandon, F. Salice, D. Sciuto\",\"doi\":\"10.1109/ASPDAC.1995.486392\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the output or for both. In this paper a state encoding in which the Hamming distance between each state and its possible next states is constant is proposed. The adoption of such an encoding and the application of specific techniques for achieving a complete fault detection property for faults occurring in the next-state logic are presented. Area overhead and fault coverage results on a set of MCNC benchmark FSMs are provided.\",\"PeriodicalId\":119232,\"journal\":{\"name\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASPDAC.1995.486392\",\"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 ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.1995.486392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

自检fsm的设计可以通过对状态、输出或两者采用编码来实现。本文提出了一种状态编码,其中每个状态与其可能的下一状态之间的汉明距离为常数。本文介绍了采用这种编码和应用特定技术来实现下一状态逻辑中发生的故障的完整故障检测特性。给出了一组MCNC基准fsm的面积开销和故障覆盖率结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A state encoding for self-checking finite state machines
The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the output or for both. In this paper a state encoding in which the Hamming distance between each state and its possible next states is constant is proposed. The adoption of such an encoding and the application of specific techniques for achieving a complete fault detection property for faults occurring in the next-state logic are presented. Area overhead and fault coverage results on a set of MCNC benchmark FSMs are provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Extending pitchmatching algorithms to layouts with multiple grid constraints Routing space estimation and safe assignment for macro cell placement Formal verification of pipelined and superscalar processors Test pattern embedding in sequential circuits through cellular automata Automatic verification of memory systems which service their requests out of order
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1