Logic Networks of Carry-Save Adders

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.

[1]  Saburo Muroga,et al.  VLSI system design , 1982 .

[2]  Saburo Muroga,et al.  Optimal One-Bit Full Adders With Different Types of Gates , 1974, IEEE Transactions on Computers.

[3]  Stanislaw Majerski,et al.  NOR-Gate Binary Adder with Carry Completion Detection , 1967 .

[4]  O. L. Macsorley High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[5]  Saburo Muroga,et al.  Logic design and switching theory , 1979 .

[6]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[7]  Hung Chi Lai,et al.  Minimum Parallel Binary Adders with NOR (NAND) Gates , 1979, IEEE Transactions on Computers.

[8]  Jesse T. Quatse,et al.  A Parallel Accumulator for a General-Purpose Computer , 1967, IEEE Trans. Electron. Comput..