• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.2
• /
• pp.110-115
• /
• 2000

A receding horizon FIR filter is suggested for discrete time-varying systems, combining the Kalman filter with the receding horizon strategy. The suggested filter is shown to be an FIR structure that has many good ingerent properties. The suggested filter is represented in an iterative form and also in a standard FIR form. The suggested filter turns out to be a remarkable deadbeat observer that is often robust against system and measurement noises. It is also shown that the suggested filter is an unbiased estimator irrespective of any horizon initial condition. For the amenability to parallel and systolic implementation as well as the numerical stability, a square-root algorithm for the suggested filter is presented. To evaluate performance, the suggested filter is applied to a problem of unknown input estimation and compared with the existing Kalman filter based approach.

• Journal of Hydrospace Technology
• /
• v.2 no.2
• /
• pp.24-35
• /
• 1996

This paper describes parameter identification techniques formulated for the estimation of maneuvering coefficients of a submerged body. The first part of this paper is concerned with the identifiability of the system parameters. The relationship between a stochastic linear time-invariant system and the equivalent dynamic system is investigated. The second is concerned with the development of the numerically stable identification technique. Two identification techniques are tested; one is the ma7mum likelihood (ML) methods using the Holder & Mead simplex search method and using the modified Newton-Raphson method, and the other is the modified extended Kalman filter (MEKF) method with a square-root algorithm, which can improve the numerical accuracy of the extended Kalman filter. As a results, it is said that the equations of motion for a submerged body have higher probability to generate simultaneous drift phenomenon compared to general state equations and only the ML method using the Holder & Mead simplex search method and the MEKF method with a square-root algorithm gives acceptable results.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1565-1571
• /
• 2005

Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).

• Communications for Statistical Applications and Methods
• /
• v.4 no.3
• /
• pp.817-825
• /
• 1997

Images reconstructed with EM algorithm have been observed to have checkerboard effects and have large distortions near edges as iterations proceed. We suggest a aimple algorithm of applying line process to the EM and Bayesian EM to reduce the distortions near edges. We show by simulation that this algorithm improves the clarity of the reconstructed image and has good properties based on root mean square error.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1769-1774
• /
• 2009

An algorithm for extracting the BJT DC model parameter values for SPICE model is proposed. The nonlinear optimization method for analyzing the device I-V data using the Levenberg-Marquardt algorithm is proposed and the method for calculating initial conditions of model parameters to improve the convergence characteristics is proposed. The base current and collector current obtained from the proposed method shows the root mean square error of 6.04% compared with the measured data of the PNP BJT named 2SA1980.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.1
• /
• pp.1-11
• /
• 2017

In this study, novel approximate form of the square-root operator of three dimensional acoustic Parabolic Equation (3D PE) is proposed using a rational approximant for two variables. This form has two advantages in comparison with existing approximation studies of the square-root operator. One is the wide-angle capability. The proposed form has wider angle accuracy to the inclination angle of ${\pm}62^{\circ}$ from the range axis of 3D PE at the bearing angle of $45^{\circ}$, which is approximately three times the angle limit of the existing 3D PE algorithm. Another is that the denominator of our approximate form can be expressed into the product of one-dimensional operators for depth and cross-range. Such a splitting form is very preferable in the numerical analysis in that the 3D PE can be easily transformed into the tridiagonal matrix equation. To confirm the capability of the proposed approximate form, comparative study of other approximation methods is conducted based on the phase error analysis, and the proposed method shows best performance.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1321-1327
• /
• 2019

This paper describes an efficient hardware implementation of modular square root (MSQR) computation over GF(p), which is the operation needed to map plaintext messages to points on elliptic curves for elliptic curve (EC)-ElGamal public-key encryption. Our method supports five sizes of elliptic curves over GF(p) defined by the National Institute of Standards and Technology (NIST) standard. For the Koblitz curves and the pseudorandom curves with 192-bit, 256-bit, 384-bit and 521-bit, the Euler's Criterion based on the characteristic of the modulo values was applied. For the elliptic curves with 224-bit, the Tonelli-Shanks algorithm was simplified and applied to compute MSQR. The proposed method was implemented using the finite field arithmetic circuit with 32-bit datapath and memory block of elliptic curve cryptography (ECC) processor, and its hardware operation was verified by implementing it on the Virtex-5 field programmable gate array (FPGA) device. When the implemented circuit operates with a 50 MHz clock, the computation of MSQR takes about 18 ms for 224-bit pseudorandom curves and about 4 ms for 256-bit Koblitz curves.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1203-1210
• /
• 1999

Coefficients of the adaptive filter are misadjusted by primary signals which are uncorrelated with reference signals of the adaptive filter. In this paper, the normalized sign algorithm is analyzed and compared with the NLMS algorithm by the steady state performance and the transient characteristics when target signals are included in primary signals. The excess mean square error of the NLMS algorithm is proportional to the power of target signals. That of normalized sign algorithm is proportional to the square root of the target signal power. However, the convergence speed of the normalized sign algorithm is slower than that of NLMS algorithm. In this paper, it is shown that theoretical analysis of the steady state performance and the transient characteristics are well consisted with the results of computer simulation.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.109-118
• /
• 2014

We studied the creation of fractal images with polygonal rotation symmetry. As in Loocke's method[13] we start with IFS of affine functions that create polygonal fractals and extends the IFS by adding functions that create Julia sets instead of adding square root functions. The resulting images are rotationally symmetric and Julia set shaped. Also we can improve fractal images by modifying probabilistic IFS algorithm, and we suggest a method of deforming Julia set by changing exponent value.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.142-146
• /
• 2007

본 연구에서는 강우강도식의 매개변수를 보다 효율적으로 산정하기 위해서 유전자알고리즘을 적용한 매개변수 산정법을 제시하였으며, 지속기간의 장, 단기간에 따른 매개변수의 변화를 고려하기 위하여 다목적 유전자알고리즘을 적용하여 매개변수를 추정한 후 기존의 강우강도식에 의한 결과와 비교해 보았다. 매개변수는 지점빈도해석을 통해 산정된 확률강우량을 사용하여 추정하였고, 유전자 알고리즘의 목적함수로는 Nash & Sutcliffe Index, Root Mean Square Error(RMSE), Relative Root Mean Square Error(RRMSE), 결정계수, 평균들을 사용하여 가장 효율적인 형태의 목적함수를 구성하였다. 그 결과 기존의 매개변수 추정 방법들에 비해 유전자알고리즘을 이용한 경우에 더 정확한 강우량값을 산정할 수 있었고, 특히 다목적 유전자 알고리즘을 사용할 경우 장기간과 단기간에 걸쳐서 동시에 정확도를 향상시킬 수 있는 매개변수를 추정할 수 있는 것으로 나타났다.