Graph automorphism-based algorithm for determining symmetric inputs

Chen Ling Chou, Chun Yao Wang, Geeng Wei Lee, Jing Yang Jou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We propose a graph automorphism-based algorithm for computing maximal sets of symmetric inputs of circuits. It can be used to identity nonsymmetric inputs in a circuit and enhance the efficiency of input matching, library binding, as well as logic verification problems. We conduct the experiments on some benchmarks. The experimental results demonstrate that our approach distinguishes more non-symmetric inputs than that of previous work.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Computer Design
Subtitle of host publicationVLSI in Computers and Processors, ICCD 2004
Pages417-419
Number of pages3
DOIs
StatePublished - 2004
EventProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004 - San Jose, CA, United States
Duration: 11 Oct 200413 Oct 2004

Publication series

NameProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
ISSN (Print)1063-6404

Conference

ConferenceProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, ICCD 2004
Country/TerritoryUnited States
CitySan Jose, CA
Period11/10/0413/10/04

Fingerprint

Dive into the research topics of 'Graph automorphism-based algorithm for determining symmetric inputs'. Together they form a unique fingerprint.

Cite this