Graph Automorphism-Based Algorithm for Determining Symmetric Inputs

I
ICCD
2004
2004 IEEE International Conference on Computer Design (ICCD'04)
Abstract - Graph Automorphism-Based Algorithm for Determining Symmetric Inputs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Chen-Ling Chou Articles by Chun-Yao Wang Articles by Geeng-Wei Lee Articles by Jing-Yang Jou

2004 IEEE International Conference on Computer Design (ICCD'04)

San Jose, CA

October 11-October 13

ISBN: 0-7695-2231-9

	ASCII Text	x
	Chen-Ling Chou, Chun-Yao Wang, Geeng-Wei Lee, Jing-Yang Jou, "Graph Automorphism-Based Algorithm for Determining Symmetric Inputs," Computer Design, International Conference on, pp. 417-419, 2004 IEEE International Conference on Computer Design (ICCD'04), 2004.

	BibTex	x
	@article{ 10.1109/ICCD.2004.1347956, author = {Chen-Ling Chou and Chun-Yao Wang and Geeng-Wei Lee and Jing-Yang Jou}, title = {Graph Automorphism-Based Algorithm for Determining Symmetric Inputs}, journal ={Computer Design, International Conference on}, volume = {0}, year = {2004}, issn = {1063-6404}, pages = {417-419}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCD.2004.1347956}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Design, International Conference on TI - Graph Automorphism-Based Algorithm for Determining Symmetric Inputs SN - 1063-6404 SP417 EP419 A1 - Chen-Ling Chou, A1 - Chun-Yao Wang, A1 - Geeng-Wei Lee, A1 - Jing-Yang Jou, PY - 2004 KW - null VL - 0 JA - Computer Design, International Conference on ER -

Chen-Ling Chou, National Chiao Tung University, Taiwan

Chun-Yao Wang, National Tsing Hua University, Taiwan

Geeng-Wei Lee, National Chiao Tung University, Taiwan

Jing-Yang Jou, National Chiao Tung University, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2004.1347956

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.

Citation:

Chen-Ling Chou, Chun-Yao Wang, Geeng-Wei Lee, Jing-Yang Jou, "Graph Automorphism-Based Algorithm for Determining Symmetric Inputs," iccd, pp.417-419, 2004 IEEE International Conference on Computer Design (ICCD'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.