Optimum functional decomposition using encoding
DAC '94 Proceedings of the 31st annual Design Automation Conference
Fast post-placement rewiring using easily detectable functional symmetries
Proceedings of the 37th Annual Design Automation Conference
Introduction to algorithms
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Sequential Logic Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Don't cares and multi-valued logic network minimization
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
VLSID '99 Proceedings of the 12th International Conference on VLSI Design - 'VLSI for the Information Appliance'
Reducing Multi-Valued Algebraic Operations to Binary
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Simulation and SAT-based Boolean matching for large Boolean networks
Proceedings of the 46th Annual Design Automation Conference
BDD minimization using symmetries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
NOVA: state assignment of finite state machines for optimal two-level logic implementation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fast computation of symmetries in Boolean functions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimal State Assignment for Finite State Machines
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In high-level designs, variables are often naturally represented in a symbolic multi-valued form. Binary encoding is an essential step in realizing these designs in Boolean circuits. This paper poses the encoding problem with the objective of maximizing the degree of symmetry, which has many useful applications in logic optimization, circuit rewiring, functional decomposition, etc. In fact, it is guaranteed that there exists a full symmetry encoding with respect to every input multi-valued variable for all multi-valued functions. We propose effective computation for finding such encoding by solving a system of subset-sum constraints. Experiments show unique benefits of symmetry encoding.