A State Machine Language Supporting Integer Inequalities Implemented with Ordered Ternary Decision Diagrams

نویسندگان

  • Glenn Jennings
  • Per Lindgren
  • Joachim Isaksson
چکیده

A state-machine language supporting both integer and Boolean input and output signals permits unied description throughout the design process, permits rapid interactive debugging, generates e cient behavioral simulation code, and produces compact but non-compromised output for logic optimization. The compiler is built upon Ordered Ternary Decision Diagrams, which insures correct simulation behavior in the presence of \unknown" input values. Mapping of integer tests into OTDDs, and the e ects of OTDD bit ordering on simulation code size and e ciency, are

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

B . Becker , R . E . Bryant , O . Coudert , Ch . Meinel ( Hrsg

s of the Talks 7 Probabilistic Analysis of Large Finite State Machines F. Somenzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Improving OBDD-Based Verification in a Synthesis Environment W. Kunz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Computing the Maximum Power Cycle of Sequential Circuits A. Pardo . . . . . . . . . . . . . . . . . . . . . . . ...

متن کامل

Minimization of Ordered Pseudo Kronecker Decision Diagrams

The introduction of Decision Diagrams (DDs) has brought new means towards solving many of the problems involved in digital circuit design. Compactness of the representation is one key issue. Ordered Pseudo Kronecker Decision Diagrams (OPKDDs) together with the use of complemented edges is known to offer the most general ordered, read-once DD representation at the bit-level, hence OPKDDs hold al...

متن کامل

Boolean Function Representation Using Parallel-Access Diagrams

In this paper we introduce a nondeterministic counterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually related to deterministic finite automata (DFA), accepting the language formed by the minterms of a function. This analogy suggests the use of nondeterministic devices as language recognizers. Unlike ROBDDs, the...

متن کامل

Binary decision diagrams and integer programming

In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1 Integer Programming and related polyhedral problems. We develop an output-sensitive algorithm for building a threshold BDD, which represents the feasible 0/1 solutions of a linear constraint, and give a parallel and -operation for threshold BDDs to build the BDD for a 0/1 IP. In addition we construct a 0/1 ...

متن کامل

EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition

Edge Valued Binary Decision Diagrams evbdd s are directed acyclic graphs which can represent and manipulate integer functions as e ectively as Ordered Binary Decision Di agrams obdds do for Boolean functions They have been used in logic veri cation for showing the equivalence between Boolean functions and arithmetic functions In this paper we present evbdd based algorithms for solving integer l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994