An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs(Special Section on VLSI Design and CAD Algorithms)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 一般社団法人電子情報通信学会の論文
- 2002-12-01
著者
-
Matsunaga Yusuke
Department Of Computer Science And Communication Engineering
-
Matsunaga Yusuke
Department Of Computer Science And Communication Engineering Graduate School Of Information Science
関連論文
- Character Projection Mask Set Optimization for Enhancing Throughput of MCC Projection Systems
- FOREWORD
- Special Section on VLSI Design and CAD Algorithms
- Pluripotent stem cells as source of dendritic cells for immune therapy
- Special Section on Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa
- A Simultaneous Module Selection, Scheduling, and Allocation Method Considering Operation Chaining with Multi-Functional Units(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- Timing-Constrained Area Minimization Algorithm for Parallel Prefix Adders(Logic Synthesis and Verification,VLSI Design and CAD Algorithms)
- A Behavioral Synthesis Method with Special Functional Units
- An Efficient Algorithm Finding Simple Disjoint Decompositions Using BDDs(Special Section on VLSI Design and CAD Algorithms)
- Multi-Operand Adder Synthesis Targeting FPGAs