Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Logic Networks of Carry-Save Adders

Published: 01 September 1982 Publication History
  • Get Citation Alerts
  • Abstract

    logic networks of carry-save adders such as high-speed multipliers, multioperand adders, and double-rail input parallel adders are designed based on the parallel adders with a minimum number of NOR gates discussed in [1]. After a discussion of the derivation of carry-save adder modules (CSAM's) by the integer programming logic design method, general design procedures are illustrated with example networks. Compared to conventional networks of carry-save adders, the derived networks of carry-save adder modules (NOCSAM's) have the advantages of fewer gates, fewer connections, and faster operation. In particular, the parallel adder of NOR gates in double-rail input logic obtained has six gates and 15 connections per stage, whereas the previously known best design under the same condition requires six gates and 17 connections per stage with the same carry propagation delay.

    References

    [1]
    H. C. Lai and S. Muroga, "Minimum parallel binary adders with NOR (NAND) gates," IEEE Trans. Comput. , vol. C-28, pp. 648-659, Sept. 1979.
    [2]
    J. E. Partridge, "Cascade adder improves system speed for high-speed multiply operations," EDN , vol. 18, pp. 74-77, Apr. 1973.
    [3]
    O. L. MacSorley, "High-speed arithmetic in binary computers," Proc. IRE , vol. 49, pp. 67-91, Jan. 1961.
    [4]
    S. Majerski and M. Wiweger, "NOR-gate binary adder with carry completion detection," IEEE Trans. Electron. Comput. , vol. EC- 16, pp. 45-58, Feb. 1967.
    [5]
    J. T. Quatse and R. A. Keir, "A parallel accumulator for a generalpurpose computer," IEEE Trans. Electron. Comput. , vol. EC- 16, pp. 165-171, Apr. 1967.
    [6]
    T. K. Liu, K. R. Hohulin, L. E. Shiau, and S. Muroga, "Optimal one-bit full adders with different types of gates," IEEE Trans. Comput. , vol. C-23, pp.63-69, Jan. 1974.
    [7]
    H. C. Lai, "A study of current logic design problems," Ph.D. dissertation, Dep. Comput. Sci., Univ. Illinois, Urbana, Jan. 1976.
    [8]
    C. S. Wallace, "A suggestion for a fast multiplier," IEEE Trans. Electron. Comput. , vol. EC-13, pp. 14-17, Feb. 1964.
    [9]
    S. Muroga, Logic Design and Switching Theory . New York: Wiley, 1979.
    [10]
    S. Muroga, VLSI System Design . New York: Wiley, 1982.

    Cited By

    View all

    Index Terms

    1. Logic Networks of Carry-Save Adders
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image IEEE Transactions on Computers
      IEEE Transactions on Computers  Volume 31, Issue 9
      September 1982
      113 pages

      Publisher

      IEEE Computer Society

      United States

      Publication History

      Published: 01 September 1982

      Author Tags

      1. Carry–save adders
      2. Carry-save adders
      3. NAND gates
      4. NOR gates
      5. full adders
      6. input bundles
      7. logic design
      8. multioperand adders
      9. multipliers
      10. output bundles
      11. parallel adder in double-rail input logic

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 27 Jul 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media