A Construction Theory of Multiple-Valued Logic Fuctions on GF($(2^m)$ by Bit Code Assignment

Bit Code할당에 의한 GF($(2^m)$상의 다치논리함수 구성 이론

This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.