Variable ordering for taylor expansion diagrams

Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940) Pub Date : 2004-11-10 DOI:10.1109/HLDVT.2004.1431235

D. Gomez-Prado, Q. Ren, S. Askar, M. Ciesielski, E. Boutillon

引用次数: 13

Abstract

This paper presents an algorithm for variable ordering for Taylor Expansion Diagrams (TEDs). First we prove that the function implemented by the TED is independent of the order of its variables, and then that swapping of two adjacent variables in a TED is a local permutation similar to that in BDD. These two properties allow us to construct an algorithm to swap variables locally without affecting the entire TED. The proposed algorithm can be used to perform dynamic reordering, such as sifting or window permutation. We also propose a static ordering that can help reduce the permutation space and speed up the search of an optimal variable order for TEDs.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

泰勒展开图的变量排序

提出了一种泰勒展开图的变量排序算法。首先证明了由TED实现的函数与其变量的顺序无关，然后证明了TED中两个相邻变量的交换是类似于BDD中的局部置换。这两个属性允许我们构建一个算法，在不影响整个TED的情况下局部交换变量。该算法可用于动态重排序，如筛选或窗口排列。我们还提出了一种静态排序方法，它可以帮助减少排列空间并加快对ted的最优变量排序的搜索。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940)

自引率

0.00%

发文量

期刊最新文献

On identifying functionally untestable transition faults ATPG based functional test for data paths: application to a floating point unit Exploiting hypergraph partitioning for efficient Boolean satisfiability Reference model based RTL verification: an integrated approach An event-based network-on-chip monitoring service