Kettle, Neil, King, Andy (2008) An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27 (4). pp. 764-777. ISSN 0278-0070. (doi:10.1109/TCAD.2008.917592) (KAR id:37528)
PDF
Language: English |
|
Download this file (PDF/255kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1109/TCAD.2008.917592 |
Abstract
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input correspondence is unknown and finding support-reducing bound sets. Mishchenko showed how to efficiently detect symmetries in ROBDDs without the need for checking equivalence of all co-factor pairs. This work resulted in practical algorithms for detecting classical and generalized symmetries. Both the classical and generalized symmetry detection algorithms are monolithic in the sense that they only return a meaningful answer when they are left to run to completion. In this paper we present anytime algorithms for detecting both classical and generalized symmetries, that output pairs of symmetric variables until a prescribed time bound is exceeded. These anytime algorithms are complete in that given sufficient time they are guaranteed to find all symmetric pairs. Anytime generality is not gained at the expense of efficiency since this approach requires only very modest data structure support and offers unique opportunities for optimization so the resulting algorithms are competitive with their monolithic counterparts.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1109/TCAD.2008.917592 |
Subjects: | A General Works |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 12 Dec 2013 15:36 UTC |
Last Modified: | 05 Nov 2024 10:21 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/37528 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):