Sökning: "circuit verification"

Visar resultat 1 - 5 av 42 avhandlingar innehållade orden circuit verification.

  1. 1. Decision problems in systolic circuit verification

    Författare :Parosh Abdulla; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  2. 2. The partial element equivalent circuit method : modeling and experimental verification of PCB structures

    Författare :Jonas Ekman; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Industriell elektronik; Industrial Electronics;

    Sammanfattning : To help products comply with international Electromagnetic Compatibility (EMC)regulations or as a help in a design process numerical simulation of electromagnetic (EM) characteristics are a valuable tool. With the development of high-speed computers the complexity of EM simulation programs and the systems they can simulate has increased considerable. LÄS MER

  3. 3. Hierarchical corner-based design rule checking

    Författare :Nils Hedenstierna; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; circuit verification; parallel algorithms; layout verification; VLSI; design rule checking DRC ;

    Sammanfattning : .... LÄS MER

  4. 4. Graph dominators in logic synthesis and verification

    Författare :René Krenz; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

    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

  5. 5. Dominator-based Algorithms in Logic Synthesis and Verification

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

    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