HPTR:用于容错的硬件分区时间冗余技术

S. Al-Arian, M.B. Gumusel
{"title":"HPTR:用于容错的硬件分区时间冗余技术","authors":"S. Al-Arian, M.B. Gumusel","doi":"10.1109/SECON.1992.202272","DOIUrl":null,"url":null,"abstract":"A fault-masking technique for both arithmetic and logical operations in an arithmetic logic unit (ALU) is proposed. The technique, which is basically time redundant, takes advantage of both time and hardware redundancy concepts. The method with which error correction is accomplished resembles that of triplication of hardware. Time redundancy is then used to complete the computation and obtain the final result on the same hardware. For example, a 12-b addition operation can be realized by using each of three 4-b adder modules three times in parallel. During each partial calculation, the error correction is accomplished by taking the majority gate of the results from the three 4-b adder blocks. The operation of an N-bit full-adder is shown as an example to describe the basis of the hardware partition in time redundancy (HPTR) technique.<<ETX>>","PeriodicalId":230446,"journal":{"name":"Proceedings IEEE Southeastcon '92","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"HPTR: Hardware partition in time redundancy technique for fault tolerance\",\"authors\":\"S. Al-Arian, M.B. Gumusel\",\"doi\":\"10.1109/SECON.1992.202272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fault-masking technique for both arithmetic and logical operations in an arithmetic logic unit (ALU) is proposed. The technique, which is basically time redundant, takes advantage of both time and hardware redundancy concepts. The method with which error correction is accomplished resembles that of triplication of hardware. Time redundancy is then used to complete the computation and obtain the final result on the same hardware. For example, a 12-b addition operation can be realized by using each of three 4-b adder modules three times in parallel. During each partial calculation, the error correction is accomplished by taking the majority gate of the results from the three 4-b adder blocks. The operation of an N-bit full-adder is shown as an example to describe the basis of the hardware partition in time redundancy (HPTR) technique.<<ETX>>\",\"PeriodicalId\":230446,\"journal\":{\"name\":\"Proceedings IEEE Southeastcon '92\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Southeastcon '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.1992.202272\",\"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 '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.1992.202272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

提出了一种算术逻辑单元(ALU)中算术运算和逻辑运算的故障屏蔽技术。该技术基本上是时间冗余的,它利用了时间和硬件冗余的概念。完成纠错的方法类似于硬件的三倍。然后利用时间冗余在同一硬件上完成计算并获得最终结果。例如,一个12b的加法运算可以通过三个4b加法器模块中的每一个并行使用三次来实现。在每个部分计算期间,通过从三个4-b加法器块中获取结果的多数门来完成纠错。以n位全加法器的操作为例,描述了时间冗余(HPTR)技术中硬件分区的基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HPTR: Hardware partition in time redundancy technique for fault tolerance
A fault-masking technique for both arithmetic and logical operations in an arithmetic logic unit (ALU) is proposed. The technique, which is basically time redundant, takes advantage of both time and hardware redundancy concepts. The method with which error correction is accomplished resembles that of triplication of hardware. Time redundancy is then used to complete the computation and obtain the final result on the same hardware. For example, a 12-b addition operation can be realized by using each of three 4-b adder modules three times in parallel. During each partial calculation, the error correction is accomplished by taking the majority gate of the results from the three 4-b adder blocks. The operation of an N-bit full-adder is shown as an example to describe the basis of the hardware partition in time redundancy (HPTR) technique.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信