Design and Development of Vedic Mathematics based BCD Adder

In a conventional Binary Coded Decimal (BCD) representation is used in the scientific and computing calculation. Now they are also started to have impact in the processing unit. The only overhead in the converting the value from decimal to binary, processing and converting back to decimal. The direct reproduction of decimal value in computation produces the significant improvement in conversion and processing time. This paper is the extended version of Alp Arslan Bayracci and Ahmet Akkas et al of reduced delay Binary Coded Decimal (BCD) adder. When the design is simulated for the corner cases, the design was not responding as expected and we have proposed the modified design

[1]  David Y. Y. Yun,et al.  RBCD: redundant binary coded decimal adder , 1989 .

[2]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[3]  Herman H. Goldstine,et al.  Preliminary discussion of the logical design of an electronic computing instrument (1946) , 1989 .

[4]  Ahmet Akkas,et al.  Reduced Delay BCD Adder , 2007, 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP).

[5]  Michael J. Schulte,et al.  A 64-bit decimal floating-point adder , 2004, IEEE Computer Society Annual Symposium on VLSI.

[6]  A. A. Bayrakci,et al.  An Efficient Vanishing Point Detection by Clustering on the Normalized Unit Sphere , 2007 .

[7]  Michael F. Cowlishaw,et al.  Decimal floating-point: algorism for computers , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[8]  Wilfried Buchholz.  Fingers or fists? (the choice of decimal or binary representation) , 1959, CACM.

[9]  A. Weinberger,et al.  High Speed Decimal Addition , 1971, IEEE Transactions on Computers.