• Journal of information and communication convergence engineering
• /
• v.3 no.3
• /
• pp.115-118
• /
• 2005

In this study, the proposed algorithm is a correlativity signal in a mobile wireless channel that has estimated the direction of arrival. The proposed algorithm applied the space average method in a MUSIC algorithm. The diagonal matrix of the space average method was changed to inverse the matrix and to obtain a new signal correlation matrix. The existing algorithm was analyzed and compared by applying a proposed signal correlation matrix to estimate the direction of arrival in a MUSIC algorithm. The experiment resulted in a proposed algorithm with a min-norm method resolution at more than $5^{\circ}$. It improved more than $2^{\circ}$ in a MUSIC algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.71-83
• /
• 2003

In this paper, a novel transcoding algorithm for the G.729A and the Selectable Mode Vocoder(SMV) vocoders via direct parameter transformation is proposed. In contrast to the conventional tandem transcoding algorithm, the proposed algorithm converts the parameters of one coder to the other without going through the decoding and encoding processes. In transcoder from SMV to G.729A, LSP conversion algorithm, pitch delay conversion algorithm and transcoding algorithm in lower rate are proposed, and in transcoder from G.729A to SMV, LSP conversion algorithm, pitch delay conversion algorithm and rate selection algorithm are proposed. Evaluation results show that while exhibiting better computational and delay characteristics, the proposed algorithm produces equivalent or Improved speech quality to that produced by the tandem transcoding algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2013

The studies on the shortest path algorithms based on Dijkstra algorithm has been done continuously to decrease the time for searching. $A^*$ algorithm is the most represented one. Although fast searching speed is the major point of $A^*$ algorithm, there are high rates of failing in search of the shortest path, because of complex and irregular networks. The failure of the search means that it either did not find the target node, or found the shortest path, witch is not true. This study proposed $A^*$ algorithm applying method that can reduce searching failure rates, preferentially organizing the relations between the starting node and the targeting node, and appling it in reverse according to the organized path. This proposed method may not build exactly the shortest path, but the entire failure in search of th path would not occur. Following the developed algorithm tested in a real complex networks, it revealed that this algorithm increases the amount of time than the usual $A^*$ algorithm, but the accuracy rates of the shortest paths built is very high.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.115-118
• /
• 2000

We present a new variable step size LMS algorithm using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multip]e-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.185-192
• /
• 1998

A new algorithm is proposed in this paper which efficiently performs join in the temporal database. The main idea is to sort the smaller relation and to partition the larger relation, and the proposed algorithm reduces the cost of sorting the larger relation. To show the usefulness of the algorithm, the cost is analyzed with respect to the number of accesses to secondary storage and compared with that of Sort-Merge algorithm. Through the comparisons, we present and verify the conditions under which the proposed algorithm always outperforms the Sort-Merge algorithm. The comparisons show that the proposed algorithm achieves 10∼30% gain under those conditions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.296-300
• /
• 1997

Recently, the genetic algorithm has been applied to the various types of optimization problems and these attempts have very successfully. However, in most cases on these approaches, there is not given by investigator about to the theoritical analysis. The reason that the analysis of the dynamics for genetic algorithm is not clear, is the probablitic aspect of genetic algorithm. In this paper, we investigate the analysis of the internal dynamics for genetic algorithm using stochastic differential method. In addition, we provide a new genetic algorithm, based on the study of the convergence property for the genetic algorithm.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.361-369
• /
• 2001

This thesis describes the design of a stabilized algorithm for shipboard satellite antenna systems which can enhance the tracking performance. In order to overcome some drawbacks of the conventional step tracking algorithm, the proposed algorithm searches for the best tracking angles using gradient-based formulae and signal intensities measured according to a search pattern. The effectiveness of the proposed algorithm is demonstrated through simulation using real-world data.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.901-914
• /
• 1999

In [6] Schensted constructed the Schensted algorithm giving a bijection between permutations and pairs of Young standard tableaux. After knuth generalized it to column strict tableaux in [3] various analogs of the Schensted algorithm came. In this paper we describe the bumping algorithm on the shifted rim hook tableaux which is the basic building block of the Schensted algorithm for shifted rim book tableaux.

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

In this Paper, we present a new efficient algorithm that can segment an object in the image. There are many algorithms for segmentation and many studies for criteria or threshold value. But, if the environment or brightness is changed, their would not be suitable. Accordingly, we apply a clustering algorithm for adopting and compensating environmental factors. And applying labeling method, we try arranging segment by the similarity that calculated with the fuzzy algorithm. we also present simulations for searching an object and show that the algorithm is somewhat more efficient than the other algorithm.

• Journal of Biomedical Engineering Research
• /
• v.43 no.4
• /
• pp.280-289
• /
• 2022

In this paper, we present a QRS-complex detection algorithm to calculate an accurate heartbeat and clearly recognize irregular rhythm from ECG signals. The conventional Pan-Tompkins algorithm brings false QRS detection in the derivative when QRS and noise signals have similar instant variation. The proposed algorithm uses amplitude differences in 7 adjacent samples to detect QRS-complex which has the highest amplitude variation. The calculated amplitude is cubed to dominate QRS-complex and the moving average method is applied to diminish the noise signal's amplitude. Finally, a decision rule with a threshold value is applied to detect accurate QRS-complex. The calculated signals with Pan-Tompkins and proposed algorithms were compared by signal-to-noise ratio to evaluate the noise reduction degree. QRS-complex detection performance was confirmed by sensitivity and the positive predictive value(PPV). Normal ECG, muscle noise ECG, PVC, and atrial fibrillation signals were achieved which were measured from an ECG simulator. The signal-to-noise ratio difference between Pan-Tompkins and the proposed algorithm were 8.1, 8.5, 9.6, and 4.7, respectively. All ratio of the proposed algorithm is higher than the Pan-Tompkins values. It indicates that the proposed algorithm is more robust to noise than the Pan-Tompkins algorithm. The Pan-Tompkins algorithm and the proposed algorithm showed similar sensitivity and PPV at most waveforms. However, with a noisy atrial fibrillation signal, the PPV for QRS-complex has different values, 42% for the Pan-Tompkins algorithm and 100% for the proposed algorithm. It means that the proposed algorithm has superiority for QRS-complex detection in a noisy environment.