An Optimization of Representation of Boolean Functions Using OPKFDD

OPKFDD를 이용한 불리안 함수 표현의 최적화

  • 정미경 (전남대학교 대학원 전산통계학과) ;
  • 이혁 (전남대학교 대학원 전산통계학과) ;
  • 이귀상 (전남대학교 전산학과)
  • Published : 1999.03.01

Abstract

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.

Keywords