Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions

By: Perkowski, M.; Hawash, M.; Hawash, A.; Caughman, J.; Bleiler, S.;

2011 / IEEE / 978-1-61284-427-5

Description

This item was taken from the IEEE Conference ' Reversible Function Synthesis of Large Reversible Functions with No Ancillary Bits Using Covering Set Partitions ' This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2n terms in memory or require a huge amount of time to yield results because they must calculate all possible permutations of an input vector. In contrast, the CSP algorithm harnesses the natural mathematical properties of binary numbers, partially ordered sets and covering graph theory, to construct input vectors which are guaranteed to produce valid results. A randomly selected subset of all valid input vectors are processed where the best input vector sequence wins. The CSP algorithm is capable of synthesizing functions of large number of variables (30 bits) in a reasonable amount of time.