loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Automation and Test in Europe Conference and Exhibition Volume II (DATE'04)
Paris, France
February 16-February 20
ISBN: 0-7695-2085-5
E. S. Sogomonyan, University of Potsdam
D. Marienfeld, University of Potsdam
V. Ocheretnij, University of Potsdam
M. G?ssel, University of Potsdam
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 XOR-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. The area is 170% of a 64 bit carry-select adder (without error detection and not code-disjoint).
Citation:
E. S. Sogomonyan, D. Marienfeld, V. Ocheretnij, M. G?ssel, "A New Self-Checking Sum-Bit Duplicated Carry-Select Adder," date, vol. 2, pp.21360, Design, Automation and Test in Europe Conference and Exhibition Volume II (DATE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.