{"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}
引用次数: 16
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.<>