A General Proof for Overlapped Multiple-Bit Scanning Multiplications
暂无分享,去创建一个
Stamatis Vassiliadis | Eric M. Schwarz | Don J. Hanrahan | E. Schwarz | S. Vassiliadis | D. J. Hanrahan
[1] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .
[2] O. L. Macsorley. High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.
[3] Christopher S. Wallace,et al. A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..
[4] Paul A. Wintz,et al. Fast Multipliers , 1970, IEEE Transactions on Computers.
[5] Louis P. Rubinfield. A Proof of the Modified Booth's Algorithm for Multiplication , 1975, IEEE Transactions on Computers.
[6] William J. Kubitz,et al. A Compact High-Speed Parallel Multiplication Scheme , 1977, IEEE Transactions on Computers.
[7] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .
[8] Luigi Dadda. Composite Parallel Counters , 1980, IEEE Transactions on Computers.
[9] Eric M. Schwarz. Parallel processing and VLSI design: Solving large-scale linear systems , 1984 .
[10] Hiroto Yasuura,et al. High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.
[11] N. Takagi,et al. A high-speed multiplier using a redundant binary adder tree , 1987 .
[12] E. Schwarz,et al. Quasi-universal VLSI multiplier with signed digit arithmetic , 1987, Proceedings of the 1987 IEEE Southern Tier Technical Conference, 1987..