• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.32-43
• /
• 1994

This paper presents new QRD-based recursive least squares algorithms for bilinear lattice filter. Bilinear recursive least square lattice algorithms are derived by using the QR decomposition for minimization covariance matrix of predication error by applying Givens rotation to the bilinear recursive least squares lattics algorithms. The proposed algorithms are applied to the bilinear system identification to evaluate the performance of algoithms. Computer simulations show that the convergence properties of the proposed algorithms are superior to that of the algorithms proposed by Baik when signal includes the measurement noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1655-1662
• /
• 1993

In this paper we discuss three algorithms-Direct, Successive, and Recursive-on parallel CRC(Cyclic Redundancy Check) verification. The algorithms are derived by combining the byte-syndromes precomputed from the generator polynomial. These algorithms are compared in terms of the amount of hardware and the speed of operation. Since the algorithms can be generalized easily, we took the ATM cell delineation example for easier description. As an application of the algorithm Recursive, an ATM cell delineation module suitable for STM-1 transmission has been successfully realized through commercially available field programmable gate arrays.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.525-525
• /
• 2000

In this paper, we present recursive algorithms for state space model identification using subspace extraction via Schur complement. It is shown that an estimate of the extended observability matrix can be obtained by subspace extraction via Schur complement. A relationship between the least squares residual and the Schur complement matrix obtained from input-output data is shown, and the recursive algorithms for the subspace-based state-space model identification (4SID) methods are developed. We also proposed the above algorithm for an instrumental variable (IV) based 4SID method. Finally, a numerical example of the application of the algorithms is illustrated.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.419-423
• /
• 1996

These days, industrial robots are required to have high speed and high precision in doing various tasks. Recently, the adaptive control algorithms for those nonlinear robots have been developed. With spatial vector space, these adaptive algorithms including recursive implementation are simply described. Without sensing joint acceleration and computing the inversion of inertia matrix, these algorithms which include P.D. terms and feedforward terms have global tracking convergence. In this paper, the feasibility of the proposed control method is illustrated by applying to 2 DOF SCARA robot in DSP(Digital Signal Processing).

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.249-258
• /
• 2002

One of the jai or purposes of multiprocessor system is to get a high efficiency in performance improvement. But in most cases, it is unavoidable to use some special programming languages or tools for full use of multiprocessor system. In general, loop and recursive call statements of algorithms are considered as typical parts for parallelization. Especially, recursive call statements are easy to parallelize conceptually without support of any special languages or tools. But it is difficult to control the degree of parallelism caused by high depth of recursive call leading to execution crash. This paper proposes a device to control Parallelism in the process of POSIX thread bated parallelization of recursive algorithms. For this, we define the concept of thread and process in UNIX system, and analyze the results of experimental application of the device to quick sorting algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.05a
• /
• pp.570-573
• /
• 2000

A control law for a SCARA robot manipulator is designed using recursive torque methods. This scheme uses previous torques and error dynamics to generate torque controls at the present time and adopts relatively simple numerical and control algorithms that can be easily realizable. In order to evaluate the performance and robustness of the suggested control system, the 2-link SCARA robot manipulator is practically implemented using a dSPACE interface. It is found that the recursive controller has a good tracking performance in spite of the presence of payload disturbances.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.4 no.1
• /
• pp.43-49
• /
• 1999

We propose a nonlinear feedback controller that can control the induction motors with high dynamic performance and high power efficiency by means of decoupling of motor speed and rotor flux. The nonlinear feedback controller needs the information on some motor parameters. New recursive adaptation algorithms for rotor resistance and mutual inductance which can be applied to our nonlinear feedback controller are also presented in this paper. The recursive adaptation algorithms make the estimated values of rotor resistance and mutual inductance track their real values. Some simulation and experimental results show that the adaptation algorithms are robust against the variation of stator resistance and stator inductance.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.219-228
• /
• 2007

In this paper, we present a novel blind adaptive multiuser detector structure and three robust recursive filters to improve the performance in CDMA environments: Sigma point kalman filter (SPKF), particle filter (PF), and Gaussian mixture sigma point particle filter (GMSPPF). Our proposed robust recursive filters have superior performance over a conventional extended Kalman filter (EKF). The proposed multiuser detector algorithms initially use Kalman prediction form to estimated channel parameters, and unknown data symbol be predicted. Second, based on this predicted data symbol, the robust recursive filters (e.g., GMSPPF) is a refined estimation of joint multipaths and time delays. With these estimated multipaths and time delays, data symbol detection is carried out (Kalman correction form). Computer simulations show that the proposed algorithms outperform the conventional blind multiuser detector with the EKF. Also we can see it provides a more viable means for tracking time-varying amplitudes and time delays in CDMA communication systems, compared to that of the EKF for near-far ratio of 20 dB. For this reason, it is believed that the proposed channel estimators can replace well-known filter such as the EKF.

• Journal of Power System Engineering
• /
• v.2 no.2
• /
• pp.73-80
• /
• 1998

The identification of drilling joint dynamics which consists of drilling and structural dynamics and the on-line time series detection of malfunction process is substantial not only for the investigation of the static and dynamic characteristics but also for the analytic realization of diagnostic and control systems in drilling. Therefore, We have discussed on the comparative assessment of two recursive time series modeling algorithms that can represent the drilling operation and detect the abnormal geometric behaviors in precision roundshape machining such as turning, drilling and boring in precision diemaking. For this purpose, simulation and experimental work were performed to show the malfunctional behaviors for drilling operation. For this purpose, a new two recursive approach (Recursive Extended Instrument Variable Method : REIVM, Recursive Least Square Method : RLSM) may be adopted for the on-line system identification and monitoring of a malfunction behavior of drilling process, such as chipping, wear, chatter and hole lobe waviness.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.166-167
• /
• 1979

Performances of three computational algorithms for one-dimensional frequency filtering are compared and tradeoffs are studied. If the size of the filter impulse response is small, it is well-known that the conventional convolution is superior than the FFT convolution. If the size of the impulse response is large, it was suggested that the recursive filter might be competitive in terms of speed to the FFT convolution. We, therefore, have developed an computational, algorithm for the recursive filter to compare the speed advantages over the FFT convolution and the results are presented.