A Low Power Fault Tolerant Reversible Decoder Using MOS Transistors

This paper demonstrates the reversible logic synthesis for the n-to-2n decoder, where n is the number of data bits. The circuits are designed using only reversible fault tolerant Fredkin and Feynman double gates. Thus, the entire scheme inherently becomes fault tolerant. Algorithm for designing the generalized decoder has been presented. In addition, several lower bounds on the number of constant inputs, garbage outputs and quantum cost of the reversible fault tolerant decoder have been proposed. Transistor simulations of the proposed decoder are shown using standard p-MOS 901 and n-MOS 902 model with delay of 0.030 ns and 0.12 m channel length, which proved the functional correctness of the proposed circuits. The comparative results show that the proposed design is much better in terms of quantum cost, delay, hardware complexity and has significantly better scalability than the existing approach.

[1]  Lafifa Jamal,et al.  Design of Optimal Reversible Carry Look-Ahead Adder with Optimal Garbage and Quantum Cost , 2012 .

[2]  Kamakoti Veezhinathan,et al.  Constructing Online Testable Circuits Using Reversible Logic , 2010, IEEE Transactions on Instrumentation and Measurement.

[3]  Michael P. Frank,et al.  The physical limits of computing , 2002, Computing in Science & Engineering.

[4]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[6]  David Eppstein,et al.  Interconnect Criticality-Driven Delay Relaxation , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Md. Rafiqul Islam,et al.  Reversible logic synthesis for minimization of full-adder circuit , 2003, Euromicro Symposium on Digital System Design, 2003. Proceedings..

[8]  S. Lloyd Quantum-Mechanical Computers , 1995 .

[9]  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.

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

[11]  Md. Rafiqul Islam,et al.  Implementation of multiple-valued flip-flips using pass transistor logic [flip-flips read flip-flops] , 2004, Euromicro Symposium on Digital System Design, 2004. DSD 2004..

[12]  Gerhard W. Dueck,et al.  A transformation based algorithm for reversible logic synthesis , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

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

[14]  Ahmad N. Al-Husban,et al.  Genetic Programs of Structural Evolution of Hybrid Electromechanical Objects , 2012 .

[15]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[16]  Ashis Kumer Biswas,et al.  Efficient approaches for designing reversible Binary Coded Decimal adders , 2008, Microelectron. J..

[17]  Hafiz Md. Hasan Babu,et al.  Implementation of Multiple-Valued Flip-Flips Using Pass Transistor Logic , 2004 .

[18]  S. Sasi,et al.  Fault tolerant error coding and detection using reversible gates , 2007, TENCON 2007 - 2007 IEEE Region 10 Conference.

[19]  Dimitris Gizopoulos,et al.  Accumulator-based test generation for robust sequential fault testing in DSP cores in near-optimal time , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[20]  Farah Sharmin,et al.  Design of a Compact Reversible Random Access Memory , 2011 .

[21]  Dhiraj K. Pradhan,et al.  Fault Tolerant Reversible Finite Field Arithmetic Circuits , 2008, 2008 14th IEEE International On-Line Testing Symposium.

[22]  M. Chrzanowska-Jeske Architecture and synthesis issues in FPGAs , 1993, Proceedings of NORTHCON'93 Electrical and Electronics Convention.

[23]  Lutz H.-J. Lampe,et al.  A stopping radius for the sphere decoder and its application to MSDD of DPSK , 2009, IEEE Communications Letters.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  B. Parhami,et al.  Fault-Tolerant Reversible Circuits , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.