Efficient algorithms for optimal 4-bit reversible logic system synthesis
Summary: Owing to the exponential nature of the memory and run-time complexity, many methods can only synthesize 3-bit reversible circuits and cannot synthesize 4-bit reversible circuits well. We mainly absorb the ideas of our 3-bit synthesis algorithms based on hash table and present the efficient algorithms which can construct almost all optimal 4-bit reversible logic circuits with many types of gates and at mini-length cost based on constructing the shortest coding and the specific topological compression; thus, the lossless compression ratio of the space of \(n\)-bit circuits reaches near \(2 \times n!\). This paper presents the first work to create all 3120218828 optimal 4-bit reversible circuits with up to 8 gates for the CNT (Controlled-NOT gate, NOT gate, and Toffoli gate) library, and it can quickly achieve 16 steps through specific cascading created circuits.
- A reversible logic synthesis algorithm based on the transformation of the truth table
- Optimal synthesis of linear reversible circuits
- Optimal 4-bit reversible mixed-polarity Toffoli circuits
- Synthesis of reversible circuits with minimal costs
- Synthesis and optimization of reversible circuits -- a survey
- Optimized 4-bit quantum reversible arithmetic logic unit
- A reversible logic synthesis algorithm based on the transformation of the truth table
- Optimal 4-bit reversible mixed-polarity Toffoli circuits
- Optimal synthesis of linear reversible circuits
- Novel parity-preserving designs of reversible 4-bit comparator
- Minimal reversible circuit synthesis on a DNA computer
This page was built for publication: Efficient algorithms for optimal 4-bit reversible logic system synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375481)
