| 基于动态筛选算法的二元判定图的优化 |
| |
| 引用本文： | 段珊,张修如.基于动态筛选算法的二元判定图的优化[J].湖南理工学院学报,2007,20(3):33-37. |
| |
| 作者姓名： | 段珊 张修如 |
| |
| 作者单位： | 中南大学信息科学与工程学院 湖南长沙410083 |
| |
| 摘 要： | 作为逻辑布尔函数的一种高效简洁的描述方法,BDD规模结构对应着计算机实现算法的空间和时间复杂性。随着应用领域的不同,BDD的节点和路径的规模成为关注的两个焦点。文章讨论利用基于动态规划的筛选算法来实现从节点规模和路径的大小两方面对BDD的优化。在将筛选算法用于节点优化的基础上,从理论上提出了优化路径的思路及可行算法。
|
| 关 键 词： | 二元判定图 动态排序 筛选算法 路径 优化 |
| 文章编号： | 1672-5298（2007）03-0033-05 |
| 修稿时间： | 2007-06-20 |
Optimizing binary decision diagrams based on dynamical shifting algorithm |
| |
| DUAN Shan,ZHANG Xiu-ru.Optimizing binary decision diagrams based on dynamical shifting algorithm[J].Journal of Hunan Institute of Science and Technology,2007,20(3):33-37. |
| |
| Authors: | DUAN Shan ZHANG Xiu-ru |
| |
| Institution: | School of Information Science and Engineering, Gentral South University, Changxha, 410083, China |
| |
| Abstract: | BDD allows for a compact representation and efficient manipulation of Boolean functions.Its scale and structure corresponding to time and space complexity of algorithm of compution.operation.With variety application node size and number of path became two focus of research in the area of BDD application.in this paper discussing applying dynimic programming carry out the minimizing the node size and the number of path.an algorithm for minimizing path is proposed On the basis of shifting algorithmn which applying optimizing node size.from theoretics. |
| |
| Keywords: | BDD dynamic reordering shifting algorithm path optimize |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
