一种OBDD表示及其操作算法  

An OBDD representation and its algorithm

作　　者：闵丰[1] 古天龙[1] 

机构地区：[1]桂林电子科技大学广西可信软件重点实验室,广西桂林541004

出　　处：《桂林电子科技大学学报》2017年第3期203-207,共5页Journal of Guilin University of Electronic Technology

基　　金：国家自然科学基金(61572146);广西自然科学基金(2015GXNSFAA139285;2014GXNSFAA118354)

摘　　要：为了提高微处理器环境中数据处理速度及内存利用率,提出一种基于静态二叉链表结构的OBDD操作算法。该算法以节点四元化属性值作为计算表的映射关键值,基于后序遍历演绎几种典型OBDD操作,包括Apply、ITE操作。实验以传统递归操作算法的链式数据处理为参照,证明了在微处理器环境下,基于OBDD节点四元化数据的状态分析操作算法及其查询方式具有更高的内存利用率与计算效率。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 typi- cal 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 micro- processor environment.

关 键 词：OBDD 操作算法 静态二叉链表 

分 类 号：TP302.7[自动化与计算机技术—计算机系统结构]