基于卡诺图的三变量可逆逻辑综合算法-计算机科学.pdfVIP

第 44 卷第6A 期 Vo l. 44 No. 6A 计算机科学 2017 年 6 月 CO岛1PUTER SCIENCE June 2017 基于卡诺图的三变量可逆逻辑综合算法 朱皖宁1 ， 2 刘志吴2 (金陵科技学院软件工程学院 南京 211199)1 (东南大学计算机科学与工程学院 南京 210096)2 摘 要 提出了一种基于卡诺图的可逆逻辑综合算法，该算法可以快速地求解带垃圾位的可逆逻辑综合问题。大量 特定的可逆逻辑门都不可避免地带有一定的垃圾位，如果使用真值表、置换群等经典可逆逻辑综合算法求解这些带垃 圾位的可逆逻辑门，则因无法获得全局状态而很难得到结果。根据卡诺图的特点，将可逆逻辑问题分解为多个变量分 别求解，无需关心全局状态。提出的卡诺图可逆逻辑综合算法根据在卡诺图上的邻接性将 3 变量可逆逻辑问题划分 为 5 个等价类;对每个等价类分别进行计算，在常数时间内解决了带垃圾位的可逆逻辑综合问题。 关键词 卡诺图，可逆逻辑综合，垃圾位，NCT 门库，扩展通用 TOFFLI 门 中固法分类号 TP387 ,TN91 1. 73 文献标识码 A Karnaugh-based Reversible Logic Circuit Synthesis Algorithm for 3-bits 1 2 ZHU Wan-ning ,2 LIU Zhi-ha0 CSchool of Software Engineeri吨，]inling Institute of Technology ,Nanjing 211199 ,China)1 (School of Computer Science and Engineering ,Southeast University ,Nanjing Z10096 ,China)2 Abstract This paper presented a new algorithm of reversible logic synthesis based on Kamaugh map. This algorithm can solve reversible logic synthesis with garbage bit very fast. Most of the specific reversible logic gates have some gar bage bits. It is very difficult to synthesize the reversible logic circuit with garbage by using the classical algorithms which are true table algorithm ,pe口nutation group algorithm and etc. The problem is that it is hardly to get the overall situation which the classical algorithms must need. The algorithm proposed in this paper does not care the overall situa tion and synthesizes every output variable respectively based on the feature of Kamaugh map.