Technology Scaling Effects on Multipliers
暂无分享,去创建一个
[1] TakagiNaofumi,et al. High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985 .
[2] Michael J. Flynn,et al. Optimum Placement and Routing of Multiplier Partial Product Trees , 1996 .
[3] Michael J. Flynn,et al. Binary multiplication Using Partially Redundant Multiples , 1992 .
[4] Mark R Santoro. Design and Clocking of VLSI Multipliers , 1989 .
[5] Makoto Suzuki,et al. A 1.5-ns 32-b CMOS ALU in double pass-transistor logic , 1993 .
[6] O. L. Macsorley. High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.
[7] D. Zuras,et al. Balanced delay trees and combinatorial division in VLSI , 1986 .
[8] Vojin G. Oklobdzija,et al. A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.
[9] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .
[10] G. De Micheli,et al. Circuit and architecture trade-offs for high-speed multiplication , 1991 .
[11] Francis Jutand,et al. A class of close-to-optimum adder trees allowing regular and compact layout , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[12] Ansi Ieee,et al. IEEE Standard for Binary Floating Point Arithmetic , 1985 .
[13] William J. Kubitz,et al. A Compact High-Speed Parallel Multiplication Scheme , 1977, IEEE Transactions on Computers.
[14] Christopher S. Wallace,et al. A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..
[15] Michael J. Flynn,et al. Limits of Scaling MOSFETs , 1995 .