DocumentCode :
834311
Title :
Efficient reversible and quantum implementations of symmetric Boolean functions
Author :
Maslov, D.
Author_Institution :
Dept. of Comput. Sci., Univ. of Victoria, BC
Volume :
153
Issue :
5
fYear :
2006
fDate :
10/1/2006 12:00:00 AM
Firstpage :
467
Lastpage :
472
Abstract :
It is a well-known fact in logic design that synthesis of some special classes of Boolean functions is often easier than the synthesis of a general unrestricted specification. In reversible logic, well-scaled synthesis methods with a reasonably small cost of the associated implementation have been found for only a few classes of functions. This includes synthesis of multiple-output symmetric and reversible linear functions. The author presents an efficient reversible/quantum synthesis method for the class of multiple-output symmetric functions. The method is purely theoretical, therefore its scaling on functions with a large number of inputs/outputs requires minimal resources. The author calculates garbage, i.e. the number of outputs that are not required by the function specification, the number of reversible gates, and the quantum cost of the presented implementations. The proposed approach is then applied to the synthesis of benchmark functions. Comparison of the designs to the previously reported implementations is favourable
Keywords :
Boolean functions; logic design; function specification; logic design; multiple-output symmetric functions; quantum synthesis method; reversible gates; reversible linear functions; reversible logic; symmetric Boolean functions;
fLanguage :
English
Journal_Title :
Circuits, Devices and Systems, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2409
Type :
jour
DOI :
10.1049/ip-cds:20045213
Filename :
4015856
Link To Document :
بازگشت