• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.3
• /
• pp.191-200
• /
• 2002

In this paper, we present the method transforming the interval functions into the truncated difference functions for multi-variable multi-valued functions and implementing the truncated difference functions to the multiple valued logic circuits with uniform patterns using the current mirror circuits and the inhibit circuits by current-mode CMOS. Also, we apply the presented methods to the implementation of circuits for additive truth table of 2-variable 4-valued MOD(4) and multiplicative truth table of 2-variable 4-valued finite fields GF(4). These circuits are simulated under 2${\mu}{\textrm}{m}$ CMOS standard technology, 15$mutextrm{A}$ unit current, and 3.3V power supply voltage using PSpice. The simulation results have shown the satisfying current characteristics. Both implemented circuits using current-mode CMOS have the uniform Patterns and the regularity of interconnection. Also, it is expansible for the variables of multiple valued logic functions and are suitable for VLSI implementation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.409-416
• /
• 2017

In this paper, we consider a framework of compressed sensing over finite fields. One measurement sample is obtained by an inner product of a row of a sensing matrix and a sparse signal vector. A recovery algorithm proposed in this study for sparse signals based probabilistic decoding is used to find a solution of compressed sensing. Until now compressed sensing theory has dealt with real-valued or complex-valued systems, but for the processing of the original real or complex signals, the loss of the information occurs from the discretization. The motivation of this work can be found in efforts to solve inverse problems for discrete signals. The framework proposed in this paper uses a parity-check matrix of low-density parity-check (LDPC) codes developed in coding theory as a sensing matrix. We develop a stochastic algorithm to reconstruct sparse signals over finite field. Unlike LDPC decoding, which is published in existing coding theory, we design an iterative algorithm using probability distribution of sparse signals. Through the proposed recovery algorithm, we achieve better reconstruction performance as the size of finite fields increases. Since the sensing matrix of compressed sensing shows good performance even in the low density matrix such as the parity-check matrix, it is expected to be actively used in applications considering discrete signals.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.89.5-89
• /
• 2002

The technology to predict new chemical compounds by using properties of already known compounds is a kind of data mining and an important technology in chemical industrial fields. Many knowledge have been accumulated in the fields, and especially nowadays in the field of medicine development industry, the technology is connected with the post genome technology, and generates a new conception, physiome. The word is defined as followings. It is the quantitative and integrated description of the functional behavior of the physiological state of an individual or species. The physiome describes the physiological of the normal intact organism and is built on information and structure, that is geno...

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.441-453
• /
• 2005

In this article we will introduce a real valued random field on a restricted indexed set and construct a classical asymptotic limit theorems on them. We will survey the basic properties of weakly dependent random processes and investigate two major mixing conditions for sequences of random variables. The concepts of weakly dependent sequence of random variables will be generalized to the case of random fields. Finally we will construct a central limit theorem and prove it.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.393-400
• /
• 1994

Let M(f,η,ξ,g) be a (2m ＋ 1)-dimensional Sasakian manifold with soldering form dp ∈ ΓHom(Λ/sup q/TM, TM) (dp: canonical vector-valued 1-form) where f,η,ξ and g are the (1,1)-tensor field, the structure 1-form, the structure vector field and the metric tensor of M, respectively.(omitted)

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.659-664
• /
• 2006

The Context-Aware system is the core technology in the Ubiquitous Computing Environment. Recently, the practical use of a sensor is magnified and the application fields of it are gradually extended in order to collect necessary context information. Context-Aware service integrates the context information which is collected by sensors, and then provides, a suitable service to a user through the process of analysis and reasoning. This service is studied in a variety of fields such as marketing, medical treatment, education and so on. In this paper, we analyze the method of recognizing surrounding context and the result of the awareness by using differential and structural property of multiple valued logic function; propose the model that provides appropriate service depending on the change of surrounding contort; confirm the applicability of the Context-aware system by showing the example of application.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.237-247
• /
• 2014

This paper describes a 2D discrete-time wavelet transform for which the Q-factor is easily specified. Hence, the transform can be tuned according to the oscillatory behavior of the image signal to which it is applied. The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet transform for which the Q-factor, Q, of the underlying wavelet and the asymptotic redundancy (over-sampling rate), r, of the transform are easily and independently specified. In particular, the specified parameters Q and r can be real-valued. Therefore, by tuning Q, the oscillatory behavior of the wavelet can be chosen to match the oscillatory behavior of the signal of interest, so as to enhance the sparsity of a sparse signal representation. The TQWT is well suited to fast algorithms for sparsity-based inverse problems because it is a Parseval frame, easily invertible, and can be efficiently implemented. The TQWT can also be used as an easily-invertible discrete approximation of the continuous wavelet transform. The transform is based on a real valued scaling factor (dilation-factor) and is implemented using a perfect reconstruction over-sampled filter bank with real-valued sampling factors. The transform is parameterized by its Q-factor and its oversampling rate (redundancy), with modest oversampling rates (e. g. 3-4 times overcomplete) being sufficient for the analysis/synthesis functions to be well localized. Therefore, This method services good performance in image processing fields.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.827-832
• /
• 2012

In this paper, we present a new decimated Gold-like m-sequence with a binary m-sequence of period $2^n-1$. And we show that the cross-correlation function of the proposed sequence is four-valued.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.165.1-165
• /
• 2001

The evolution strategy is a good evolutionary algorithm to find the global optimum of a real-valued function. Since many engineering problems can be formulated as real valued function optimization, the evolution strategy is frequently employed in engineering fields. However, in many engineering optimization problems, an optimization parameter is often restricted in the bounded region between two specified values, the minimum and the maximum limit, respectively. Since an offspring individual is generated randomly around a parent individual during mutation process of the evolution strategy, an individual outside the search region can be generated even if the parent is inside the search region. This paper proposes two new boundary-handling techniques for evolution strategies. One is the ...

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.23-26
• /
• 2014

Let E be a graded central division algebra (GCDA) over a grade field R. Let S be an unramified graded field extension of R. We describe the grading on the underlying GCDA E' of $E{\otimes}_RS$ which is analogous to the valuation on a tame division algebra over Henselian valued field.