Reversible Karatsuba's algorithm

Journal of Universal Computer Science

Volumn 12, Issue 5, 2006, Pages 499-511

  Kowada, L A B ^a   Portugal, R ^b   Figueiredo, C M H ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b LABORATÓRIO NACIONAL DE COMPUTAÇÃO CIENTÍFICA   (Brazil)

Author keywords

Arithmetic operations; Multiplier; Reversible circuit; Reversible computing

Indexed keywords

EID: 33745751003     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. D. Bechman, A. N. Chari, S. Devabhaktuni, and J. Preskill. Efficient networks for quantum factoring. Phys. Rev. A, 54:1034-1063, 1996.
2. C. H. Bennett. The logical reversibility of computation. IBM J. Res. Develop., 17:525-532, 1973.
3. C. H. Bennett. Time/space trade-offs for reversible computation. SIAM J. Comput., 18(4):766-776, 1989.
4. D.J. Bernstein. Fast multiplication and its applications. http://cr.yp.to/papers.html, 2003.
5. G. Cesari and R. Maeder. Performance analysis of the parallel Karatsuba multiplication algorithm for distributed memory architectures. J. Symb. Comput., 21(4-6):467-473, 1996.
6. N.S. Chang, C.H. Kim, Y.-H. Park, and J. Lim. A non-redundant and efficient architecture for Karatsuba-Ofman algorithm. In ISC, pages 288-299, 2005.
7. L.S. Cheng, A. Miri, and T.H. Yeap. Improved FPGA implementations of parallel Karatsuba multiplication over GF(2n). In In 23rd Biennial Symposium on Communications, 2006.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2nd edition, 2001.
9. T. G. Draper. Addition on a quantum computer, www.arxiv.org, 2000. quant-ph/0008033.
10. E. Fredkin and T. Toffoli. Conservative Logic. Internat. J. Theoret. Phys., 21:219-253, 1982.
11. T. Jebelean. Using the parallel Karatsuba algorithm for long integer multiplication and division. In European Conference on Parallel Processing, pages 1169-1172, 1997.
12. A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Soviet Physics - Doklady, 7(7):595-596, 1963.
13. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Develop., 5:183-191, 1961.
14. nu, oú θ est un "isomorphisme de codes". Comptes Rendus, 257:2597-2600, 1963.
15. R.Y. Levine and A. T. Sherman. A note on Bennett's time-space tradeoff for reversible computation. SIAM J. Comput., 19(4):673-677, 1990.
16. M. Li, J. Tromp, and P. Vitnyi. Reversible simulation of irreversible computation. Physica D, 120:168-176, 1998.
17. J. Preskill. Lecture Notes for Physics 229: Quantum Information and Computation. California Institute of Technology, September 1998.
18. A. Schönhage and V. Strassen. Schnelle multiplikation großer Zahlen. Computing, 7:281-292, 1971.
19. P. Shor. Algorithms of quantum computation: Discrete logarithm and factoring. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, pages 124-134, 1994.
20. V. Vedral, A. Barenco, and A. Ekert. Quantum networks for elementary arithmetic operations. Physical Review A, 54(1):147-153, 1996.
21. A. Weimerskirch and C. Paar. Generalizations of the Karatsuba algorithm for efficient implementations. Technical report, 2003.
22. W. K. Wooters and W. H. Zurek. A single quantum cannot be cloned. Nature, 299:802-803, 1982.
23. C. Zalka. Fast version of Shor's quantum factoring algorithm. 1998. quant-ph/9806084.
24. D. Zuras. More on squaring and multiplying large integers. IEEE Transactions on computers, 43(8):899-908, 1994.