论文信息 - Arithmetic Networks and Their Minimization Using a New Line of Elementary Units

Arithmetic Networks and Their Minimization Using a New Line of Elementary Units

A family of switching networks, called "arithmetic networks," is investigated. The elementary units of these networks are generalizations of full adders that can process input signals of different weights.

Angelo Raffaele Meo

[1] R. Mori. Suggestion for an i.c. fast parallel multiplier , 1969 .

[2] J. A. Githens,et al. Bulk Processing in Distributed Logic Memory , 1965, IEEE Trans. Electron. Comput..

[3] P. Csillag,et al. Iterative logical network for parallel multiplication , 1968 .

[4] Paul A. Wintz,et al. Fast Multipliers , 1970, IEEE Transactions on Computers.

[5] K. J. Dean. Design for a full multiplier , 1968 .

[6] H. H. Guild. Fully iterative fast array for binary multiplication and addition , 1969 .

[7] S. Vajda,et al. Integer Programming and Network Flows , 1970 .

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