• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.32 no.1
• /
• pp.13-19
• /
• 2019

This paper proposes an easy algorithm for finding tapped-delay-line (TDL) filter coefficients in an adaptive filter algorithm using orthogonal input signals. The proposed algorithm can be used to obtain the coefficients and errors of a TDL filter without using an inverse orthogonalization process for the orthogonal input signals. The form of the proposed algorithm in this paper has the advantages of being easy to use and similar to the familiar recursive least-squares (RLS) algorithm. In order to evaluate the proposed algorithm, system identification simulation of the $11^{th}$-order finite-impulse-response (FIR) filter was performed. It is shown that the convergence characteristics of the learning curve and the tracking ability of the coefficient vectors are similar to those of the conventional RLS analysis. Also, the derived equations and computer simulation results ensure that the proposed algorithm can be used in a similar manner to the Levinson-Durbin algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.847-857
• /
• 2007

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.155-158
• /
• 2010

In this article, we proposed a new interference canceller using the adaptive algorithm. We designed constant modulus algorithm-correlation normailized least mean square (CMA-CNLMS) for wireless system. This structure is normalized LMS algorithm using correlation between the desired and input signal for cancelling the interference signals in the wideband code division multiple access (WCDMA) system. We showed that the proposed algorithm could improve the Mean Square Error (MSE) performance of LMS algorithm. MATLAB (Matrix Laboratory) is employed to analyze the proposed algorithm and to compare it with the experimental results. The MSE value of the LMS with mu=0.0001 was measured as - 12.5 dB, and that of the proposed algorithm was -19.5 dB which showed an improvement of 7dB.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.3
• /
• pp.126-132
• /
• 2004

This paper proposed trajectory tracking control based on genetic algorithm. Trajectory tracking control scheme are real coding genetic algorithm(RCGA) and back-propagation algorithm(BPA). Control scheme ability experience proposed simulation. Stable tracking control problem of mobile robots have been studied in recent years. These studies have guaranteed stability of controller, but the performance of transient state has not been guaranteed. In some situations, constant gain controller shows overshoots and oscillations. So we introduce better control scheme using real coding genetic algorithm and neural network. Using RCGA, we can find proper gains in several situations and these gains are generalized by neural network. The generalization power of neural network will give proper gain in untrained situation. Performance of proposed controller will verity numerical simulations and the results show better performance than constant gain controller.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1008-1015
• /
• 2002

This paper proposes a combinatorial method to compute the global and local solutions of optimization problem. The present hybrid algorithm is the synthesis of a genetic algorithm and a local concentrate search algorithm (simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution. In addition, this algorithm can find both the global and local optimum solutions. An optimization result is presented to demonstrate that the proposed approach successfully focuses on the advantages of global and local searches. Three numerical examples are also presented in this paper to compare with conventional methods.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.11-20
• /
• 1998

This paper deals with a mathematical model and an algorithm for the problem of determining k most vital arcs in the shortest path problem. First, we propose a 0-1 integer programming model for finding k most vital arcs in shortest path problem given the ordered set of paths with cardinality q. Next, we also propose an algorithm for finding k most vital arcs ln the shortest path problem which uses the 0-1 Integer programming model and shortest path algorithm and maximum flow algorithms repeatedly Malik et al. proposed a non-polynomial algorithm to solve the problem, but their algorithm was contradicted by Bar-Noy et al. with a counter example to the algorithm in 1995. But using our algorithm. the exact solution can be found differently from the algorithm of Malik et al.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.5
• /
• pp.291-299
• /
• 2005

An obstacle avoidance algorithm for a network-based autonomous mobile robot is proposed in this paper. The obstacle avoidance algorithm is based on the VFH(Vector Field Histogram) algorithm and two delay compensation methods with the VFH algorithm are proposed for a network-based robot with distributed environmental sensors, mobile actuators, and the VFH controller. Firstly, the environmental sensor information is compensated by prospection with acquired environmental sensor information, measured network delays, and the kinematic model of the robot. The compensated environmental sensor information is used for building polar histogram with the VFH algorithm. Secondly, a sensor fusion algorithm for localization of the robot is proposed to compensate the delay of odometry sensor information and the delay of environmental sensor information. Through some simulation tests, the performance enhancement of the proposed algorithm in the viewpoint of efficient path generation and accurate goal positioning is shown here.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.9-16
• /
• 1994

In this paper, we propose a frequency assignment algorithm to minimize intermodulation effect which is caused by nonlinear amplipification of the satellite transponder. Allmost all of the published algorithms up to now are applicable to one-level SCPC systems, the application range of those algorithms is very restricted from the viewpoint of actual practice. In this paper, we develope and propose a new frequency assignment algorithm which utilize the basic concept of Okinaka's DELINS-INSDEL algorithm to extend its applicabilty from one-level SCPC systems to multi-level systems. The proposed TDTI algorithm provides considerable generality in reducing intermodulation effect in practical satellite communication systems because of its alpplicability to multi-level and multi-bandwidth systems as well as one-level systems. Besides the TDTI algorithm which shows excellent characteristics in performance but requires somewhat long excution time. the WTDI-SDELINS algorithm is proposed in this paper to compensate TDTI's demerits in excution time. Considering the fact that there are very little published sterategies for multi-level and muti-bandwidth systems. the algorithm proposed in this paper is quite meaningful.