An Improved Booth’s Recoding for Optimal Fault-Tolerant Reversible Multiplier

Authors

  • T Kavitha HITS College Rangereddy District
  • B Karunaiah HITS College Rangereddy District

Keywords:

Modified Booth Encoding, higher speed, lower cost, less VLSI area

Abstract

Multiplication may be a for the most part used mathematical process, considerably in signal process and scientific applications. Multiplication having hardware challenge, and therefore the main criterion of upper speed, lower cost, and fewer VLSI space, the most apprehension in customary multiplication, typically realized by K no of cycles with shifting and adding, is to hurry up the underlying multi-operand addition of partial merchandise. during this paper we have a tendency to studied the changed Booth encryption (MBE) technique that has been introduced to scale back the quantity of PP rows, still keeping each straightforward and quick enough the generation method of every row.

References

R. Landauer, “Irreversibility and Heat Generation in the Computational Process”, IBM Journal of Research and Development, 5, pp. 183-191, 1961.

C.H. Bennett, “Logical Reversibility of Computation”, IBM J.Research and Development, pp. 525-532, November 1973.

T. Toffoli., “Reversible Computing”, Tech memo MIT/LCS/TM-151, MIT Lab for Computer Science (1980).

E. Fredkin and T. Toffoli, “Conservative logic,” Int’l J. Theoretical Physics, Vol. 21, pp.219–253, 1982.

R. Feynman, “Quantum Mechanical Computers,” Optics News, Vol.11, pp. 11–20, 1985.

B. Parhami; “Fault Tolerant Reversible Circuits” Proc. 40th Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA,Oct.2006.

A. Peres, “Reversible Logic and Quantum Computers”, Physical review A, 32:3266- 3276, 1985.

W. N. N. Hung, X. Song, G. Yang, J. Yang and M. Perkowski, “Quantum Logic Synthesis by Symbolic Reachability Analysis”, Proc. 41st annual

Downloads

Published

2014-10-31

How to Cite

[1]
T. Kavitha and B. Karunaiah, “An Improved Booth’s Recoding for Optimal Fault-Tolerant Reversible Multiplier”, Int. J. Comp. Sci. Eng., vol. 2, no. 10, pp. 30–32, Oct. 2014.

Issue

Section

Research Article