NDLI: SAT based ATPG using fast justification and propagation in the implication graph

Please wait, while we are loading the content...

Marsh: min-area retiming with setup and hold constraints

OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic

Bit-level arithmetic optimization for carry-save additions

Attractor-repeller approach for global placement

Cell replication and redundancy elimination during placement for cycle time optimization

Concurrent logic restructuring and placement for timing closure

Implicit enumeration of strongly connected components

Least fixpoint approximations for reachability analysis

Lazy group sifting for efficient symbolic state traversal of FSMs

Efficient manipulation algorithms for linearly transformed BDDs

Noise analysis of non-autonomous radio frequency circuits

New methods for speeding up computation of Newton updates in harmonic balance

Design and optimization of LC oscillators

Modeling and simulation of the interference due to digital switching in mixed-signal ICs

Provably good algorithm for low power consumption with dual supply voltages

A novel design methodology for high performance and low power digital filters

A bipartition-codec architecture to reduce power in pipelined circuits

AKORD: transistor level and mixed transistor/gate level placement tool for digital data paths

Analytical approach to custom datapath design

An integrated algorithm for combined placement and libraryless technology mapping

Timing-driven partitioning for two-phase domino and mixed static/domino implementations

Implication graph based domino logic synthesis

Synthesis for multiple input wires replacement of a gate for wiring consideration

Transient sensitivity computation for transistor level analysis and tuning

An efficient method for hot-spot identification in ULSI circuits

A scalable substrate noise coupling model for mixed-signal ICs

Towards true crosstalk noise analysis

SAT based ATPG using fast justification and propagation in the implication graph

Techniques for improving the efficiency of sequential circuit test generation

Concurrent D-algorithm on reconfigurable hardware

A new heuristic for rectilinear Steiner trees

An implicit connection graph maze routing algorithm for ECO routing

The associative-skew clock routing problem

Efficient incremental rerouting for fault reconfiguration in field programmable gate arrays

Optimal P/N width ratio selection for standard cell libraries

Performance optimization under rise and fall parameters

Performance optimization using separator sets

Factoring logic functions using graph partitioning

TICER: realizable reduction of extracted RC circuits

Realizable reduction for RC interconnect circuits

RLC interconnect delay estimation via moments of amplitude and phase response

Practical considerations for passive reduction of RLC circuits

Formal verification meets simulation (embedded tutorial) (abstract only)

Interconnect parasitic extraction in the digital IC design methodology

Cycle time and slack optimization for VLSI-chips

Clock skew scheduling for improved reliability via quadratic programming

Formulation of static circuit optimization with reduced size, degeneracy and redundancy by timing graph manipulation

Function inlining under code size constraints for embedded processors

Function unit specialization through code analysis

Lower bound on latency for VLIW ASIP datapaths

Interface and cache power exploration for core-based embedded system design

Dynamic power management using adaptive learning tree

Analytical macromodeling for high-level power estimation

Parameterized RTL power models for combinational soft macros

Validation and test generation for oscillatory noise in VLSI interconnects

Fault modeling and simulation for crosstalk in system-on-chip interconnects

Robust optimization based backtrace method for analog circuits

A methodology for correct-by-construction latency insensitive design

What is the cost of delay insensitivity?

Synthesis of asynchronous control circuits with automatically generated relative timing assumptions

Direct synthesis of timed asynchronous circuits

Co-synthesis of heterogeneous multiprocessor systems using arbitrated communication

Power minimization using system-level partitioning of applications with quality of service requirements

Worst-case analysis of discrete systems

Integrated floorplanning and interconnect planning

Buffer block planning for interconnect-driven floorplanning

A clustering- and probability-based approach for time-multiplexed FPGA partitioning

The Chebyshev expansion based passive model for distributed interconnect networks

Model reduction for DC solution of large nonlinear circuits

Efficient model reduction of interconnect via approximate system gramians

A framework for testing core-based systems-on-a-chip

Test scheduling for core-based systems

Partial BIST insertion to eliminate data correlation

