scispace - formally typeset
Open AccessJournal Article

SIS : A System for Sequential Circuit Synthesis

Reads0
Chats0
TLDR
This paper provides an overview of SIS and contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph] manipulation, and synthesis for PGA’s (programmable gate arrays).
Abstract
SIS is an interactive tool for synthesis and optimization of sequential circuits Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output behavior Many different programs and algorithms have been integrated into SIS, allowing the user to choose among a variety of techniques at each stage of the process It is built on top of MISII [5] and includes all (combinational) optimization techniques therein as well as many enhancements SIS serves as both a framework within which various algorithms can be tested and compared, and as a tool for automatic synthesis and optimization of sequential circuits This paper provides an overview of SIS The first part contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays) The second part contains a tutorial example illustrating the design process using SIS

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Efficiency of Multi-Valued Encoding in SAT-based ATPG

TL;DR: A detailed study on how to chose the multi-valued encoding for SAT-based ATPG is presented and the techniques have been implemented and evaluated on large industrial benchmarks.
Proceedings ArticleDOI

On-line error detection and BIST for the AES encryption algorithm with different S-box implementations

TL;DR: This paper experimentally investigates the efficiency of concurrent checking for the AES encryption algorithm (Rijndael) by parity modification by utilizing the property of the AES algorithm that arbitrarily given plain texts are encrypted by the successive rounds into "pseudo-random" cipher texts.
Proceedings ArticleDOI

A metal-only-ECO solver for input-slew and output-loading violations

TL;DR: A framework, named metal-only ECO slew/cap solver (MOESS), to resolve the input-slew and output-loading violations by connecting spare cells onto the violated nets as buffers to resolve timing violations.
Journal ArticleDOI

Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets

TL;DR: In this article, the problem of synthesizing an asynchronous control circuit for a stage of the Sproull Counterflow pipeline processor (CFPP) is addressed as an exercise in exploiting formal techniques available for Petri nets.

REVERSE: Efficient Sequential Verification for Retiming

TL;DR: A new framework for verifying the sequential equiva- lence of circuits optimized by retiming is proposed and useful properties about that invariant are proved and efficient algorithms for computing as well as employing it for verification are presented.
References
More filters
Journal ArticleDOI

Graph-Based Algorithms for Boolean Function Manipulation

TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Book

Logic Minimization Algorithms for VLSI Synthesis

TL;DR: The ESPRESSO-IIAPL as discussed by the authors is an extension of the ESPRSO-IIC with the purpose of improving the efficiency of Tautology and reducing the number of blocks and covers.
Journal ArticleDOI

MIS: A Multiple-Level Logic Optimization System

TL;DR: An overview of the MIS system and a description of the algorithms used are provided, including some examples illustrating an input language used for specifying logic and don't-cares.
Dissertation

Synthesis of self-timed vlsi circuits from graph-theoretic specifications

T. Chu
TL;DR: This thesis presents an approach for direct and efficient synthesis of self-timed (asynchronous) control circuits from formal specifications called Signal Transition Graphs (STGs), and develops a number of analytical results which establish the equivalence between the static structure of nets and their underlying firing sequence semantics.