• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1694-1700
• /
• 2004

In this paper, we propose the AWLS/MFT (Adaptive Weighed Least Squares/ Modulation Function Technique) devised by A. E. Pearson et al. for the transfer function estimation of a modal system and investigate the performance of several algorithms, the Gram matrix method, a Luenberger Observer (LO), Least Squares (LS), and Recursive Least Squares (RLS), for the estimation of initial conditions. With the benefit of the Modulation Function Technique (MFT), we can separate the estimation problem into two phases: the transfer function parameters are estimated in the first phase, and the initial conditions are estimated in the second phase. The LO method produces excellent IC estimates in the noise free case, but the other three methods show better performance in the noisy case. Finally, we compared our result with the Prony based method. In the noisy case, the AWLS and one of the three methods - Gram matrix, LS, and RLS- show better performance in the output Signal to Error Ratio (SER) aspect than the Prony based method under the same simulation conditions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.90-95
• /
• 2003

In this paper, an Adaptive Nonlinear Constrained Model Predictive Control (ANCMPC) is presented for a pH control in a fed-batch bio-reactor. The pH model is represented with Hammerstein Model. The static nonlinear part of Hammerstein model is described with the static pH model, and the dynamic linear part of the Hammerstein model is described with the CARIMA model. The parameters of the CARIMA model is estimated on-line with the input and output measurements of the system using a recursive least squares type of identi�cation algorithm. The e�ectiveness of the proposed controller is shown through simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1249-1253
• /
• 2003

License plate recognition is very important in an automobile society. This is because, since plate detection accuracy has large influence on subsequent number recognition, it is very important. However, it is very difficult to do it, because a background and a body color of cars are similar to that of the license plate. In this paper, we propose a new thresholds determination method in the various background by using the real-coded genetic algorithm (RGA). By using RGA, the most likely plate colors are decided under various lighting conditions. First, the average brightness Y values of images are calculated. Next, relationship between the Y value and the most likely plate color thresholds (upper and lower bounds)are obtained by RGA. The relationship between thresholds decided from RGA and brightness average is aproximate by using the recursive least squares (RLS) algorithm. In the case of plate detection, thresholds are decided from these functions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1771-1776
• /
• 2003

In mobile robot navigation, one of the key problems is the pose estimation of the mobile robot. Although the odometry can be used to describe the motions of the mobile robots quite simple and accurately, the validities of the models are limited by a number of error sources contaminating the encoder outputs so that applying the conventional extended Kalman filter to these nominal model does not yield the satisfactory performance. As a remedy for this problem, we consider the uncertain nonlinear kinematic model of the mobile robot that contains the norm bounded uncertainties and also propose a new robust extended Kalman filter based on the Krein space approach. The proposed robust filter has the same recursive structure as the conventional extended Kalman filter and can hence be readily designed to effectively account for the uncertainties. The computer simulations will be given to verify the robustness against the parameter variation as well as the reliable performance of the proposed robust filter.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1822-1825
• /
• 2003

A practical range estimator based on the robust Kalman filter is proposed to solve the range estimation problem for surface to air missile(SAM) homing guidance. Apart from the previous works based on the extended Kalman filter(EKF) with bearing only measurement, the proposed scheme makes use of line-of-sight(LOS) rate to ensure the fast convergency at long-range. In this reason, the robust Kalman filter is considered to deal with LOS rate measurement error. The recursive linear structure of proposed filter is easy to implement and make it possible to reduce computational burdens. Moreover, it shows good estimation performance without specific guidance law such as oscillation proportional navigation guidance(OPNG).

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.649-652
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,2D2) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of $10^{-3}$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1326-1337
• /
• 1995

In this paper, we transformed the bilinear filter into an equivalent linear multichannel filter and derived QR decomposition based recursive least squares algorithms for bilinear lattice filters. We also defined order update relation of the forward and the backward input vectors by using the channel decomposition. The forward and the backward data matrices were defined by using the forward and the backward input vectors and orthogonalized with the QR decomposition. we can obtain the lattice equations of the bilinear filters by using the channel decomposition. we can be derived the lattice equations of the bilinear filters using this decomposition process which are the same as the lattice equations derived by Baik, we can use the coefficient transformation algorithm proposed by Baik. We derived the equation error and the output error algorithm of the QRD based RLS bilinear lattice algorithm. Also, we evaluated the performance of the proposed algorithms through the system identification of the bilinear system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.8 s.338
• /
• pp.1-10
• /
• 2005

In this paper, the explicit low density codes construction from the generalized permutation matrices related to algebra theory is investigated, and we design several Jacket inverse block matrices on the recursive formula and permutation matrices. The results show that the proposed scheme is a simple and fast way to obtain the low density codes, and we also Proved that the structured low density parity check (LDPC) codes, such as the $\pi-rotation$ LDPC codes are the low density Jacket inverse block matrices too.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.16-25
• /
• 1994

The major reason that reduces the performance of satellite communication channels is known as the nonlinearities of high power amplifiers(HPA's) which are usually modeled by memoryless nonlinear systems, in the channels. This paper proposes a nonlinear adaptive predistorter,which predistorts the input symbols such that the symbol passing through the nonlinear HPA preserves the desired constellation, and derives the region of convergence for the predistorter. The predistorter has capability of coping adaptively with any time-varying environment such as changes of operating points if HPA since the coefficients of the predistorter which has a form of truncated Tayler series are obtained by recursive optimization procedure utilizing QAM data sequence directely. Simulation results show that the proposed one with 16 QAM input has better performance than the conventional fixed predistorter with the same input.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.49-57
• /
• 1994

An efficient approach for the computationtion of the optimum convergence factor is proposed for the LMS algorithm applied to a transversal FIR structure in this study. The approach automatically leads to an optimum step size algorithm at each weight in every iteration that results in a dramatic reduction in terms of convergence time. The algorithm is evaluated in system identification application where two alternative computer simulations are considered for time-invariant and time-varying system cases. The results show that the proposed algorithm needs not appropriate convergence factor and has better performance than AGC(Automatic Gain Control) algorithm and Karni algorithm, which require the convergence factors controlled arbitrarily in computer simulation for time-invariant system and time-varying systems. Also, itis shown that the proposed algorithm has the excellent adaptability campared with NLMS(Normalized LMS) algorithm and RLS (Recursive least Square) algorithm for time-varying circumstances.