{"title":"On-line detection of faults in carry-select adders","authors":"B. K. Kumar, P. Lala","doi":"10.1109/TEST.2003.1271077","DOIUrl":null,"url":null,"abstract":"Paper 35.3 91 2 from the previous stage. If the actual carry-in is ‘0’ then the sum multiplexed from the first unit is selected, alternatively if the carry-in is. ‘ 1 ’ then the sum from the second unit is selected. A carry select adder of arbitrary size can be deigned by cascading together an appropriate number of such 4-bit adders. This paper concentrates on designing a scheme for implementing self-checking carry-select adders. Several techniques have been proposed in recent years for designing self-checking adders [2][3][4]. Coding techniques such as Berger code, Residue code and arithmetic codes have been proposed for checking the hnctionality of the arithmetic units. a3 b3 a2 b2 al b l QO bO","PeriodicalId":236182,"journal":{"name":"International Test Conference, 2003. Proceedings. ITC 2003.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Test Conference, 2003. Proceedings. ITC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEST.2003.1271077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
Paper 35.3 91 2 from the previous stage. If the actual carry-in is ‘0’ then the sum multiplexed from the first unit is selected, alternatively if the carry-in is. ‘ 1 ’ then the sum from the second unit is selected. A carry select adder of arbitrary size can be deigned by cascading together an appropriate number of such 4-bit adders. This paper concentrates on designing a scheme for implementing self-checking carry-select adders. Several techniques have been proposed in recent years for designing self-checking adders [2][3][4]. Coding techniques such as Berger code, Residue code and arithmetic codes have been proposed for checking the hnctionality of the arithmetic units. a3 b3 a2 b2 al b l QO bO