BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis

Computer Science – Hardware Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 11 figures, 2 tables

Scientific paper

In this paper, we have introduced the notion of UselessGate and ReverseOperation. We have also given an algorithm to implement a sorting network for reversible logic synthesis based on swapping bit strings. The network is constructed in terms of n*n Toffoli Gates read from left to right and it has shown that there will be no more gates than the number of swappings the algorithm requires. The gate complexity of the network is O(n2). The number of gates in the network can be further reduced by template reduction technique and removing UselessGate from the network.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and BSSSN: Bit String Swapping Sorting Network for Reversible Logic Synthesis will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-331317

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.