Quasi-Universal VLSI Multiplier with Signed Digit Arithmetic
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
An algorithm is proposed for the design of a quasi-universal multiplier, i.e. one that can multiply two binary numbers and yield, upon instruction specification, the product in sign magnitude, two's complement or one's complement notation. The partial product matrix is created with direct multiplication and then reduced with signed digit additions.Keywords
This publication has 7 references indexed in Scilit:
- A high-speed multiplier using a redundant binary adder treeIEEE Journal of Solid-State Circuits, 1987
- High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition TreeIEEE Transactions on Computers, 1985
- Composite Parallel CountersIEEE Transactions on Computers, 1980
- A Compact High-Speed Parallel Multiplication SchemeIEEE Transactions on Computers, 1977
- A Two's Complement Parallel Array Multiplication AlgorithmIEEE Transactions on Computers, 1973
- A 40-ns 17-Bit by 17-Bit Array MultiplierIEEE Transactions on Computers, 1971
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964