• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1217-1233
• /
• 2015

The paper studies characteristics of the minimum mean-square error symmetric scalar quantizers for the generalized gamma, Bucklew-Gallagher and Hui-Neuhoff probability density functions. Toward this goal, asymptotic formulas for the inner- and outermost thresholds, and distortion are derived herein for nonuniform quantizers for the Bucklew-Gallagher and Hui-Neuhoff densities, parallelling the previous studies for the generalized gamma density, and optimal uniform and nonuniform quantizers are designed numerically and their characteristics tabulated for integer rates up to 20 and 16 bits, respectively, except for the Hui-Neuhoff density. The assessed asymptotic formulas are found consistently more accurate as the rate increases, essentially making their asymptotic convergence to true values numerically acceptable at the studied bit range, except for the Hui-Neuhoff density, in which case they are still consistent and suggestive of convergence. Also investigated is the uniqueness problem of the differentiation method for finding optimal step sizes of uniform quantizers: it is observed that, for the commonly studied densities, the distortion has a unique local minimizer, hence showing that the differentiation method yields the optimal step size, but also observed that it leads to multiple solutions to numerous generalized gamma densities.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.1
• /
• pp.127-132
• /
• 2007

This paper proposed receding methods for a radix-${\gamma}$ representation of the secret scalar which are resistant to SPA. Unlike existing receding method, these receding methods are left-to-right so they can be interleaved with a left-to-right scalar multiplication, removing the need to store both the scalar and its receding. Hence, these left-to-right methods are suitable for implementing on memory limited devices such as smart cards and sensor nodes

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.139-149
• /
• 2010

Random scalar countermeasures, which carry out the scalar multiplication by the ephemeral secret key, against the differential power analysis of ECIES and ECDH have been known to be secure against various power analyses. However, if an attacker can find this ephemeral key from the one power signal, these countermeasures can be analyzed. In this paper, we propose a new power attack method which can do this analysis. Proposed attack method can be accomplished while an attacker compares the elliptic curve doubling operations and we use the principle component analysis in order to ease this comparison. When we have actually carried out the proposed power analysis, we can perfectly eliminate the error of existing function for the comparison and find a private key from this elimination of the error.

• Journal of Elementary Mathematics Education in Korea
• /
• v.22 no.4
• /
• pp.369-384
• /
• 2018

Multiplication is able to be described by using repeated addition, a Cartesian product, a scalar operation, rectangular array and area in many various context. Multiplication in various problem situations is learned by various of the teaching method and the order of teaching more than any other mathematical concepts and operations in elementary school. Nevertheless, the context of multiplication leaves further room for improvement. The purpose of this study is to examine the similarities and differences between the conceptual aspects of multiplication through the literature and to analyze the appropriateness of the teaching method and the order of teaching through textbook analysis. As a result of the study, it was found that multiplication of a scalar operation was introduced too early and did not properly reflect of meaning of multiplication as a scalar operation. There is also a need to use the concept of the rectangular array or area as a meaning of multiplication two quantities.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.12-22
• /
• 1996

A numerous designs of PI controllers have been suggested to solve out trade-off between tracing and regulating problems. We constructed the PI controller system with two-degree-of-freedom that is more analytic and a better approach to a practical one. In the conventional H$_{2}$ design of optimal PI controllers, the cost function includes only the plant output terms due to the divergent problems. Since the platn input temr is not considered in PI controller design, occasionally, the plant input thends to be either very large or saturated. To solve the prior mentioned problems, we employed a mixed $H_2/H_{\infty}$ method that combines the H$_{2}$ design method to decide optimal parameters of PI controller and the $H_2/H_{\infty}$ design method to minimize the maximum amplitude of plant input. The calculation time of the H$_{infty}$ norm was considerably reduced by the simple scalar function obtained by the wiener-hopf factorization of non-scalar functions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.3
• /
• pp.20-25
• /
• 1980

A singular value decomposition (SVD) pseudo-inversion method has been applied to the image reconstruction from projections. This approach is relatively unknown and differs from conventionally used reconstructioll methods such as the Foxier convolution and iterative techniques. In this paper, two SVD pseudo-inversion methods have been discussed for the search of optimum reconstruction and restoration, one using truncated inverse filtering, the other scalar Wiener filtering. These methods partly overcome the ill-conditioned nature of restoration problems by trading off between noise and signal quality. To test the SVD pseudo-inversion method, simulations were performed from projection data obtained from a phantom using truncated inversefiltering. The results are presented together with some limitations particular to the applications of the method to the general class of 3-D image reconstruction and restoration.

• Journal of Mechanical Science and Technology
• /
• v.18 no.8
• /
• pp.1470-1478
• /
• 2004

In this paper, a new 'presumed' Probability Density Function (PDF) approach coupled with a Lagrangian tracking method is proposed for turbulent combustion modeling. The test and the investigation of the model are conducted by comparing the model results with DNS data for a premixed flame subjected in a decaying turbulent field. The newly constructed PDF, which incorporates the instantaneous chemical reaction term, demonstrates consistent improvement over conventional assumed PDF models. It has been found that the time evolution of the mean scalar, the variance and the mean reaction rate are strongly influenced by a parameter deduced by a Lagrangian equation which takes into account explicitly the local reaction rate. Tests have been performed for a moderate Damkohler number, and it is expected the model may cover a broader range of Damkohler number. The comparison with the DNS data demonstrates that the proposed model may be promising and affordable for implementation in a moment-equation solver.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.225-228
• /
• 1992

The purpose of this project is the presentation of new method for selection of a scalar control of linear time-periodic system. The approach has been proposed by Radziszewski and Zaleski [4] and utilizes the quadratic form of Lyapunov function. The system under consideration is assigned either in closed-loop state or in modal variables as in Calico, Wiesel [1]. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T, each element being represented by a Fourier series. As the optimal gain matrix we consider the matrix ensuring the minimum value of the larger real part of the two Poincare exponents of the system. The method, based on two-step optimization procedure, allows to find the approximate optimal gain matrix. At present state of art determination of the gain matrix for this case has been done by systematic numerical search procedure, at each step of which the Floquet solution must be found.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.83-87
• /
• 1999

The purpose of this study is to provide the new method for selection of a close to optimal scalar control of linear time-periodic system. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T. The form of gain matrix may have various kinds but must have same period, for example, one of each element being represented by Fourier series. As the optimal gain matrix I consider the matrix ensuring the minimum value of the larger real part of the Poincare exponents of the system. Finally we present a pole placement algorithm to make the given system be stable. It is possible to determine the stability of the given periodic system without get the analytic solution. The application of the method does not require the construction of the Floquet solution. At present state of determination of the gain matrix for this case will be done only by systematic numerical search procedures.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.4
• /
• pp.3-19
• /
• 2009

This paper proposes efficient scalar multiplication algorithms based on Montgomery ladder method. The proposed algorithm represents the scalar as ternary or quaternary and applies new composite formulas utilizing only x coordinate on affine coordinate system in order to improve performance. Furthermore, side-channel atomicity mechanism is applied on the proposed composite formulas to prevent simple power analysis. The proposed methods saves at least 26% of running time with the reduced number of storage compared with existing algorithms such as window-based methods and comb-based methods.