Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary multiplier
Description:
A digital circuit or algorithm that multiplies two numbers represented in binary form.
Primary topic:
Low-power high-performance VLSI design (42%)
Related topics:
Low-power high-performance VLSI design (42%),
Cryptography and Residue Arithmetic (15%),
Numerical Methods and Algorithms (14%)
Wikidata ID:
wiki/Q1377144
OpenAlex ID:
keywords/binary-multiplier
Principles in the Evolutionary Design of Digital Circuits—Part I
2000
·
Julian F. Miller
, Dominic Job
, et al.
·
Genetic Programming and Evolvable Machines
·
290
Modified Booth Multipliers With a Regular Partial Product Array
2009
·
Shiann-Rong Kuang
, Jiun-Ping Wang
, et al.
·
IEEE Transactions on Circuits & Systems II Express Briefs
·
213
The Advantages of Landscape Neutrality in Digital Circuit Evolution
2000
·
Vesselin K. Vassilev
, Julian F. Miller
·
Lecture notes in computer science
·
179
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
2021
·
Mashiyat Zaman
, Kotaro Tanahashi
, et al.
·
IEEE Transactions on Computers
·
167
PDF
A high-speed multiplier using a redundant binary adder tree
1987
·
Y. Harata
, Y. Nakamura
, et al.
·
IEEE Journal of Solid-State Circuits
·
152
A new design technique for column compression multipliers
1995
·
Zhongde Wang
, G.A. Jullien
, et al.
·
IEEE Transactions on Computers
·
137
Low-power 4-2 and 5-2 compressors
2001
·
K. Prasad
, K.K. Parhi
·
Asilomar Conference on Signals, Systems and Computers (ACSSC)
·
133
A VHDL primer
1995
·
Jayaram Bhasker
·
121
Towards the automatic design of more efficient digital circuits
2000
·
V.K. Vassilev
, D. Job
, et al.
·
NASA/DoD Conference on Evolvable Hardware
·
118
New efficient structure for a modular multiplier for RNS
2000
·
A.A. Hiasat
·
IEEE Transactions on Computers
·
65
New memoryless, mod (2 n ±1) residue multiplier
1992
·
A. Hiasat
·
Electronics Letters
·
61
High performance 5 : 2 compressor architectures
2006
·
R. Menon
, D. Radhakrishnan
·
IEE Proceedings - Circuits Devices and Systems
·
51
Design Of High-Speed Modified Booth Multipliers Operating At Ghz Ranges
2010
·
Soojin Kim
, Kyeongsoon Cho
·
Zenodo (CERN European Organization for Nuclear Research)
·
48
Design and implementation of efficient multiplier using vedic mathematics
2011
·
J.M. Rudagi
, V. Amblr
, et al.
·
International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom)
·
47
A 1.2-Ns16×16-Bit Binary Multiplier Using High Speed Compressors
2010
·
A. Dandapat
, S. Ghosal
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
·
47
On fast IEEE rounding
1991
·
Nhon Quach
, Naofumi Takagi
, et al.
·
44
Design of efficient binary multiplier architecture using hybrid compressor with FPGA implementation
2024
·
V. Thamizharasan
, V. Parthipan
·
Scientific Reports
·
43
PDF
Comparison of a 32-bit Vedic multiplier with a conventional binary multiplier
2014
·
Abhyarthana Bisoyi
, Mitu Baral
, et al.
·
IEEE International Conference on Advanced Communications, Control and Computing Technologies
·
42
Modified Binary Multiplier Circuit Based on Vedic Mathematics
2019
·
Shamim Akhter
, Saurabh Chaturvedi
·
International Conference on Signal Processing and Integrated Networks (SPIN)
·
40
An efficient floating point multiplier design for high speed applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm
2015
·
S Arish
, R. K. Sharma
·
37
PDF
A VLSI modulo m multiplier
1991
·
G. Alia
, E. Martinelli
·
IEEE Transactions on Computers
·
37
Parallel decimal multipliers using binary multipliers
2010
·
Mario P. Vestias
, Horacio C. Neto
·
Southern Conference on Programmable Logic (SPL)
·
36
A well-structured modified Booth multiplier design
2008
·
Li-Rong Wang
, Shyh-Jye Jou
, et al.
·
International Symposium on VLSI Design, Automation and Test
·
35
Design of Approximate Radix-256 Booth Encoding for Error-Tolerant Computing
2022
·
Feiyu Zhu
, Shaowei Zhen
, et al.
·
IEEE Transactions on Circuits & Systems II Express Briefs
·
33
Fast multipliers for two's-complement numbers in serial form
1985
·
Luigi Dadda
·
IEEE Symposium on Computer Arithmetic (ARITH)
·
33
Show more works
View as search
Works count:
276
Citation count:
3,281
Year
Topic
Type