No abstract

No abstract

Design of locally computable combinational circuits is a very important subject to implement high-speedcompact arithmetic and logic circuits in VLSI systems. This paper describes a multiple-valued code assignment algorithm for the locally computable combinational circuits, when the functional specification for a permutation operation is given by the mapping relationship between input and output alphabets or symbols. Partition theory usually used in the design of sequential circuits is eflectivelyemployed f o r the fast search f o r the code assignment problem. Some examples are shown to demonstrate the usefulness of the algorithm.

No abstract

No abstract