Automatic synthesis of asynchronous circuits

Lin, Kuan-Jen; Lin, Chih‐Hsun

doi:10.1145/127601.127684

Cited by 26 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Asynchronous circuits are indispensable in many low power and high performance digital computer systems. Due to their important applications in mobile, portable, and military communication systems, there has been great interest in the automated design and synthesis of asynchronous circuits 89,330,350,528]. The design of asynchronous control and interface circuits, however, has proven to be an extremely complex and error-prone task.…”

Section: Binary Decision Diagram (Bdd)mentioning

confidence: 99%

Algorithms for the satisfiability (SAT) problem: A survey

Purdom²,

Franco³

et al. 1997

Satisfiability Problem: Theory And Applications

222

143

View full text Add to dashboard Cite

The satis ability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a uni ed perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the satis ability problems.

show abstract

Section: Binary Decision Diagram (Bdd)mentioning

confidence: 99%

Algorithms for the satisfiability (SAT) problem: A survey

Purdom²,

Franco³

et al. 1997

Satisfiability Problem: Theory And Applications

222

143

View full text Add to dashboard Cite

show abstract

“…The problem of synthesizing asynchronous circuits from STG speci cations has been studied by many researchers 2,15,18,39,40,42].…”

Section: Previous Workmentioning

confidence: 99%

Asynchronous circuit synthesis with Boolean satisfiability

Puri²

1995

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Asynchronous circuits are widely used in many real time applications such as digital communication and computer systems. The design of complex asynchronous circuits is a di cult and error-prone task. An adequate synthesis method will signi cantly simplify the design and reduce errors. In this paper, we present a general and e cient partitioning approach to the synthesis of asynchronous circuits from general Signal Transition Graph (STG) speci cations. The method partitions a large signal transition graph into smaller and manageable subgraphs which signi cantly reduces the complexity of asynchronous circuit synthesis. Experimental results of our partitioning approach with large number of practical industrial asynchronous circuit benchmarks are presented. They show that, compared to the existing asynchronous circuit synthesis techniques, this partitioning approach achieves many orders of magnitude of performance improvements in terms of computing time, in addition to the reduced circuit implementation area. This lends itself well to practical asynchronous circuit synthesis from general STG speci cations.

show abstract

“…Unfortunately, the reachability graph of highly concurrent systems can be exponential in the size of the STG that leads to the well-known state explosion problem. Some efforts have been devoted to propose structural methods for synthesis [9], [10], but they have been usually devised for restricted classes of PN's that compromise the potential expressiveness of this formalism.…”

Section: Introductionmentioning

confidence: 99%