An algorithm for face-constrained encoding of symbols using minimum code length

Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column based algorithm to solve this optimization problem. The new algorithm targets economical implementation of face constraints unlike conventional algorithms which do not care about infeasible ones. Experimental results that demonstrate the superiority of the new method versus conventional tools and a preview algorithm specifically developed for the minimum length encoding problem are shown. A state assignment tool which uses the new algorithm is evaluated by implementing a standard benchmark of sequential circuits. It compares very favorably to well known tools like NOVA.