English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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

基于卡诺图的三变量可逆逻辑综合算法 (Karnaugh-based Reversible Logic Circuit Synthesis Algorithm for 3-bits).