Code assignment algorithm for highly parallel multiple-valued combinational circuits

Abstract

A multivalued code assignment algorithm for locally computable combinatorial circuits, when the functional specification for a permutation operation is given by the mapping relationship between input and output alphabets or symbols, is described. Partition theory, usually used in the design of sequential circuit, is effectively used for the fast search for the code assignment problem. Some examples are shown to demonstrate the usefulness of the algorithm.<>