HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

BEM-II: An Arithmetic Boolean Expression Manipulator Using BDDs (Special Section on VLSI Design and CAD Algorithms)

Files in This Item:
58_IEICE76_1721.pdf1.55 MBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/47467

Title: BEM-II: An Arithmetic Boolean Expression Manipulator Using BDDs (Special Section on VLSI Design and CAD Algorithms)
Authors: Minato, Shin-ichi Browse this author →KAKEN DB
Keywords: BDD (binary decision diagram)
Boolean function
arithmetic Boolean expression
B-to-I (Boolean-to-integer) function
combinatorial problem
Issue Date: 25-Oct-1993
Publisher: 電子情報通信学会
Journal Title: IEICE transactions on fundamentals of electronics, communications and computer sciences
Volume: E76
Issue: A10
Start Page: 1721
End Page: 1729
Abstract: Recently, there has been a lot of research on solving combinatorial problems using Binary Decision Diagrams (BDDs), which are very efficient representations of Boolean functions. We have already developed a Boolean Expression Manipulator, which calculates and reduces Boolean expressions quickly based on BDD techniques. This greatly aids our works on developing VLSI CAD systems and solving combinatorial problems. Any combinatorial problem can be described in Boolean expressions; however, arithmetic operations, such as addition, subtraction, multiplication, equality and inequality, are also used for describing many practical problems. Arithmetic operations provide simple descriptions of problems in many cases. In this paper, we present an arithmetic Boolean expression manipulator (BEM-II), based on BDD techniques. BEM-II calculates Boolean expressions containing arithmetic operations and then displays the results in various formats. It can solve problems represented by a set of equalities and inequalities, which are dealt with using 0-1 linear programming. We show the efficient data structure based on BDD representation, algorithms for manipulating Boolean expressions with arithmetic operations, and good formats for displaying the results. Finally we present the specification of BEM-II and an example of application to the 8-Queens problem. BEM-II is customizable to various applications. It has good computation performance in terms of the total time for programming and execution. We expect BEM-II to be a helpful tool in research and development on digital systems.
Rights: copyright©1993 IEICE
Type: article
URI: http://hdl.handle.net/2115/47467
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 湊 真一

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University