Design of a reversible bidirectional barrel shifter

Reversible logic has promising applications in the field of quantum computing, optical computing, low power computing, and other emerging computing technologies. A barrel shifter that can shift and rotate multiple bits in a single cycle is an important component of many computing units. This paper presents the reversible design of bidirectional arithmetic and logical barrel shifter. The proposed design consists of the reversible Fredkin and Feynman gates. The Fredkin gate used in the design of reversible bidirectional arithmetic and logical barrel shifter can implement the 2∶1 MUX with minimum quantum cost, minimum number of ancilla bits and minimum number of garbage outputs while the Feynman gate is used to avoid the fanout as fanout is not allowed in the reversible logic. The design is evaluated in terms of number of garbage outputs, quantum cost and number of ancilla bits.

[1]  N. Ranganathan,et al.  Design of efficient reversible logic-based binary and BCD adder circuits , 2013, JETC.

[2]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[3]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[4]  Hafiz Md. Hasan Babu,et al.  An Efficient Design of a Reversible Barrel Shifter , 2010, 2010 23rd International Conference on VLSI Design.

[5]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[6]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[7]  D. M. Miller,et al.  Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis , 2005, quant-ph/0511008.

[8]  N. Ranganathan,et al.  Design of reversible sequential circuits optimizing quantum cost, delay, and garbage outputs , 2010, JETC.

[9]  Himanshu Thapliyal,et al.  Design of A ternary barrel shifter using multiple-valued reversible logic , 2010, 10th IEEE International Conference on Nanotechnology.

[10]  DiVincenzo,et al.  Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[11]  Hafiz Md. Hasan Babu,et al.  Efficient Design of Shift Registers Using Reversible Logic , 2009, 2009 International Conference on Signal Processing Systems.

[12]  Guowu Yang,et al.  Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Pérès,et al.  Reversible logic and quantum computers. , 1985, Physical review. A, General physics.

[14]  Mozammel H. A. Khan,et al.  Quantum ternary parallel adder/subtractor with partially-look-ahead carry , 2007, J. Syst. Archit..

[15]  Rolf Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[16]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[17]  N. Ranganathan,et al.  Design of Efficient Reversible Binary Subtractors Based on a New Reversible Gate , 2009, 2009 IEEE Computer Society Annual Symposium on VLSI.

[18]  Amir Kaivani,et al.  Reversible Barrel Shifters , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.