An efficient algorithm finding simple disjoint decompositions using BDDs

被引：0

作者：

Matsunaga, Y ^{[1
]}

机构：

[1] Kyushu Univ, Grad Sch Informat Sci & Elect Engn, Dept Comp Sci & Commun Engn, Kasuga, Fukuoka 8168580, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2002年 / E85A卷 / 12期

关键词：

functional decomposition; BDDs; logic synthesis; FPGA;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Functional decomposition is an essential technique of logic synthesis and is important especially for FPGA design. Bertacco and Damiani proposed an efficient algorithm finding simple disjoint decomposition using Binary Decision Diagrams (BDDs). However, their algorithm is not complete and does not find all the decompositions. This paper presents a complete theory of simple disjoint decomposition and describes an efficient algorithm using BDDs.

引用

页码：2715 / 2724

页数：10

共 50 条

[41] Energy Efficient Disjoint Path Routing Using Genetic Algorithm for Wireless Sensor Network
Mehetre, Deepak
Wagh, Sanjeev
1ST INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION CONTROL AND AUTOMATION ICCUBEA 2015, 2015, : 182 - 185
[42] A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
Akutsu, T
Miyano, S
Kuhara, S
THEORETICAL COMPUTER SCIENCE, 2003, 292 (02) : 481 - 495
[43] FINDING GROUPS WITH A SIMPLE GENETIC ALGORITHM
FREEMAN, LC
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1993, 17 (04): : 227 - 241
[44] Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Climaco, Joao C. N.
Pascoal, Marta M. B.
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 2892 - 2898
[45] A Simple Greedy Algorithm for the k-Disjoint Flow Problem
Martens, Maren
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 291 - 300
[46] Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
Sariyuce, Ahmet Erdem
Seshadhri, C.
Pinar, Ali
Catalyurek, Umit V.
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, : 927 - 937
[47] Finding the radical of matrix algebras using Fitting decompositions
Ivanyos, G
JOURNAL OF PURE AND APPLIED ALGEBRA, 1999, 139 (1-3) : 159 - 182
[48] Using BDDs and ZBDDs for efficient identification of testable path delay faults
Padmanaban, S
Tragoudas, S
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2004, : 50 - 55
[49] Efficient Combinational Verification Using Overlapping Local BDDs and a Hash Table
Rajarshi Mukherjee
Jawahar Jain
Koichiro Takayama
Jacob A. Abraham
Donald S. Fussell
Masahiro Fujita
Formal Methods in System Design, 2002, 21 : 95 - 101
[50] Brief Announcement: A Stabilizing Algorithm for Finding Two Disjoint Paths in Arbitrary Networks
Karaata, Mehmet Hakan
Hadid, Rachid
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5873 : 789 - +

← 1 2 3 4 5 →