loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th IEEE Symposium on Computer Arithmetic (ARITH'05)
Parallel Prefix Adder Design with Matrix Representation
Cape Cod, Massachusetts, USA
June 27-June 29
ISBN: 0-7695-2366-8
Youngmoon Choi, Sun Microsystems, Inc.
Earl E. Swartzlander. Jr., University of Texas at Austin
This paper presents a one-shot batch process that generates a wide range of designs for a group of parallel prefix adders. The prefix adders are represented by two two-dimensional matrixes and two vectors. This matrix representation makes it possible to compose two functions for gate sizing which calculate the delay and the total transistor width of the carry propagation graph of adders. After gate sizing, the critical path net-lists of the carry propagation graph are generated from the matrix representation for spice delay calculation. The process is illustrated by generating sets of delay and total transistor width pairs for 32-bit and 64-bit cases.
Citation:
Youngmoon Choi, Earl E. Swartzlander. Jr., "Parallel Prefix Adder Design with Matrix Representation," arith, pp.90-98, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.