Minimum Single Transition-Time Assignments for Asynchronous Sequential Circuits Using BDD

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new method of the single transition-time (STT) assignments for asynchronous sequential circuits, in which propositional calculus, or Boolean algobra is adopted. Exactly minimum solutions of the STT assignments are obtained by our method. In order to handle huge propositional formulas, the shared binary decision diagrams (SBDD's) are used as an internal representation of the formulas which denote the STT assignment for a given normal flow table. Moreover, as an application of the method, an algorithm for the constrained encoding problems is also proposed, for which so far only heuristic algorithms are known for solving large and practical problems. However, our algorithm always guarantees minimum solutions. Experimental results show that our methods are effective to obtain minimum solutions at significantly reduced computation cost. The STT assignments are said to be very practical so that the method is available at the design of asynchronous sequential circuits.

• 一般社団法人情報処理学会の論文
• 1994-02-15

著者

• Yajima Shuzo

  Department Of Information Science Kyoto University

• Kwon Yong-jin

  Department Of Information Science Faculty Of Engineering Kyoto University

• Yajima Shuzo

  Department Of Information Science Facu1ty Of Engineering Kyoto University

関連論文

• A Computer Communication Control Technique for Virtualization of Network Memory Resources and Its Implementation
• Regular Temporal Logic Expressively Equivalent to Finite Automata and Its Application to Logic Design Verification
• Locally Exhaustive Testing of Combinational Circuits Using Linear Logic Circuits
• Minimum One-Shot State Assignment for Asynchronous Sequential Machines Using BDD
• The Complexity of the Optimal Variable Ordering Problems of a Shared Binary Decision Diagram
• A Raster-scan Computer Graphic Display Device Having Random-scan Functions with Color Specifying Light Pen Facility
• Combinatorial Algorithms Using Boolean Processing
• Minimum Single Transition-Time Assignments for Asynchronous Sequential Circuits Using BDD

スポンサーリンク