Logo des Repositoriums
 
Konferenzbeitrag

Self-checking carry-select adder with sum-bit duplication

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2004

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

In this paper the first code-disjoint totally self-checking carry-select adder is proposed. The adder blocks are fast ripple adders with a single NAND-gate delay for carry-propagation per cell. In every adder block both the sum-bits and the corresponding inverted sum-bits are simultaneously implemented. The parity of the input operands is checked against the X OR-sum of the propagate signals. For 64 bits area and maximal delay are determined by the SYNOPSYS CAD tool of the EUROCHIP project. Compared to a 64 bit carry-select adder without error detection the delay of the most significant sum-bit does not increase. Compared to a completely duplicated code-disjoint carry-select adder we save 240 X OR-gates.

Beschreibung

Sogomonyan, E. S.; Marienfeld, D.; Ocheretnij, V.; Gössel, M. (2004): Self-checking carry-select adder with sum-bit duplication. ARCS 2004 – Organic and pervasive computing. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 3-88579-370-9. pp. 84-91. Regular Research Papers. Augsburg. March 26, 2004

Schlagwörter

Zitierform

DOI

Tags