• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1467-1470
• /
• 2002

The minimum entropy method is one of blind equalization method. A conventional algorithm using the minimum entropy method has two problems : slower convergence and lower reliability of recovered signals. We propose a new algorithm using the minimum entropy method for solving the two problems. Pina31y, we confirm the validity of the proposed algorithm through computer simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.323-328
• /
• 1998

In this paper, a new input estimation algorithm is proposed for target tracking problem. The unknown target maneuver is approximated by a linear combination of independent time functions and the coefficients are estimated by using a weighted least-squares estimation technique. The proposed algorithm is verified by computer simulation of a realistic two-dimensional tracking problem. The proposed algorithm provides significant improvements in estimation performance over the conventional input estimation techniques based on the constant-input assumption.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.243-246
• /
• 2002

In this paper, an advanced load balancing algorithm in nth order Hypercube distributed system has been proposed. The new algorithm uses centralized load-balancing to avoid blocking phenomenon and processor thrashing, and shows the results which makes loads to approach average value of loads. The new algorithm os compared with several other algorithm and it shows a merit in cost function value.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.774-777
• /
• 2004

RAIM techniques based on TLS have rarely born addressed because TLS requires a great number of computations. In this paper, the special form of the observation matrix H, that is, one column is exactly known, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm makes us enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.31-34
• /
• 2005

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.611-616
• /
• 2003

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.44-53
• /
• 1999

Generating diagnostic test patterns for combinational circuits remain to be a very difficult problem. For example, ISCAS85 c7552 benchmark circuit has 100 million fault pairs, Thus, we need more sophisticated algorithm to get more information. A new diagnostic algorithm for test pattern generation is suggested and implemented in this paper. DIATEST algorithm based on PODEM is also implemented for comparison to the new algorithm. These two algorithms have been applied to ISCAS85 benchmark circuits. Experimental results show that (1) both algorithms achieve fault pair coverage over 99%, (2) total test length of the new algorithm is much shorter than that of DIATEST, and (3) the new algorithm gives much more information used for making diagnostic dictionary, diagnostic decision tree or diagnostic test system despite DIATEST is faster than the new algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.198-202
• /
• 2004

This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a test function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.128-134
• /
• 2011

Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.835-841
• /
• 2005

This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a evaluation function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.