摘要
为实现将给定的二元可逆函数快速综合为相应电路,并保持其结果的最优或较优,提出一种基于真值表变换的快速综合算法.可逆函数与置换同构,任意置换均可表示为若干对换的乘积,通过将可逆函数转化为一系列对换的乘积,从对换的乘积中综合电路.对于3bit逻辑电路只有28种对换,事先将28种对换的最优电路存入库中生成3bit电路综合基,通过在库中查找快速生成可逆电路.根据逻辑门可交换规则引入优化方法,完成快速综合算法.结果表明,该方法不但可以提高可逆逻辑综合的效率,而且结构简单,易于实现,可以O(4n)的时间效率快速综合任意3bit可逆逻辑电路,实现综合结果达到或接近最优.
To realize the synthesis of a certain reversible function rapidly, and make the result optimal or better, an algorithm based on the transformation of the truth table is proposed. A reversible function is isomorphic to a permutation and an arbitrary permutation can be expressed as a product of a series of swapping, thus the circuits can be generated in the product. Only 28 kinds of swapping exist for the 3 bit circuits, whose corresponding circuit blocks are stored into a library in advance as the bases of 3 bit circuits. Reversible logic circuits can be generated speedily by searching in this li- brary. Meanwhile, the rules based optimizing method is added to complete the rapid synthesis algo- rithm. The results show that this algorithm can improve the efficiency of synthesizing the reversible logic circuits. It is easy to realize and with simple structure. It can synthesize arbitrary reversible logic circuits rapidly with the time complexity of O(4^n) ,making the result reach or close to the optimal.
出处
《东南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2010年第1期58-63,共6页
Journal of Southeast University:Natural Science Edition
基金
国家自然科学基金资助项目(60572071
60873101)
江苏省自然科学基金资助项目(BM2006504
BK2007104)
关键词
可逆逻辑综合
真值表
对换
规则优化
reversible logic synthesis
truth table
swapping
rules based optimizing