Comparison Among Booth’s and Pekmestzi’s Algorithms for the Multiplication of Two Numbers
暂无分享,去创建一个
Roberto Rojas-Laguna | O. Vite-Chavez | E. Alvarado-Méndez | I. E. Villalon-Turrubiates | S. Serrano-Arellano | Julian M. Estudillo-Ayala
[1] O. L. Macsorley. High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.
[2] Bruce A. Wooley,et al. A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.
[3] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .
[4] H. H. Guild. Fully iterative fast array for binary multiplication and addition , 1969 .
[5] P. Csillag,et al. Iterative logical network for parallel multiplication , 1968 .
[6] R. Mori. Suggestion for an i.c. fast parallel multiplier , 1969 .
[7] Kai Hwang. Global and Modular Two's Complement Cellular Array Multipliers , 1979, IEEE Trans. Computers.
[8] Kiamal Pekmestzi,et al. Multiplexer-based array multipliers , 1999 .
[9] D. P. Burton,et al. High-speed iterative multiplier , 1968 .