A Two's Complement Parallel Array Multiplication Algorithm
From MaRDI portal
Publication:3213101
DOI10.1109/T-C.1973.223648zbMath0269.94017MaRDI QIDQ3213101
Charles Richmond Baugh, Bruce A. Wooley
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (9)
Modular multiplication using the core function in the residue number system ⋮ Cost-efficient design of a quantum multiplier-accumulator unit ⋮ An optimized quantum circuit for converting from sign-magnitude to two's complement ⋮ VLSI implementation of area-efficient truncated modified booth multiplier for signal processing applications ⋮ An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding ⋮ GENERAL COST FACTORS FOR MULTIPLE‐VALUED LOGIC DESIGN OF ARITHMETIC UNITS ⋮ Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs ⋮ Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems ⋮ A concurrent system for the computation of higher-order moments
This page was built for publication: A Two's Complement Parallel Array Multiplication Algorithm
