• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.107-116
• /
• 2007

In this paper, we present a method on the construction of multiple-valued circuits using Reed-Muller Expansions(RME). First, we discussed the input output interconnection of multiple valued function using Perfect Shuffle techniques and Kronecker product and designed the basic cells of performing the transform matrix and the reverse transform matrix of multiple valued RME using addition circuit and multiplication circuit of GF(4). Using these basic cells and the input-output interconnection technique based on Perfect Shuffle and Kronecker product, we implemented the multiple valued logic circuit based on RME. The proposed design method of multiple valued RME is simple and very efficient to reduce addition circuits and multiplication circuits as compared with other methods for same function because of using matrix transform based on modular structures. The proposed design method of multiple valued logic circuits is simple and regular for wire routing and possess the properties of concurrency and modularity of array.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.271-280
• /
• 2002

In this paper, the input-output interconnection method of the multiple-valued signal processing circuit using Perfect Shuffle technique and Kronecker product is discussed. Using this method, the circuit design method of the multiple-valued Reed-Muller Expansions (MRME) which can process the multiple-valued signal easily on finite fields GF$(p^m)$ is presented. The proposed input-output interconnection methods show that the matrix transform is an efficient and the structures are modular. The circuits of multiple-valued signal processing of MRME on GF$(p^m)$ design the basic cells to implement the transform and inverse transform matrix of MRME by using two basic gates on GF(3) and interconnect these cells by the input-output interconnection technique of the multiple-valued signal processing circuits. The proposed multiple-valued signal processing circuits that are simple and regular for wire routing and possess the properties of concurrency and modularity are suitable for VLSI.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.43-53
• /
• 1997

In this paper, the optimal synthesis algorithm of multiple-valued logic circuits using universal logic modules (ULM) U$_{f}$ based on 3-variable ternary reed-muller expansions is presented. We check the degree of each varable for the coefficients of reed-muller expansions and determine the order of optimal control input variables that minimize the number of ULM U$_{f}$ modules. The order of optimal control input variables is utilized the realization of multiple-valued logic circuits to be constructed by ULM U$_{f}$ modules based on reed-muller expansions using the circuit cost matrix. This algorithm is performed only unit time in order to search for the optimal control input variables. Also, this algorithm is able to be programmed by computer and the run time on programming is O(p$^{n}$ ).

• Journal of IKEEE
• /
• v.3 no.2 s.5
• /
• pp.285-294
• /
• 1999

This paper presents a method for the generation of GRM coefncients over GF(3) by using a comparison of polarity. In general production method to GRM coefficients over GF(3) is searching for pn different polarity of an n-variable and from these optimal function according to the maximum number of zero coefficients is selected. This paper presents a method for the generation of GRM coefficients by means of compare to the number of zero coefficients without constructing the whole polarity GRM coefficients.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.5
• /
• pp.67-75
• /
• 1999

This paper presents a production method to GRM coefficients which are consist of $P^n$ polarities to n variables over GF(p). In general production method to GRM coefficients is derived from RM coefficients to polarity 0 using RM expansion and extended to GRM coefficients. The procedure of proposed production method to GRM coefficients is consists of 2 steps. First, obtain the optimal polarity which is contains a minimal operation to single variable and then apply the same process to all generation process of GRM coefficients using cyclic property of the polarity. Proposed method simplify the generation procedure and reduces a number of operators because of the cyclic property of polarity.