By Topic

A Fast and Practical Algorithm for Absolute Dominators Searching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Xiaojing Hu ; State Key Lab. of Electr. Insulation & Power Equip., Xi''an Jiaotong Univ., Xi''an ; Zhengxiang Song ; Jianhua Wang ; Geng, Yingsan
more authors

Absolute dominator search is an effective topological analysis method to improve performance of computer-aided design (CAD) and automatic test pattern generation (ATPG). In this paper, we present a new algorithm for searching absolute dominators of multiple- output circuits to solve inefficient and complex computing in tradition algorithm. Compare with the tradition algorithm, the new algorithm analyzes the relations between different fanout nodes, and identifies absolute dominator for every fanout node in circuit, thus, the overall dominator graph is constructed without any changes for original circuit directly. The experimental results based on ISCAS85 and ITC99 benchmarks show a signification improvement in runtime, and it can meet the requirement of modern design and test for VLSI.

Published in:

Testing and Diagnosis, 2009. ICTD 2009. IEEE Circuits and Systems International Conference on

Date of Conference:

28-29 April 2009