State assignment using a new embedding method based on an intersecting cube theory
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Two-level logic minimization: an overview
Integration, the VLSI Journal
A tool for processor instruction set design
EURO-DAC '94 Proceedings of the conference on European design automation
Synthesis of finite state machines: logic optimization
Synthesis of finite state machines: logic optimization
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Exact Dichotomy-based Constrained Encodi
ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
| Hi-index | 0.00 |
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all faces of minimum length. Increasing dimensions of the Boolean space are explored; for a given dimension constraints are satisfied one at a time. The following features help to reduce the nodes of the solution space that must be explored: candidate cubes instead of candidate codes are generated, cubes yielding symmetric solutions are not generated, a smaller sufficient set of solutions (producing basic sections) is explored, necessary conditions help discard unsuitable candidate cubes, early detection that a partial solution cannot be extended to be a global solution prunes infeasible portions of the search tree. We have implemented a prototype package minsk based on the previous ideas and run experiments to evaluate it. The experiments show that minsk is faster and solves more problems than any available algorithm. Moreover, minsk is a robust algorithm, while most of the proposed alternatives are not. Besides most problems of the complete MCNC benchmark suite, other solved examples include an important set of decoder PLAs coming from the design of microprocessor instruction sets.