z-logo
open-access-imgOpen Access
DESIGN OF AN EFFICIENT REVERSIBLE LOGIC BASED BIDIRECTIONAL BARREL SHIFTER
Author(s) -
O. Anjaneyulu,
T. Pradeep,
C. R. R. M. Reddy
Publication year - 2013
Publication title -
international journal of electronic signal and systems
Language(s) - English
Resource type - Journals
ISSN - 2231-5969
DOI - 10.47893/ijess.2013.1151
Subject(s) - reversible computing , computer science , toffoli gate , logic gate , arithmetic , truth table , multiplexer , quantum computer , gate count , parallel computing , computer hardware , computer engineering , algorithm , quantum , quantum gate , mathematics , multiplexing , telecommunications , physics , quantum mechanics
Embedded digital signal processors and general purpose processors will use barrel shifters to manipulate data. This paper will present the design of the barrel shifter that performs logical shift right, arithmetic shift right, rotate right, logical shift left, arithmetic shift left, and rotate left operations. The main objective of the upcoming designs is to increase the performance without proportional increase in power consumption. In this regard reversible logic has become most popular technology in the field of low power computing, optical computing, quantum computing and other computing technologies. Rotating and data shifting are required in many operations such as logical and arithmetic operations, indexing and address decoding etc. Hence barrel shifters which can shift and rotate multiple bits in a single cycle have become a common choice of design for high speed applications. The design has been done using reversible fredkin and feynman gates. In the design the 2:1 mux can be implemented by fredkin gate which reduce quantum cost, number of ancilla bits and number of garbage outputs. The feynman gate will remove the fanout. By comparing the quantum cost, number of ancilla bits and number of garbage outputs the design is evaluated.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here