A graph theoretic optimal algorithm for schedule compression in time-multiplexed FPGA partitioning

Throughput optimization of general non-linear computations

Optimal allocation of carry-save-adders in arithmetic optimization

Regularity extraction via clan-based structural circuit decomposition

Repeater insertion in tree structured inductive interconnect

Interconnect scaling implications for CAD

Is wire tapering worthwhile?

Electromagnetic parasitic extraction via a multipole method with hierarchical refinement

Virtual screening: a step towards a sparse partial inductance matrix

A wide frequency range surface integral formulation for 3-D RLC extraction

SOI technology and tools (abstract only)

System level design and debug of high-performance embedded media systems (embedded tutorial)

An approach for improving the levels of compaction achieved by vector omission

Deep submicron defect detection with the energy consumption ratio

Efficient diagnosis of path delay faults in digital logic circuits

Memory bank customization and assignment in behavioral synthesis

Memory binding for performance optimization of control-flow intensive behaviors

Improved interconnect sharing by identity operation insertion

Formal specification and verification of a dataflow processor array

Distributed simulation of VLSI systems via lookahead-free self-adaptive optimistic and conservative synchronization

Synchronous equivalence for embedded systems: a tool for design exploration

On the global fanout optimization problem

LEOPARD: a Logical Effort-based fanout OPtimizer for ARea and Delay

Optimum loading dispersion for high-speed tree-type decision circuitry

Symbolic functional and timing verification of transistor-level circuits

Body-voltage estimation in digital PD-SOI circuits and its application to static timing analysis

Functional timing optimization

Timing-safe false path removal for combinational modules

JMTP: an architecture for exploiting concurrency in embedded Java applications with real-time considerations

FunState—an internal design representation for codesign

Fast performance analysis of bus-based system-on-chip communication architectures

Probabilistic state space search

Improving coverage analysis and test generation for large designs

Modeling design constraints and biasing in simulation using BDDs

Copyright protection of designs based on multi source IPs

Localized watermarking: methodology and application to operation scheduling

Copy detection for intellectual property protection of VLSI designs

Path toward future CAD environments for MEMS (embedded tutorial) (abstract only)

Design of a set-top box system on a chip (abstract only)

On the rapid prototyping and design of a wireless communication system on a chip (abstract only)

Advances in transistor timing, simulation, and optimization (embedded tutorial) (abstract only)

Embedded Java (embedded tutorial) (abstract only): techniques and applications

SAT based ATPG using fast justification and propagation in the implication graph

Content Provider	ACM Digital Library
Author	Tafertshofer, Paul Ganz, Andreas
Abstract	In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As the IG model represents all information on the implemented logic function as well as the topology of a circuit, the proposed techniques inherit all advantages of both general SAT based and structure based approaches to justification, propagation, and implication. These three fundamental Boolean problems are the main tasks to be performed during Automatic Test Pattern Generation (ATPG) such that the proposed algorithms are incorporated into our ATPG tool TIP which is built on top of the implication engine.Working exclusively in the IG, the complex functional operations of justification, propagation, and implication reduce to significantly simpler graph algorithms. They are easily extended to exploit bit-parallel techniques. As the IG is automatically generated for arbitrary logics the algorithms remain applicable independent of the required logic. This allows processing of various fault models using the same engine. That is, the presented IG based methods offer a complete and versatile framework for rapid development of new ATPG tools that target emerging fault models such as cross-talk, delay or bridging faults. TIP currently handles stuck-at as well as various delay fault models. Furthermore, the proposed methods are used within tools for Boolean equivalence checking, optimization of netlists, timing analysis or retiming (reset state computation).In order to demonstrate the performance of IG based ATPG, i.e. justification and propagation in the IG, we provide experimental results for stuck-at and path delay fault models. They show that TIP outperforms the state-of-the-art in SAT based and structure based ATPG.
Starting Page	139
Ending Page	146
Page Count	8
File Format	PDF
ISBN	0780358325
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-11-07
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in