Logo image
A Don't-Care-Based Approach to Reducing the Multiplicative Complexity in Logic Networks
期刊文章   同儕審查

A Don't-Care-Based Approach to Reducing the Multiplicative Complexity in Logic Networks

Hsiao-Lun Liu, Yi-Ting Li, Yung-Chih ChenChun-Yao Wang
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2022

摘要

Circuit faults;Complexity theory;Cryptography;Donνll Logic gates;Merging;Quantum circuit;SAT.;textnormal Multiplicative Complexity;Transforms;XOR-AND Graphs (XAGs) Software Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering

Reducing the number of AND gates in logic networks benefits the applications in cryptography, security, and quantum computing. This work proposes a don&null approach to reduce the number of AND gates further in the well-optimized network. Furthermore, this work also proposes an enhanced synthesis flow by integrating our approach with the state-of-the-art. The experimental results show that our approach can further reduce up to 25% of the number of AND gates in the network. For the experiments about the enhanced synthesis flow, we achieve a speedup of almost 10X on average for the cryptography benchmarks while having competitive results as compared to the flow in the state-of-the-art.

相關連結

指標

1 檢視次數

詳細資料

Logo image