Name
Abstract | ||
|---|---|---|
In high-level designs, variables are often naturally represented in a symbolic multi-valued form. Binary encoding is an essential step in realizing these designs in Boolean circuits. This paper poses the encoding problem with the objective of maximizing the degree of symmetry, which has many useful applications in logic optimization, circuit rewiring, functional decomposition, etc. In fact, it is guaranteed that there exists a full symmetry encoding with respect to every input multi-valued variable for all multi-valued functions. We propose effective computation for finding such encoding by solving a system of subset-sum constraints. Experiments show unique benefits of symmetry encoding.
|
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICCAD.2013.6691201 | ICCAD |
Keywords | Field | DocType |
boolean circuit,symbolic multivalued form,effective computation,input multi-valued variable,subset-sum constraint system,wiring,binary encoding,symmetry degree maximization,symmetry encoding,functional decomposition,circuit optimisation,full symmetry,multivalued function encoding,logic design,multi-valued function,multivalued logic circuits,encoding problem,circuit rewiring,multivalued logic,boolean circuits,symbolic multi-valued form,high-level designs,input multivalued variable,boolean functions,logic optimization,propositional logic,finite state machines | Boolean function,Boolean circuit,Logic optimization,Computer science,Functional decomposition,Algorithm,Electronic engineering,Finite-state machine,Theoretical computer science,Boolean algebra,Circuit minimization for Boolean functions,Encoding (memory) | Conference |
ISSN | ISBN | Citations |
1092-3152 | 978-1-4799-1069-4 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ko-Lung Yuan | 1 | 0 | 0.68 |
| Chien-Yen Kuo | 2 | 0 | 0.68 |
| Jie-Hong R. Jiang | 3 | 353 | 37.47 |
| Meng-Yen Li | 4 | 0 | 0.34 |