• DocumentCode
    3431448
  • Title

    Designing optimum carry-skip adders

  • Author

    Kantabutra, Vitit

  • Author_Institution
    Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USA
  • fYear
    1991
  • fDate
    26-28 Jun 1991
  • Firstpage
    146
  • Lastpage
    153
  • Abstract
    A method for designing optimum-speed one-level carry-skip adders is described. This method always yields the fastest adders if the assumptions of A. Guyot et al. (1987) hold, that is if the ripple time (a circuit parameter) of a carry signal is a linear function of the number of bit positions that the carry signal propagates through, and if the skip time (another circuit parameter) of a carry signal is a linear function of the number of blocks of bit positions skipped by the signal, or if these two parameters are such mildly nonlinear functions that can be modeled by a linear function without any effect on any of the results obtained. The circuit design method is useful because in device technologies such as 2-AlU CMOS the nonlinearities are often insignificant. The present results are compared with those of Guyot et al. as well as with the results of V.G. Oklobdzija and E.R. Barnes (1985)
  • Keywords
    CMOS integrated circuits; adders; digital arithmetic; logic design; 2-AlU CMOS; bit positions; blocks; carry signal; circuit design; circuit parameter; linear function; one-level carry-skip adders; ripple time; skip time; Adders; Circuits; Computer science; Costs; Delay; Design methodology; Ear; Energy consumption; Mathematics; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic, 1991. Proceedings., 10th IEEE Symposium on
  • Conference_Location
    Grenoble
  • Print_ISBN
    0-8186-9151-4
  • Type

    conf

  • DOI
    10.1109/ARITH.1991.145551
  • Filename
    145551