• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.297-300
• /
• 2000

This paper proposes a high-speed and area-efficient FFT algorithm and performs a hardware implementation. This algorithm, named by “Radix-4/2”, uses the feature of existing radix-2$^3$algorithm, It reduces the number of non-trivial multipliers in SFG to the ratio of 3 to 2 campared with radix-2 or radix-4 algorithm and radix-4/2 has also twice throughput as radix-2$^3$algorithm's. It is proved that FFT processor using the proposed algorithm and 64-point MDC pipeline architecture has twice throughput as radix-2$^3$algorithm's, and reduces areas by 25 percentages in contrast to radix-4 algorithm's.

• Industrial Engineering and Management Systems
• /
• 제10권3호
• /
• pp.203-208
• /
• 2011

Job shop scheduling is well-known as one of the hardest combinatorial optimization problems and has been demonstrated to be NP-hard problem. In the past decades, several researchers have devoted their effort to develop evolutionary algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) for job shop scheduling problem. Differential Evolution (DE) algorithm is a more recent evolutionary algorithm which has been widely applied and shown its strength in many application areas. However, the applications of DE on scheduling problems are still limited. This paper proposes a one-stage differential evolution algorithm (1ST-DE) for job shop scheduling problem. The proposed algorithm employs random key representation and permutation of m-job repetition to generate active schedules. The performance of proposed method is evaluated on a set of benchmark problems and compared with results from an existing PSO algorithm. The numerical results demonstrated that the proposed algorithm is able to provide good solutions especially for the large size problems with relatively fast computing time.

• International Journal of Contents
• /
• 제2권1호
• /
• pp.34-38
• /
• 2006

In this paper, an overview of anti-collision algorithm for RFID system of a standard EPC Class1 protocol is presented, and the binslotted dynamic search algorithm (BDS) based upon the slotted ALOHA and binary tree procedure is proposed and analyzed. Also, the performance is evaluated as comparing the BDS algorithm with the standard bin-slotted algorithm (BSA) through the simulation program. The performance of the proposed BDS algorithm is improved by dynamically identifying the collided-bit position and the collided bins stored in the stack of the reader. As the results, the number of request command that a reader send to tags in the reader s interrogation zone and the total recognition time are decreased to 59% as compared with BSA algorithm. Therefore, the tag identification performance is fairly improved by resolving a collision problem using the proposed BDS algorithm.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제51권3호
• /
• pp.133-141
• /
• 2002

Most maximum power point tracking(MPPT) control algorithm is based on Perturb and Observe(P&O) and Incremental Conductance(IncCond). In comparison with P&O and IncCond algorithm, the dynamic and tracking characteristic of IncCond algorithm is better than P&O algorithm in condition of rapidly changing solar radiation. But in the case of digital implementation, the InCond algorithm has error en decision of maximum power operation point(MPOP). To solve this problem, this paper proposes a improved IncCond algorithm, which can determine the MPOP correctly by inserting the test signal in control input. This paper proposes a novel MPPT control algorithm for the digitally implemented photovoltaic system in condition of rapidly changing solar radiation. To verify the validity of the proposed control algorithm. the computer simulation and experiment are carried out.

• 전기학회논문지
• /
• 제60권3호
• /
• pp.654-661
• /
• 2011

This paper is about a personal identification algorithm using an ECG that has been studied by a few researchers recently. Previously published algorithm can be classified as two methods. One is the method that analyzes of ECG features and the other is the morphological analysis of ECG. The main characteristic of proposed algorithm can be classified the method of analysis ECG features. Proposed algorithm adopts DSTW(Down Slope Trace Wave) for extracting ECG features, and applies SVM(Support Vector Machine) to training and testing as a classifier algorithm. We choose 18 ECG files from MIT-BIH Normal Sinus Rhythm Database for estimating of algorithm performance. The algorithm extracts 100 heartbeats from each ECG file, and use 40 heartbeats for training and 60 heartbeats for testing. The proposed algorithm shows clearly superior performance in all ECG data, amounting to 93.89% heartbeat recognition rate and 100% ECG recognition rate.

• 대한산업공학회지
• /
• 제14권2호
• /
• pp.25-40
• /
• 1988

In this paper, a unified method to construct a quadratically convergent algorithm with one dimensional search schemes is described. With this method, a generalized algorithm is derived. As it's particular cases, three quadratically convergent algorithms are performed. They are the rank-one algorithm (Algorithm I), projection algorithm (Algorithm II) and the Fletcher-Reeves algorithm (Algorithm III). As one-dimensional search schemes, the golden-ratio method and dichotomous search are used. Additionally, their computer programming is developed for actual application. The use of this program is provided with the explanation of how to use it, the illustrative examples that are both quadratic and nonquadratic problems and their output. Finally, from the computer output, each algorithm was analyzed from the standpoint of efficiency for performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4541-4554
• /
• 2019

This paper proposes a planar projection DV-hop location algorithm (PTCDV-hop) based on the LED semi-angle at half power (SAHP, which accounts for LED SAHP characteristics in visible light communication (VLC)) and uses the DV-hop algorithm for range-free localization. Distances between source nodes and nodes positioned in three-dimensional indoor space are projected onto a two-dimensional plane to reduce complexity. Circles are structured by assigning source nodes (projected onto the horizontal plane of the assigned nodes) to be centers and the projection distances as radii. The proposed PTCDV-hop algorithm then determines the position of node location coordinates using the trilateral-weighted-centroid algorithm. Simulation results show localization errors of the proposed algorithm are on the order of magnitude of a millimeter when three sources are used. The PTCDV-hop algorithm has higher positioning accuracy and stronger dominance than the traditional DV-hop algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1296-1309
• /
• 2023

In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

• 대한전자공학회논문지
• /
• 제24권1호
• /
• pp.52-59
• /
• 1987

A new on-line estimation algorithm for a time varying time delay is proposed. This algorithm is based on the concept of minimization of prediction error. As only the parameters directly related to the poles and zeros of the process are estimated in the algorithm, persistently exciting condition for the convergence of parameters can be less restrictive. Under some assumptions which is necessary in adaptive control, it is shown that this algorithm estimates time varying time delay accurately. In view of computational burden, this algorithm needs far less amount of calculations than other methods. The larger the time delay is, the more effective this algorithm is . Computer simulation shows good properties of the algorithm. This algorithm can be used effectively in adaptive control of large dead time processes.

• 한국정보통신학회논문지
• /
• 제14권3호
• /
• pp.663-668
• /
• 2010

차량을 타고 이동할 경우 좌회전, 우회전, U턴 등의 방향 전환은 차량의 속력 감소의 주요한 요인이 된다. 즉, 같은 거리를 이동할 경우 방향전환이 잦은 경로보다 직진 구간이 많은 경로가 보다 빨리 목적지에 도착할 수 있다. 이 논문에서는 직진성이 높은 경로를 탐색하기 위해서 방향전환비용을 고려한 턴 휴리스틱과 이률 적용한 경로탐색 알고리즘(TA* 알고리즘)을 제안한다. 또한 TA* 알고리즘의 탐색비용을 개선하기 위해서 일부 구간에서만 턴 휴리스틱을 적용하는 가변적인 턴 휴리스틱(VTA* 알고리즘)을 제안한다.