EVALUATION TIME OF BOOLEAN FUNCTIONS : AN ESTIMATION METHODOLOGY BASED ON THE PATH LENGTH OF THEIR BDD REPRESENTATIONS
EVALUATION TIME OF BOOLEAN FUNCTIONS : AN ESTIMATION METHODOLOGY BASED ON THE PATH LENGTH OF THEIR BDD REPRESENTATIONS
复制标题
布尔函数的评估时间：一种基于 BDD 表示的路径长度的估计方法
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
B. Mills
中科院分区：
文献类型：
--
作者：
P. Prasad;M. Raseen;B. Mills
在频繁操作布尔函数的数字系统中，重要的是要知道布尔函数在处理器执行期间的计算时间是如何消耗的。布尔函数求值时间的估计在功能-体系结构协同设计中具有重要作用。二叉决策图(BDD)表示的布尔函数的计算时间复杂度与BDD的路径长度直接相关。本文描述了一种BDD方法，它为布尔函数的时间计算提供了一种估计方法。利用实验和数学方法对所提出的方法进行了验证。
In digital systems where Boolean functions are frequently manipulated, it is important to know how evaluation time of Boolean functions is consumed during their execution by the processor. Estimation of the evaluation time of Boolean functions plays an important role in function-architecture co-design. The evaluation time complexity of Boolean functions represented by Binary Decision Diagrams (BDDs) is directly related to the path length of the BDD. This paper describes a BDD approach that gives an estimation method for the time evaluation of Boolean functions. The proposed technique is validated using both experimental and mathematical techniques.