Sciweavers

41 search results - page 1 / 9
» Sequential logic synthesis using symbolic bi-decomposition
Sort
View
DATE
2009
IEEE
127views Hardware» more  DATE 2009»
13 years 11 months ago
Sequential logic synthesis using symbolic bi-decomposition
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...
Victor N. Kravets, Alan Mishchenko
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
13 years 8 months ago
An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
Manuel Martínez, Maria J. Avedillo, Jos&eac...
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
13 years 8 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
DAC
1990
ACM
13 years 8 months ago
Symbolic Simulation - Techniques and Applications
Symbolic simulation involves evaluating circuit behavior using special symbolic values to encode a range of circuit operating conditions. In one simulation run, a symbolic simulat...
Randal E. Bryant
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
13 years 8 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...