• 대한의용생체공학회:의공학회지
• /
• 제43권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.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.49-57
• /
• 1994

An efficient approach for the computationtion of the optimum convergence factor is proposed for the LMS algorithm applied to a transversal FIR structure in this study. The approach automatically leads to an optimum step size algorithm at each weight in every iteration that results in a dramatic reduction in terms of convergence time. The algorithm is evaluated in system identification application where two alternative computer simulations are considered for time-invariant and time-varying system cases. The results show that the proposed algorithm needs not appropriate convergence factor and has better performance than AGC(Automatic Gain Control) algorithm and Karni algorithm, which require the convergence factors controlled arbitrarily in computer simulation for time-invariant system and time-varying systems. Also, itis shown that the proposed algorithm has the excellent adaptability campared with NLMS(Normalized LMS) algorithm and RLS (Recursive least Square) algorithm for time-varying circumstances.

• 전기학회논문지
• /
• 제58권11호
• /
• pp.2292-2298
• /
• 2009

In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.833-841
• /
• 1997

In this paper, the hybrid LB-TJW(Leaky Bucket-Triggered Jumping Window) algorithm for multimedia traffic control is proposed and its performance is evaluated and analyzed. Its architecture is composed of the peak bit rate controller and the average bit rate controller. Generally, the cell which violates the peak bit rate is discraded in LBalgorithm, and the average bit rate of JW or TJW algorithm is better than that of LB algorithm. However, the hybrid LB-TJW algorithm passes it though the network if the cell does not violate the peak bit rate. If the cell violates the peak bit rate, the hybrid LB-TJW algorithm passes it to the average bit rate controller which perforithm to monitor the average bit rate of input traffic. The TJW algorithm monitors the cell that violates the average bit rate. If the cell does not violate the average bit rare, the LB-TJW algorithm passes it through the network. As simulation results, the cell loss rate and the buffer size of the LB-TJW algorithm is reduced to half as much as those of LB algortihm.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년도 학술대회
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method. VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년 추계학술대회논문집
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL (Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method -VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• 한국통신학회논문지
• /
• 제18권4호
• /
• pp.561-571
• /
• 1993

본 논문에서는 새로운 이산 심볼동기(STR) 알고리듬을 제안한다. 최적 추정이론에서 파생된 이 알고리듬은 기존의 알고리듬에 대한 이해와 분석을 바탕으로 장단점을 소화한 것이다. 새로운 알고리듬의 타이밍(timing) detector는 구현이 간단하며 반송파 위상에 독립적으로 동작하므로 Symbol Timing Recovery (STR)의 새로운 추세인 Carrier Recovery(CR)-STR의 연동동작이 가능하다. 한편 새로운 알고리듬에서 비선형소자에 의한 영향도 분석되고 설명되었으며 수치해석과 Monte-Carlo 시뮬레이션으로 기존의 알고리듬과 제안된 알고리듬간의 성능분석을 수행하였다. Gardner 알고리듬과 비교하였을 때 본 알고리듬은 작은 rolloff에서 패턴 지터(Pattern Jitter)에 의한 추적성능이 보다 우수하였다.

• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• ETRI Journal
• /
• 제43권2호
• /
• pp.260-271
• /
• 2021

This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

• 한국지능시스템학회논문지
• /
• 제11권8호
• /
• pp.689-694
• /
• 2001

Recently, several promising multiobjective evolutionary algorithm such as SPEA. NSGA-II, PESA, and SPEA2 have been developed. In this paper, we also propose a new multiobjective evolutionary algorithm that compares to them. In the algorithm proposed in this paper, we introduce a novel concept, “inherited age” and total algorithm is executed based on the inherited age concept. Also, we propose a new sharing algorithm, called objective classication sharing algorithm(OCSA) that can preserve the diversity of the population. We will show the superior performance of the proposed algorithm by comparing the proposed algorithm with other promising algorithms for the test functions.