Results 1  10
of
251,313
Direct Synthesis of Efficient Speedindependent Circuits from Deterministic Signal Transition Graphs
 Stanford University
, 1994
"... This paper presents a new algorithm which synthesizes a speedindependent circuit from a deterministic Signal Transition Graph(STG) representation which satisfies safeness, liveness and unique state coding property. Existing works translate a higher level description such as a nondeterministic STG r ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper presents a new algorithm which synthesizes a speedindependent circuit from a deterministic Signal Transition Graph(STG) representation which satisfies safeness, liveness and unique state coding property. Existing works translate a higher level description such as a nondeterministic STG
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Technology Mapping for SpeedIndependent Circuits: Decomposition and Resynthesis
, 1997
"... This paper presents theory and practical implementation of a method for multilevel logic synthesis of speedindependent circuits. An initial circuit implementation is assumed to satisfy the monotonous cover conditions but is technology independent. The proposed method performs both combinational (in ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
synthesis, but achieves also boolean simplification and sequential decomposition. The method allows sharing of decomposed logic. 1 Introduction Speedindependent circuits, originating from D.E. Muller's work [11], are hazardfree under the unbounded gate delay model. With recentprogress in developing
Synthesis of Speedindependent circuits from STGunfolding segment
 Proc. 34th ACM/IEEE Design Automation Conference
, 1997
"... This paper presents a novel technique for synthesis of speedindependent circuits. It is based on partial order representation of the state graph called STGunfolding segment. The new method uses approximation technique to speed up the synthesis process. The method is illustrated on the basic implem ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper presents a novel technique for synthesis of speedindependent circuits. It is based on partial order representation of the state graph called STGunfolding segment. The new method uses approximation technique to speed up the synthesis process. The method is illustrated on the basic
Cover Approximations for the Synthesis of SpeedIndependent Circuits
"... This paper presents a novel methodology for the synthesis of speedindependent circuits from Signal Transition Graphs (STGs). The pursued objective is to avoid the derivation of the reachability graph to calculate the logic equations for the outputs of the circuit, hence overcoming the state explosi ..."
Abstract
 Add to MetaCart
This paper presents a novel methodology for the synthesis of speedindependent circuits from Signal Transition Graphs (STGs). The pursued objective is to avoid the derivation of the reachability graph to calculate the logic equations for the outputs of the circuit, hence overcoming the state
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Estimation of Energy Consumption in SpeedIndependent Control Circuits
 IEEE Transactions on CAD
, 1995
"... : We describe a technique to estimate the energy consumed by speedindependent asynchronous (clockless) control circuits. Because speedindependent circuits are hazardfree under all possible combinations of gate delays, we prove that an accurate estimate of their energy consumption is independent o ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
: We describe a technique to estimate the energy consumed by speedindependent asynchronous (clockless) control circuits. Because speedindependent circuits are hazardfree under all possible combinations of gate delays, we prove that an accurate estimate of their energy consumption is independent
Logic Decomposition of SpeedIndependent Circuits
 PROCEEDINGS OF THE IEEE
, 1999
"... ... This paper presents a new method for logic decomposition of speedindependent circuits that solves the problem in two major steps: 1) logic decomposition of complex gates and 2) insertion of new signals that preserve hazard freedom. The method is shown to be more general than previous approaches ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
... This paper presents a new method for logic decomposition of speedindependent circuits that solves the problem in two major steps: 1) logic decomposition of complex gates and 2) insertion of new signals that preserve hazard freedom. The method is shown to be more general than previous
Structural Methods for the Synthesis of SpeedIndependent Circuits
, 1996
"... Most existing tools for the synthesis of asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper presents novel methods exclusively based on the structural analysis of the underlying Petri net. This methodology can be ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
Most existing tools for the synthesis of asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper presents novel methods exclusively based on the structural analysis of the underlying Petri net. This methodology can
Hierarchical GateLevel Verification of SpeedIndependent Circuits
 In Asynchronous Design Methodologies
, 1995
"... This paper presents a method for the verification of speedindependent circuits. The main contribution is the reduction of the circuit to a set of complex gates that makes the verification time complexity depend only on the number of state signals (C elements, RS flipflops) of the circuit. Despite ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
This paper presents a method for the verification of speedindependent circuits. The main contribution is the reduction of the circuit to a set of complex gates that makes the verification time complexity depend only on the number of state signals (C elements, RS flipflops) of the circuit. Despite
Results 1  10
of
251,313