• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

• Korean Journal of Optics and Photonics
• /
• v.9 no.4
• /
• pp.245-250
• /
• 1998

A new computational algorithm is presented for the peak point detection of white light interferograms. Assuming the visibility function of white light interferograms as a quadratic polynomial, the peak point is searched so as to minimize the error sum between the measured intensity data and the analytical intensity. As compared with other existing algorithms, this new algorithm requires less computation since the peak point is simply determined with a single step matrix multiplication. In addition, a good robustness is obtained against external random disturbances on measured intensities since the algorithm is based upon least squares principles.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.22-33
• /
• 1999

This paper presents the method for the automatic tuning of a design weighting polynomial parameters of a generalized minimum-variance stochastic ultivariable self-tuning controller which adapts to changes in the higher order nonminimum phase system parameters with time delays and noises. The self-tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing the design weighting polynomial parameters of the controller. The proposed multivariable self-tuning method is simple and effective compared with pole restriction method. The computer simulation results are presented to adapt the higher order multivariable system with nonminimum phase and with changeable system parameters.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.87-95
• /
• 1998

This paper presents the method for the automatic tuning of a design weighting polynomial parameter of a generalized minimum-variance stochastic self tuning controller which adapts to changes in the system parameters with time delays and noises. The self tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing a design weighting polynomial parameters. The proposed self tuning method is simple and effective compared with other existing self tuning methods. The computer simulation results are presented to illustrate the procedure and to show the performance of the control system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.10-16
• /
• 2010

90/150 CA is a CA completely specified by using rule 90 and rule 150. Since 90/150 CA whose minimal and characteristic polynomials are identical has outstanding randomness, this CA is more attractive than LFSR. Sarkar proposed a scheme based on the 90 uniform CA and the 150 uniform CA. That scheme provided authentication by digital signature and other basic security requirements like confidentiality. In this paper we analyze 90 or 150 uniform CA and give a synthesis method of 2n-cell uniform CA and (2n+1)-cell uniform CA using a special n-cell 90/150 CA. And we propose an effective method of computation of characteristic polynomial corresponding to uniform CA.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1343-1344
• /
• 2015

본 연구에서는 증분형 FCM(Incremental Fuzzy C-Means: Incremental FCM) 클러스터링 알고리즘을 기반으로 방사형 기저함수 신경회로망(Radial Basis Function Neural Networks: RBFNN) 패턴 분류기를 설계한다. 방사형 기저함수 신경회로망은 조건부에서 가우시안 함수 또는 FCM을 사용하여 적합도를 구하였지만, 제안된 분류기에서는 빅 데이터간의 적합도를 구하기 위해 증분형 FCM을 사용한다. 또한, 빅 데이터를 학습하기 위해 결론부에서 재귀최소자승법(Recursive Least Square Estimation: RLSE)을 사용하여 다항식 계수를 추정한다. 마지막으로 추론부에서는 증분형 FCM에서 구한 적합도와 재귀최소자승법으로 구한 다항식을 이용하여 최종 출력을 구한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.5 s.335
• /
• pp.23-30
• /
• 2005

In the construction of an extension field, there is a connection between the polynomial multiplication method and the degree of polynomial. The existing methods, KO and MSK methods, efficiently reduce the complexity of coefficient-multiplication. However, when we construct the multiplication of an extension field using KO and MSK methods, the polynomials are padded with necessary number of zero coefficients in general. In this paper, we propose basic properties of KO and MSK methods and algorithm that can reduce coefficient-multiplications. The proposed algorithm is more reducible than the original KO and MSK methods. This characteristic makes the employment of this multiplier particularly suitable for applications characterized by specific space constrains, such as those based on smart cards, token hardware, mobile phone or other devices.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.3
• /
• pp.257-264
• /
• 1999

The lens distortions were corrected directly using the high-order polynomial which was offered in camera calibration data for the forward transformation and the root of Newton-Raphson's $2\times{2}$ nonlinear system for the backward transformation. The 0.04~0.08 pixels increase in accuracy was indicated through the use of direct correction of lens distortions instead of least square methods of commercial software. The least square adjustment method of high-order polynomial requires many control points which has a same weight. But this suggested method which is unnecessary to determine control points was developed and applied. The algorithm showed improved efficacy.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5A
• /
• pp.457-465
• /
• 2009

This study presents a moving least squares (MLS) finite difference method for solving elastic crack problems with stress singularity at the crack tip. Near-tip functions are intrinsically employed in the MLS approximation to model near-tip field inducing singularity in stress field. employment of the functions does not lose the merit of the MLS Taylor polynomial approximation which approximates the derivatives of a function without actual differentiating process. In the formulation of crack problem, computational efficiency is considerably improved by taking the strong formulation instead of weak formulation involving time consuming numerical quadrature Difference equations are constructed on the nodes distributed in computational domain. Numerical experiments for crack problems show that the intrinsically enriched MLS finite difference method can sharply capture the singular behavior of near-tip stress and accurately evaluate stress intensity factors.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.308-313
• /
• 2009

본 논문은 확장된 이동최소제곱 유한차분법을 이용하여 1차원 Stefan 문제를 해석할 수 있는 수치기법이 제시한다. 이동하는 경계의 자유로운 묘사를 위해 요소망이나 그리드 없이 절점만을 사용하는 이동최소제곱 유한차분법을 사용하였으며, 계면경계의 특이성을 모형화하기 위해 Taylor 다항식에 쐐기함수를 도입했다. 지배방정식은 안정성이 높은 음해법(implicit method)을 이용하여 차분하였다. 미분의 특이성을 갖는 이동경계를 포함한 반무한 융해문제의 수치해석을 통해 확장된 이동최소제곱 유한차분법이 높은 정확성과 효율성을 갖는 것을 보였다.