Compact Representations of Logic Functions using Heterogeneous MDDs

نویسندگان

  • Shinobu Nagayama
  • Tsutomu Sasao
چکیده

In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable may take a different domain. By partitioning binary input variables and representing each partition as a single multi-valued variable, we can produce a heterogeneous MDD with smaller memory size than a Reduced Ordered Binary Decision Diagram (ROBDD), and with as small memory size as the Free Binary Decision Diagrams (FBDDs). We minimized a large number of benchmark functions to show the compactness of heterogeneous MDDs.

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

ثبت نام

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

منابع مشابه

Code Generation for Embedded Systems Using Heterogeneous MDDs

This paper proposes a method to generate program code for embedded systems using Multi-valued Decision Diagrams (MDDs) that are called heterogeneous MDDs. The heterogeneous MDDs represent logic functions more compactly, and have shorter average path length than other Decision Diagrams (DDs). The code generated using heterogeneous MDDs can evaluate logic functions faster using a small amount of ...

متن کامل

On the Minimization of Longest Path Length for Decision Diagrams

In this paper, we consider the minimization of the longest path length (LPL) for binary decision diagrams (BDDs) and heterogeneous multi-valued decision diagrams (MDDs). Experimental results show that: (1) For many logic functions, node minimization of BDDs also minimizes the LPLs of BDDs. (2) When we use heterogeneous MDDs for representing logic functions and minimize the memory sizes of heter...

متن کامل

A Method to Represent Multiple-Output Switching Functions by Using Multi-Valued Decision Diagrams

Multiple-output switching functions can be simulated by multiple-valued decision diagrams (MDDs) at a signi cant reduction in computation time. We analyze the following approaches to the representation problem: shared multiple-valued decision diagrams (SMDDs), multi-terminal multiple-valued decision diagrams (MTMDDs), and shared multi-terminal multiple-valued decision diagrams (SMTMDDs). For ex...

متن کامل

Implementing a Multiple-Valued Decision Diagram Package

Decision diagrams are the state-of-the-art representation for logic functions, both binary and multiple-valued. Here we consider issues regarding the efficient implementation of a package for the creation and manipulation of multiple-valued decision diagrams (MDDs). In particular, we identify issues that differ from binary decision diagram packages. We describe a matrix method for level interch...

متن کامل

Lower Bound Sifting for MDDs

Decision Diagrams (DDs) are a data structure for the representation and manipulation of discrete logic functions often applied in VLSI CAD. Common DDs to represent Boolean functions are Binary Decision Diagrams (BDDs). Multiple-valued logic functions can be represented by Multiple-valued Decision Diagrams (MDDs). The efficiency of a DD representation strongly depends on the variable ordering; t...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2003