Modulo p=3 checking for a carry select adder
- In this paper a self-checking carry select adder is proposed. The duplicated adder blocks which are inherent to a carry select adder without error detection are checked modulo 3. Compared to a carry select adder without error detection the delay of the MSB of the sum of the proposed adder does not increase. Compared to a self-checking duplicated carry select adder the area is reduced by 20%. No restrictions are imposed on the design of the adder blocks
Author details: | Vitalij Ocheretnij, Michael GösselGND, Egor S. Sogomonyan, Daniel Marienfeld |
---|---|
URL: | http://www.springerlink.com/content/100286 |
DOI: | https://doi.org/10.1007/s10836-006-6260-8 |
Publication type: | Article |
Language: | English |
Year of first publication: | 2006 |
Publication year: | 2006 |
Release date: | 2017/03/24 |
Source: | Journal of electronic testing-theory and applications. - 22 (2006), 1, S. 101 - 107 |
Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science |
Peer review: | Referiert |
Institution name at the time of the publication: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik |