论文信息 - A Way to Build Efficient Carry-Skip Adders

A Way to Build Efficient Carry-Skip Adders

In this paper, we present a way to obtain efficient carry-skip adders, built with blocks of different sizes in VLSI technologies. We give some results about two-level carry-skip adders. We reduce our optimization problem to a geometrical problem, solved by means of an algorithm easily implemented on a microcomputer. Then we present an example of the realization of such an adder.

Jean-Michel Muller | Alain Guyot | Bertrand Hochet

[1] Daniel W. Dobberpuhl,et al. The design and analysis of VLSI circuits , 1985 .

[2] Joseph Cavanagh,et al. Digital Computer Arithmetic , 1983 .

[3] J. B. Gosling,et al. Review of high-speed addition techniques , 1971 .

[4] Daniel E. Atkins,et al. A comparison of ALU structures for VLSI technology , 1983, 1983 IEEE 6th Symposium on Computer Arithmetic (ARITH).

[5] K. Horninger,et al. A 32-bit execution unit in an advanced NMOS technology , 1982, IEEE Journal of Solid-State Circuits.

[6] Vojin G. Oklobdzija,et al. Some optimal schemes for ALU implementation in VLSI technology , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[7] M. Lehman,et al. Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic Units , 1961, IRE Trans. Electron. Comput..

[8] Joseph J. F. Cavanagh. Digital Computer Arithmetic: Design And Implementation , 1984 .

[9] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .

[10] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[11] Stanislaw Majerski. On Determination of Optimal Distributions of Carry Skips in Adders , 1967, IEEE Trans. Electron. Comput..

[12] M. Eugenio Valentinuzzi. Three-Valued Propositional Calculus of Lukasiewicz and Three-Position Double Switches , 1967, IEEE Trans. Electron. Comput..