2010 18th IEEE/IFIP International Conference on VLSI and System-on-Chip 2010
DOI: 10.1109/vlsisoc.2010.5642662
|View full text |Cite
|
Sign up to set email alerts
|

A decimal squarer with efficient partial product generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Different types of BCD or radix-10 multipliers have been designed by researchers to enhance BCD multiplication performance. signed digit radix-10 BCD multiplication using a multi-operand adder structure [6] offers improvements in performance in comparison with conventional BCD multiplier. Available binary-to-BCD converter uses for BCD digits multiplier (BDM) in [7], Gorgin's [7] multiplier design was based on the truth table for conversion of binary number into BCD digits and develops a new combinational design architecture for implementation on FPGA.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Different types of BCD or radix-10 multipliers have been designed by researchers to enhance BCD multiplication performance. signed digit radix-10 BCD multiplication using a multi-operand adder structure [6] offers improvements in performance in comparison with conventional BCD multiplier. Available binary-to-BCD converter uses for BCD digits multiplier (BDM) in [7], Gorgin's [7] multiplier design was based on the truth table for conversion of binary number into BCD digits and develops a new combinational design architecture for implementation on FPGA.…”
Section: Introductionmentioning
confidence: 99%
“…Multi-operand adder trees [6] implementation using state of art VLSI may results complex irregular layouts of BCD multiplier as compare with binary compressor trees and carry-save adders. PPR tree and ODDS base BCD multiplier [10,11] was limited for unsigned number multiplication only, with signed-digit and self-complementing codes theirs ODDS converters fail to convert the BCD to binary and vice-versa.…”
Section: Introductionmentioning
confidence: 99%