Kettle, N. and King, A.M. (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. Asia and South Pacific Design Automation Conference. IEEE pp. 243-248. ISBN 0-7803-9451-8 .
Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. State-of-the-art is represented by Mishchenko's algorithm. In this paper we present an efficient anytime algorithm for detecting symmetries in Boolean functions represented as ROBDDs, that output pairs of symmetric variables until a prescribed time bound is exceeded. The algorithm is complete in that given sufficient time it is guaranteed to find all symmetric pairs. The complexity of this algorithm is in O(n<sup>4</sup>+n|G|+|G|<sup>3</sup>) where n is the number of variables and |G| the number of nodes in the ROBDD, and it is thus competitive with Mishchenko's |G|<sup>3</sup> algorithm in the worst-case since n << |G|. However, our algorithm performs significantly better because the anytime approach only requires lightweight data structure support and it offers unique opportunities for optimization.
|Item Type:||Conference or workshop item (Paper)|
|Additional information:||Copyright held by IEEE 2006.|
|Uncontrolled keywords:||ROBDDs, symmetry|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:04|
|Last Modified:||30 Jul 2012 08:44|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14521 (The current URI for this page, for reference purposes)|
- Depositors only (login required):