Thumbnail
Access Restriction
Open

Author Nagayama, Shinobu ♦ Sasao, Tsutomu
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Decision Diagram ♦ Binary Decision Diagram ♦ Path Length ♦ Longest Path Length ♦ Heterogeneous Multi-valued Decision Diagram ♦ Node Minimization ♦ Memory Size ♦ Many Logic Function ♦ Heterogeneous Mdds ♦ Logic Function ♦ Memory Limitation ♦ Experimental Result
Description 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 heterogeneous MDDs, we can reduce both memory sizes and LPLs to 86% and 72% of corresponding BDDs, respectively. On the other hand, when the memory limitations are set to the memory sizes of BDDs, the LPLs can be reduced to 54% of BDDs.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2004-01-01
Publisher Institution Intl. Workshop on Logic and Synthesis (IWLS-2004