1. A Don’t-Care-Based Approach to Reducing the Multiplicative Complexity in Logic Networks.
- Author
-
Liu, Hsiao-Lun, Li, Yi-Ting, Chen, Yung-Chih, and Wang, Chun-Yao
- Subjects
LOGIC circuits ,QUANTUM computing ,LOGIC ,CRYPTOGRAPHY - Abstract
Reducing the number of AND gates in logic networks benefits the applications in cryptography, security, and quantum computing. This work proposes a don’t-care-based (DC-based) 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 $10\times $ on average for the cryptography benchmarks while having competitive results as compared to the flow in the state-of-the-art. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF