Digital Design of a BCD Multiplication Scheme

Yi Nan Kong

doi:10.4028/www.scientific.net/AMM.63-64.90

Paper Titles

A Survey for Concept of Embedded Systems
p.73

Study on ANN Based Forecast Model of Weather Disease
p.77

Kinematics Simulation of Proprioceptive Mechanism for Vehicle Driving Simulator
p.82

Vertexes Arraying in Class A Surfaces Smoothing for Auto-Body
p.86

Digital Design of a BCD Multiplication Scheme
p.90

Features of Language Learning in Handheld Electronic Devices
p.94

The Design of Rotary Heat Exchangers
p.98

Study on EHL Film Thickness of Non-Rectangular Section Vane Seal
p.102

Quantum Particle Swarm Optimization Algorithm
p.106

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 63-64Digital Design of a BCD Multiplication Scheme

Digital Design of a BCD Multiplication Scheme

Abstract:

This paper presents a new scheme for BCD multiplication. This new scheme features a completely carry-free multiplication. The parallel structure of the new algorithm is investigated. This fast architecture was derived by looking at multiplication in a fresh perspective. A carry is able to be computed without performing multiplication on any of the previous bits. The new approach is expected to have a lot of potential contributions to digital design.

You might also be interested in these eBooks

Advanced Research on Mechanical Engineering, Industry and Manufacturing Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 63-64)

Pages:

90-93

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.63-64.90

Citation:

Cite this paper

Online since:

June 2011

Authors:

Yi Nan Kong

Keywords:

Computer Aided Design (CAD), Design in Microelectronics, Digital Design, Intelligent Multiplier Design

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D. Booth, A Signed Binary Multiplication Technique, Quarterly J. Mechanics and Applied Mathematics, vol. 4, p.236–240, (1951).

DOI: 10.1093/qjmam/4.2.236

Google Scholar

[2] L. P. Rubinfield, A Proof of the Modified Booth's Algorithm for Multiplication, IEEE Transactions on Computers, vol. 25, no. 10, p.1014–1015, (1970).

DOI: 10.1109/t-c.1975.224114

Google Scholar

[3] Y. H Seo and D. W. Kim, A New VLSI Architecture of Parallel Multiplier–Accumulator Based on Radix-2 Modified Booth Algorithm, IEEE Transactions on VLSI Systems, vol. 18, issue 2, p.201–208, (2010).

DOI: 10.1109/tvlsi.2008.2009113

Google Scholar

[4] S. R. Kuang and J. P. Wang, Design of Power-Efficient Configurable Booth Multiplier, IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 57, issue 3, p.568–580, (2010).

DOI: 10.1109/tcsi.2009.2023763

Google Scholar

[5] R. Baugh and B. A. Wooley, A Two's Complement Parallel Array Multiplication Algorithm, IEEE Transactions on Computers, vol. 22, p.1045–1047, (1973).

DOI: 10.1109/t-c.1973.223648

Google Scholar

[6] L. Ciminiera and P. Montuschi, Carry-Save Multiplication Schemes without Final Addition, IEEE Transactions on Computers, vol. 45, no. 9, p.1050–1055, (1996).

DOI: 10.1109/12.537128

Google Scholar

[7] S. Wallace, A Suggestion for a Fast Multiplier, IEEE Transactions on Electronic Computers, vol. 13, p.14–17, (1964).

Google Scholar

[8] M. Gok, M.J. Schulte and M. G. Arnold, Integer Multipliers with Overflow Detection, IEEE Transactions on Computers, vol. 55, no. 8 p.1062–1066, (2006).

DOI: 10.1109/tc.2006.126

Google Scholar

[9] B. Parhami, Carry-free addition of recoded binary signed-digit numbers, IEEE Transactions on Computers, vol. 37, issue 11, p.1470–1476, (2002).

DOI: 10.1109/12.8722

Google Scholar

[10] N. Weste and D. Harris, CMOS VLSI Design – A Circuits and Systems Perspective, 3rd ed., Pearson Education 2004, p.693–703.

Google Scholar

[11] B. Parhami, Computer Arithmetic – Algorithms and Hardwrae Designs, 2nd ed., Oxford 2009, p.177–195.

Google Scholar