Reversible logic has been considered as a promising direction in the field of low power design and quantum computing. However, synthesizing reversible circuits is totally different from that of irreversible circuits. Therefore,  several algorithms have been devoted to optimizing the synthesis process of reversible circuits in terms of the Quantum Cost (QC). BinaryDecision Diagram (BDD) based synthesis has been found as one of the dominant algorithms in reversible logic synthesis due to its scalability in synthesizing large-scale circuits within a reasonable synthesis time that is bounded by the BDD size. However, the QC of the synthesized circuit is strongly correlated with the used BDD size in the synthesis process, wherein each BDD node is substituted by a cascade of reversible gates. As a result, exploiting effective BDD reordering algorithms combined with BDD reduction rules turns out into less QC. In this paper, we propose a BDD reordering methodology wherein recently published swarm-based optimization algorithms are integrated compared in terms of the resultant BDD size. Experimental results  show that Moth-Flame Optimization (MFO) algorithm outperforms other algorithms on the public benchmarks

عنوان المؤتمر

مؤتمر IEEE الدولي الخامس عشر تصميم وتكنولوجيا النظم المتكاملة في عصر النانو

دولة المؤتمر

المغرب

تاريخ المؤتمر

1 إبريل، 2020 - 3 إبريل، 2020

راعي المؤتمر

IEEE

معلومات إضافية

موقع المؤتمر الإلكتروني