Sökning: "Boolean decomposition"
Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Boolean decomposition.
1. Advanced algorithms for boolean decomposition
Sammanfattning : .... LÄS MER
2. Advances in Functional Decomposition: Theory and Applications
Sammanfattning : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. LÄS MER
3. Boolean decomposition in combinational logic synthesis
Sammanfattning : .... LÄS MER
4. Dominator-based Algorithms in Logic Synthesis and Verification
Sammanfattning : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. LÄS MER
5. Graph dominators in logic synthesis and verification
Sammanfattning : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. LÄS MER