• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.583-597
• /
• 2001

Tracking the targets of interest has been one of the major research areas in radar surveillance system. We formulate the tracking problem as an incomplete data problem and apply the EM algorithm to obtain the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The difference is that the measurement-update deals with multiple measurements and the parameter-update can estimate the system parameters. Through extensive experiments, it turns out that the proposed system is better than PDAF and NNF in tracking the targets. Also, the performance degrades gracefully as the disturbances become stronger.

• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.98-109
• /
• 1988

This paper introduces an adaptive nonlinear filtering algorithm that uses the sequential regression(SER) method to update the second order Volterra filter coefficients in a recursive way. Conventionally, the SER method has been used to invert large matrices which result from direct application of Wiener filter theory to the Volterra filter. However, the algorithm proposed in this paper uses the SER approach to update the least squares solution which is derived for Gaussian input signals. In such an algorithm, the size of the matrix to be inverted is smaller than that of conventional approaches, and hence the proposed method is computationally simpler than conventional nonlinear system identification techniques. Simulation results are presented to demonstrate the performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.320-322
• /
• 2002

A new simple spatial scheme for base station with adaptive antenna in Code Division Multiplexing Access (CDMA) systems is presented. In the proposed scheme, by applying the new spatial structure lot the receiver, the system can debate the problem of which the number of users exceeds the number of adaptive antenna elements existing in the conventional spatial scheme. An adaptive algorithm based on the Mean Square Error (MSE) criterion is also derived to update the weight matrix of the proposed scheme. The results of the system capacity enhancement can be achieved by using the proposed approach. Numerical simulations are included fer illustration and verification.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1289-1291
• /
• 1996

In this paper, we propose a new adaptive pre-processing technique for the linearization of a weakly nonlinear system which can be modeled by a Volterra series up to third order. To compensate the nonlinear effects of a given system, an update algorithm for the linear filter coefficients of the proposed adaptive pre-processor is introduced, and to compensate the linear distortion of the given system, the linear inverse filter is also utilized. For the performance test of the proposed adaptive pre-processor, computer simulation results obtained by analyzing an ANRSS loudspeaker model are provided.

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

This paper analyzes the properties of such algorithm that corresponds to the nonlinear adaptive algorithm with additional update terms, parameterized by the scalar factors a1, a2, a3 and Presents its structure. The analysis of convergence leads to eigenvalues of the transition matrix for the mean weight vector. Regions in which the algorithm becomes stable are demonstrated. The time constant is derived and the computational complexities of MLMS algorithms are compared with those of the conventional LMS, sign, LFG, and QFG algorithms. The properties of convergence in the mean square are analyzed and the expressions of the mean square recursion and the excess mean square error are derived. The necessary condition for the CFG algorithm to be stable is attained. In the computer simulation applied to the system identification the CFG algorithm has the more computation complexities but the faster convergence speed than LMS, LFG and QFG algorithms.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.666-669
• /
• 1991

This paper deals with the robustness of a direct adaptive pole-placement control algorithm for continuous time plants with unmodeled dynamics. In this paper, least squares method is used for controller parameter adaptation and covariance matrix update equation is modified by normalizing signal to guarantee the boundedness of all signals in the closed loop system. In the proposed algorithm, no a priori knowledge is required and it is shown that persistence of excitation condition is required to ensure the stability of the closed loop system.

• Journal of Power Electronics
• /
• v.14 no.6
• /
• pp.1254-1262
• /
• 2014

Magneto-electric encoders have been widely used in industry and military applications because of their good shock resistance, small volume, and convenient data processing. However, the characteristics of a magneto-electric encoder's signal generator and hall sensor changes minimally with temperature variation. These changes cause an angle drift. The main purpose of this study is to construct the compensation system of a neural network and constantly update weight coefficients of temperature correction by finite iteration calculation so that the angle value modified can approach the angle value at the target temperature. This approach is used in adaptive correction of the angle value.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• International journal of advanced smart convergence
• /
• v.9 no.2
• /
• pp.20-27
• /
• 2020

Sound event detection in real-world environments suffers from the interference of non-stationary and time-varying noise. This paper presents an adaptive noise reduction method for sound event detection based on non-negative matrix factorization (NMF). In this paper, we proposed a deep learning model that integrates Convolution Neural Network (CNN) with Non-Negative Matrix Factorization (NMF). To improve the separation quality of the NMF, it includes noise update technique that learns and adapts the characteristics of the current noise in real time. The noise update technique analyzes the sparsity and activity of the noise bias at the present time and decides the update training based on the noise candidate group obtained every frame in the previous noise reduction stage. Noise bias ranks selected as candidates for update training are updated in real time with discrimination NMF training. This NMF was applied to CNN and Hidden Markov Model(HMM) to achieve improvement for performance of sound event detection. Since CNN has a more obvious performance improvement effect, it can be widely used in sound source based CNN algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.237-243
• /
• 2014

In this paper, a calculation-efficient method for weight update in the algorithm based on maximization of the zero-error probability (MZEP) is proposed. This method is to utilize the current slope value in calculation of the next slope value, replacing the block processing that requires a summation operation in a sample time period. The simulation results shows that the proposed method yields the same performance as the original MZEP algorithm while significantly reducing the computational time and complexity with no need for a buffer for error samples. Also the proposed algorithm produces faster convergence speed than the algorithm that is based on the error-entropy minimization.