Code assignment algorithm for highly parallel multiple-valued combinational circuits

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.

Design of multiple-valued linear digital circuits for highly parallel k-ary operations

“…Localizatioii of circuits is to iiiake the number of tlie input digits reduced on which each output digit depends [7]. By this dependency reduction, iiitercoiinectioii complex-ity will be decreased and tlie critical path delay which is determined by a cascade cliain of basic gates will be rcclucecl [8] - [ll].…”

“…In general digital systeiiis, it is difficult to design systematically locally computable digital circuits with non-exhaustive procedure because of nonlinearity [8] [9]. For the problem, the use of tlie linear concept is very attractive.…”