Search for dissertations about: "dominators"

Found 4 swedish dissertations containing the word dominators.

  2. 1. Graph dominators in logic synthesis and verification

    Author : René Krenz; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

    Abstract : 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. READ MORE

  4. 2. Dominator-based Algorithms in Logic Synthesis and Verification

    Author : René Krenz-Bååth; Johnny Öberg; Joao Marques-Silva; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; graph dominators; formal verification; logic synthesis; equivalence checking; decomposition; Electrical engineering; Elektroteknik;

    Abstract : 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. READ MORE

  5. 3. All Around Logic Synthesis

    Author : Maxim Teslenko; Hannu Tenhunen; Michel Berklaar; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; graph dominators; FPGA mapping; redundancy removal; RBN; Computer science; Datavetenskap;

    Abstract : This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. READ MORE

  6. 4. Advances in Functional Decomposition: Theory and Applications

    Author : Andrés Martinelli; Elena Dubrova; Jon Muzio; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; computer science; electronic system design; Boolean decomposition; binary decision diagram; logic synthesis; graph algorithm; Computer science; Datavetenskap;

    Abstract : 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. READ MORE