ACM Home Page
Please provide us with feedback. Feedback
K-disjointness paradigm with application to symmetry detection for incompletely specified functions
Full text PdfPdf (314 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Poster session I table of contents
Pages: 994 - 997  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Kuo-Hua Wang  Fu Jen Catholic University, Taiwan, R.O.C.
Jia-Hung Chen  Fu Jen Catholic University, Taiwan, R.O.C.
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1120775
What is a DOI?

ABSTRACT

In this paper, we propose a K-disjointness paradigm that can effectively search all pairs of minterms with Hamming distance K between two Boolean functions. By this paradigm, we correlate it with symmetry detection problem and propose an efficient symmetry detection algorithm for Boolean functions. Our algorithm can not only handle completely specified functions but also incompletely specified functions. Experimental results on a set of MCNC and ISCAS benchmarking circuits show that our algorithm is indeed very effective and efficient for detecting symmetries of large Boolean functions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. G. Kim and D. L. Dietmeyer, "Multilevel logic synthesis of symmetric switching functions," IEEE Trans. on Computer-Aided Design, vol. 10, pp. 436--446, April 1991.
2
3
 
4
B. J. Falkowski and S. Kannurao, "Skew symmetry detection using the Walsh Spectral Coefficients,"in Proc. International Symposium on Circuit and System, 2000, vol. 2, pp. 321--324.
5
 
6
 
7
 
8
 
9
Alan Mishchenko, "Fast Computation of Symmetries in Boolean Functions,"IEEE Trans. Computer-Aided-Design, vol. 18, pp. 1588--1593, Nov. 2003.
 
10
C. Scholl, D. Moller, P. Molitor, and R. Drechsler, "BDD minimization using symmetries" IEEE Trans. Computer-Aided-Design, vol. 18, pp. 81--100, Feb. 1999.
 
11
S. Rahardja, B. J. Falkowski, "Symmetry conditions of Boolean functions in complex Hadamard transform," Electronics Letters, vol. 34, pp. 1634--1635, Aug. 1998.
 
12
13
 
14
F. Somenzi, CUDD Package, Release 2.3.1. {Online} Availabe: http://vlsi/Colorado.EDU/ fabio/CUDD/cuddIntro.html
15
 
16
A. Mishchenko. EXTRA library of DD procedures. {Online}. Available: http://www.ee.pdx.edu/ alanmi/research/extra.htm
 
17
E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. R. Stephan, R. K. Brayton, A. Sangiovanni-Vincentelli, "SIS: A System for Sequential Circuit Synthesis", Electronics Research Laboratory, Memorandum No. UCB/ERL M92/41, 4 May 1992.

Collaborative Colleagues:
Kuo-Hua Wang: colleagues
Jia-Hung Chen: colleagues