| 注册
首页|期刊导航|桂林电子科技大学学报|一种OBDD表示及其操作算法

一种OBDD表示及其操作算法

闵丰 古天龙

桂林电子科技大学学报2017,Vol.37Issue(3):203-207,5.
桂林电子科技大学学报2017,Vol.37Issue(3):203-207,5.

一种OBDD表示及其操作算法

An OBDD representation and its algorithm

闵丰 1古天龙1

作者信息

  • 1. 桂林电子科技大学 广西可信软件重点实验室,广西 桂林 541004
  • 折叠

摘要

Abstract

In order to improve the processing speed and memory utilization rate of ordered binary decision diagram (OBDD) in microprocessor environment,a four-tuple OBDD representation of static binary chain structure is proposed,and several typical OBDD operation algorithm methods based on computational state are proposed,including Apply and ITE operation,which take the node attribute value as the calculation table mapping key.Experiments are based on the traditional recursive operation algorithm for chain data processing and it is proved that the state analysis operation algorithm based on OBDD node quadratic data and its query method have higher memory utilization efficiency and computational efficiency in the microprocessor environment.

关键词

OBDD/操作算法/静态二叉链表

Key words

OBDD/manipulation algorithm/static binary list

分类

信息技术与安全科学

引用本文复制引用

闵丰,古天龙..一种OBDD表示及其操作算法[J].桂林电子科技大学学报,2017,37(3):203-207,5.

基金项目

国家自然科学基金(61572146) (61572146)

广西自然科学基金(2015GXNSFAA139285,2014GXNSFAA118354) (2015GXNSFAA139285,2014GXNSFAA118354)

桂林电子科技大学学报

1673-808X

访问量0
|
下载量0
段落导航相关论文