A Two's Complement Parallel Array Multiplication Algorithm

DOI10.1109/T-C.1973.223648MaRDI QIDQ3213101zbMATH OpenFDO

Authors Charles Richmond Baugh, Bruce A. Wooley

Publication date 1973

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1973.223648

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• A concurrent system for the computation of higher-order moments
• Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
• Cost-efficient design of a quantum multiplier-accumulator unit
• An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding
• Modular multiplication using the core function in the residue number system
• An optimized quantum circuit for converting from sign-magnitude to two's complement
• GENERAL COST FACTORS FOR MULTIPLE‐VALUED LOGIC DESIGN OF ARITHMETIC UNITS
• Quantum circuit designs of efficient squaring
• Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
• VLSI implementation of area-efficient truncated modified booth multiplier for signal processing applications

This page was built for publication: A Two's Complement Parallel Array Multiplication Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3213101)