• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.93-101
• /
• 2007

To jointly optimize the spatial registration and the exposure compensation, an iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm, which is based on the histogram transformation function. Based on a simple regression model, a nonparametric estimator, the empirical conditional mean, and its polynomial fitting are used as histogram transformation functions for the exposure compensation. Since the proposed algorithm is composed of separable optimization phases, the proposed algorithm is more advantageous than the joint approaches of Mann and Candocia in the aspect of implementation flexibility. The proposed algorithm performs a better registration for real images than the case of registration that does not consider the exposure difference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.117-122
• /
• 2006

In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.468-475
• /
• 2003

In this Paper, we design an optimal binary phase computer generated hologram for Pattern generation using combined genetic algorithm and simulated annealing algorithm together. To design an optimal binary phase computer generated hologram, in searching process of the proposed method, the simple genetic algorithm is used to get an initial random transmittance function of simulated annealing algorithm. Computer simulation shows that the proposed algorithm has better performance than the genetic algorithm or simulated annealing algorithm of terms of diffraction efficiency

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.561-571
• /
• 1993

In this paper, a new discrete Symbol Timing Recovery (STR) algorithm, is proposed. This algorithm is derived from the optimum estimation theory. The algorithm combines the advantages of Mueller and $M\"{u}ller$ algorithm and Gardner algorithm, and avoids some of their shortcomings. The implementation of the new timing detector is simple and the combined operations of Carrier Recovery (CR) -STR is possible because the operation of the new STR is independent of the carrier phase. On the other hand, the behavior of nonlinear characteristics in the new algorithm is analyzed and explained. The performance evaluation is accomplished in detail by numerical calculations and Monte-Carlo simulations. In these respects, this algorithm is similar to Gardner's algorithm, but in tracking performance due to pattern jitter at small rolloff, the proposed algorithm is superior to Gardner's algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.261-269
• /
• 2014

There are many researches on fast exponentiation algorithm which is used to implement a public key cryptosystem such as RSA. On the other hand, the malicious attacker has tried various side-channel attacks to extract the secret key. In these attacks, an attacker uses the power consumption or electromagnetic radiation of cryptographic devices which is measured during computation of exponentiation algorithm. In this paper, we propose a novel simple power analysis attack on m-ary exponentiation implementation. The core idea of our attack on m-ary exponentiation with pre-computation process is that an attacker controls the input message to identify the power consumption patterns which are related with secret key. Furthermore, we implement the m-ary exponentiation on evaluation board and apply our simple power analysis attack to it. As a result, we verify that the secret key can be revealed in experimental environment.

• Aerospace Engineering and Technology
• /
• v.11 no.1
• /
• pp.169-177
• /
• 2012

This paper considers the explicit guidance algorithm to determine the closed-loop guidance law applicable to upper stages of a given space launch vehicle. It has the advantage of very simple forms derived from the flat earth assumption, which is appropriate for its on-board application. However the simple time-to-go prediction equation produces the degraded guidance performance of the launcher because of its inaccuracy. To overcome the problem, the elaborate prediction equations, which have been employed in Saturn and H-II, are attempted here. Finally, the simulation results show that the simple guidance approach requires the more accurate time-to-go prediction and gravity integrals for its broad application.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.887-892
• /
• 2003

In this paper, we propose a simple scaling algorithm for CDMA mobile communications where a voice traffic signals are transmitted by individual one of several data rates at every frames. The traditional method is based on using look-up table called SMT(symbol metric table), but the proposed algorithm is real-time direct scaling method through simple bit manipulations without lookup table. The bit error rate performance is calculated by computer simulation over AWGN and Rayleigh fading channels. From the results, it is shown that the proposed algorithm outperforms the traditional SMT method on Rayleigh channel by 0.3∼0.8dB, while achieving the less H/W complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.211-220
• /
• 2002

In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.12
• /
• pp.1725-1736
• /
• 2002

We describe a characteristic behavior of edge signal intensity, the strictly monotonic variation of intensity across edges and propose a new algorithm for edge detection based on it. We define an extended directional derivatives, which is nonlocal and beyond scaling in the pixel space, to describe that the algorithm is adaptive to the various widths of edges and relevant as an optimal edge detection algorithm. As an industrial application of the algorithm, we discuss a simple computer vision procedure for an example of visual inspection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2113-2119
• /
• 1998

The optimization problem of BDDs plays an improtant role in the area of logic synthesis and formal verification. Since the variable ordering has great impacts on the size and form of BDD, finding a good variable order is very important problem. In this paper, a new variable ordering scheme called incremental optimization algorithm is presented. The proposed algorithm reduces search space more than a half of that of the conventional sifting algorithm, and computing time has been greatly reduced withoug depreciating the performance. Moreover, the incremental optimization algorithm is very simple than other variable reordering algorithms including the sifting algorithm. The proposed algorithm has been implemented and the efficiency has been show using may benchmark circuits.