A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An output encoding problem and a solution technique

1999
*
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
*

We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specified in terms of 1's, 0's and don't cares, and others are specified symbolically, and assuming that the minimum number of bits are used to encode the symbolic outputs (log 2 n bits for n symbolic outputs), determine a binary code for each symbol of the symbolically specified output column such that the total number of

doi:10.1109/43.766726
fatcat:honk4unninb7fgqhskttwzjfuq