A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Boolean Constrained Encoding: A New Formulation And A Case Study
IEEE/ACM International Conference on Computer-Aided Design
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained encoding problem, and show that this definition encompasses many particular encoding problems found in VLSI design, at various description abstraction levels. Our approach can capture equivalence and/or compatibility classes in the original symbol set to encode, by allowing symbols codes to be cubes of a Boolean space,
doi:10.1109/iccad.1994.629899
dblp:conf/iccad/Calazans94
fatcat:3zic3mobq5fkblpl6agufutfqe