Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Completion-detecting carry select addition

Completion-detecting carry select addition

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

IEE
Published

Logic analysis, circuit implementation and verification of a novel self-timed adder scheme based on carry select (CS) logic are presented. The preliminary analysis of the variable-time behaviour of CS logic justifies the design of self-timed CS adders, and identifies the best choice for the block size to optimise the average performance. The logic design and full-custom circuit implementation is described of a completion-detecting CS adder by means of precharged CMOS logic. The correct asynchronous operation of the circuit is verified by means of layout level SPICE simulation referring to a 0.35 μm CMOS process. The worst-case addition time is comparable with the fastest fixed-time adders, which is a considerable result for a completion-detecting technique. The hardware overhead can be limited to 23% over a conventional CS adder. SPICE simulation estimates an average detected addition time of 1.6 ns for a 64 bit adder, including the precharge time.

Inspec keywords: SPICE; circuit simulation; adders; logic design

Other keywords: self-timed adder scheme; SPICE simulation; fixed-time adders; CMOS process; logic analysis; circuit implementation; logic design; variable-time behaviour; full-custom circuit implementation; completion-detecting carry select addition

Subjects: Logic design methods; Electronic engineering computing; Digital circuit design, modelling and testing; Logic circuits; Logic and switching circuits

References

    1. 1)
      • O.J. BEDRIJ . Carry select adder. IRE Trans. , 340 - 346
    2. 2)
      • D.J. KINNIMENT . An evaluation of asynchronous addition. IEEE Trans. VLSI Syst. , 1 , 137 - 140
    3. 3)
      • D. JOHNSON , V. AKELLA . Design and analysis of asynchronous adders. IEE Proc., Comput. Digit. Tech. , 1
    4. 4)
      • R.P. Brent , H.T. Kung . A regular layout for parallel adders. IEEE Trans. , 260 - 264
    5. 5)
      • C.L. SEITZ , C. MEAD , L. CONWAY . (1980) System Timing, Introduction to VLSI systems design.
    6. 6)
      • T. Lynch , E.E. Swartzlander . A spanning tree carry lookahead adder. IEEE Trans. , 8 , 931 - 939
    7. 7)
      • H.E. Weste , K. Eshraghian . (1985) , Principles of CMOS VLSI design.
    8. 8)
      • , : Proceedings of the 4th international symposium on Advanced research in asynchronous circuits and systems, 1998, San Diego, CA, IEEE Computer Society Press.
    9. 9)
      • A. De Gloria , M. Olivieri . Statistical carry lookahead adders. IEEE Trans. , 3 , 340 - 347
    10. 10)
      • M. LEHMAN , N. BURLA . Skip techniques for high speed carry propagation in binary arithmetic units. IRE Trans. , 691 - 698
    11. 11)
      • BURKS, A.W., GOLDSTINE, H., VON NEUMANN, J.: `Preliminary discussion on the logical design of an electronic computing instrument', Technical report, 1947.
    12. 12)
      • J. SKALNSKY . An evaluation of several two-summand binary adders. IRE Trans. , 213 - 226
    13. 13)
      • M. AFGAHI , C. SVENSSON . Performance of synchronous and asynchronous design scheme for VLSI systems. IEEE Trans. , 7 , 838 - 872
    14. 14)
      • YUN, Y.K., NOWICK, S.M., BEEREL, P.A., DOOPLY, A.E.: `Speculative completion for the design of high performance asynchronous dynamic adders', Proceedings of ASYNC 97, 1997, Eindhoven, The Netherlands.
    15. 15)
      • OLIVIERI, M.: `Analytic model of the average addition time of carry select addition', Technical report, , Available at ftp://ssl.ing.uniromal.it/pub/reports/olivieri2.pdf.
    16. 16)
      • O.L. MAC SORLEY . High speed arithmetic in binary computers. IRE Proc. , 67 - 91
    17. 17)
      • B. BRILEY . Some new results on average worst case carry. IEEE Trans. , 459 - 463
    18. 18)
      • J.L. HENNESSY , D.A. PATTERSON . (1990) , Computer architecture: A Quantitative approach.
    19. 19)
      • G.W. REITWIESNER . The determination of carry propagation length for binary addition. IRE Trans. , 35 - 38
    20. 20)
      • (1994) IEEE Design and Test of Computers, special issue on asynchronous circuit and systems.
    21. 21)
      • YUN, Y.K., CHOU, W., BEEREL, P.A., GINOSAR, R., KOL, R., MYERS, C.J., ROTEM, , STEVENS, K.: `Average case optimized technology mapping for one-hot dual-rail domino circuits', Proceedings of ASYNC 98, 1998, San Diego, CA.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_20000451
Loading

Related content

content/journals/10.1049/ip-cdt_20000451
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address