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

TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits

TL;DR: Tiny Garble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC, and is able to implement functions that have never been reported before, such as SHA-3.
Journal ArticleDOI

Selective triple Modular redundancy (STMR) based single-event upset (SEU) tolerant synthesis for FPGAs

TL;DR: The proposed STMR method along with the readback and reconfiguration feature of Virtex can result in very high SEU immunity and greatly reduce the area overhead of the hardened circuit when compared to the state-of-the-art triple modular redundancy (TMR).
Book

ESL Design and Verification: A Prescription for Electronic System Level Methodology

TL;DR: ESL DESIGN & VERIFICATION offers a true prescriptive guide to ESL that reviews its past and outlines the best practices of today.
Proceedings ArticleDOI

VPR 5.0: FPGA cad and architecture exploration tools with single-driver routing, heterogeneity and process scaling

TL;DR: A new version of the VPR toolset is described that supports a broad range of single-driver routing architectures and provides optimized electrical models of a wide range of architectures in different process technologies, including a range of area-delay tradeoffs for each single architecture.
Proceedings ArticleDOI

NBTI-aware synthesis of digital circuits

TL;DR: A technology mapping technique that incorporates the NBTI stress and recovery effects, in order to ensure optimal performance of the circuit, during its entire lifetime, is 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.