• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.7-10
• /
• 2004

This paper describes techniques to implement low-cost adapt ive Pipelined LMS filter for ASIC implement ions of high communication receivers. Power consumpiton can be reduced using a careful selection of architectural, algorithmic, and VLSI circuit techlifue A Pipelined architecture for the strength-reduced algorithm is then developed via the relaxed look-ahead transformation. This technique, which is an approximation of the conventional look-ahead compution, maintains the functionality of the algorithm rather than the input-output behavior Convergence maiysis of the Proposed architecture has been presented and support via simulation results. The resulting pipelined adaptive filter achives a higher though put requires lower power as compared to the filter using the serial algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.47-52
• /
• 1999

The efficiency of an adder which plays an important role in micro-process and DSP greatly depends on the kinds of carry generation method. So in this paper. I used both CLA excellent in the speed and CSA best in the chip-size. The 64bit adder is designed with high speed which is two optimum combination. Therefore this paper suggested the way of CLSA improving both speed and chip-size. and proved the excellence of the designed circuit.

• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.35-44
• /
• 2002

In this paper, an implementation method of RSA exponentiator based on Radix-$2^k$ modular multiplication algorithm is presented and verified. We use Booth receding algorithm to implement Radix-$2^k$ modular multiplication and implement radix-16 modular multiplier using 2K-byte memory and CSA(carry-save adder) array - with two full adder and three half adder delays. For high speed final addition we use a reduced carry generation and propagation scheme called pseudo carry look-ahead adder. Furthermore, the optimum value of the radix is presented through the trade-off between the operating frequency and the throughput for given Silicon technology. We have verified 1,024-bit RSA processor using Altera FPGA EP2K1500E device and Samsung 0.3$\mu\textrm{m}$ technology. In case of the radix-16 modular multiplication algorithm, (n+4+1)/4 clock cycles are needed and the 1,024-bit modular exponentiation is performed in 5.38ms at 50MHz.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.1-9
• /
• 2012

This paper suggests a two-phase look-ahead Banker's algorithm for efficient operation of capacitated automated production systems. The algorithm improves the ability of detecting safe states of the previous one by considering the possibility of processing each job to completion at once as well as partial movement between jobs. The improved performance of the proposed algorithm is testified by performing numerical experiment in terms of (i) detection rate of safe states and (ii) system throughput and verified by using paired t-test.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.532-535
• /
• 2022

Path following algorithms have been intensively studied for various mobile platforms such as planetary exploration, unmanned delivery, and autonomous driving. However, ensuring high accuracy in practical applications is challenging due to enormous uncertainty inherent in real environment. In this paper, we aim to reveal the guideline for the design and implementation by investigating the path following performance of mobile robot controlled by the pure pursuit algorithm. To this end, we evaluate the accuracy of the pure pursuit algorithm when tuning the look ahead distance and deploying erroneous actuator.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.115-119
• /
• 2007

In this paper, practical problems will be covered in applying preview control to real tracked vehicle systems. Previous researches about the preview control assume that the vehicle speed is constant and the actuators have full frequency bandwidth. However, in order to apply it to real systems, those should be taken into account. Therefore this paper show the algorithm to apply the preview control to speed changing vehicles and performance variation according to a restricted frequency bandwidth.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.457-473
• /
• 2005

In each step of the quasi-minimal residual (QMR) method which uses a look-ahead variant of the nonsymmetric Lanczos process to generate basis vectors for the Krylov subspaces induced by A, it is necessary to decide whether to construct the Lanczos vectors $v_{n+l}\;and\;w{n+l}$ as regular or inner vectors. For a regular step it is necessary that $D_k\;=\;W^{T}_{k}V_{k}$ is nonsingular. Therefore, in the floating-point arithmetic, the smallest singular value of matrix $D_k$, ${\sigma}_min(D_k)$, is computed and an inner step is performed if $\sigma_{min}(D_k)<{\epsilon}$, where $\epsilon$ is a suitably chosen tolerance. In practice it is absolutely impossible to choose correctly the value of the tolerance $\epsilon$. The subject of this paper is to show how discrete stochastic arithmetic remedies the problem of this tolerance, as well as the problem of the other tolerances which are needed in the other checks of the QMR method with the estimation of the accuracy of some intermediate results. Numerical examples are used to show the good numerical properties.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.7-12
• /
• 2005

Scattered look-ahead(SLA) pipelining method can be efficiently used for high-speed or low-power applications of digital II R filters. Although the pipelined filters are guaranteed to be stable by this method, these filters suffer from large roundoff noise when the poles are crowded within some critical regions. An angle and radius constrained II R fille. design approach using modified Remez exchange algorithm and least squares algorithm is proposed to avoid tight pole-crowding in pipelined filters, resulting in improved frequency responses and reduced coefficient sensitivities. Experimental results demonstrate that our proposed method leads to chip area reduction by $33{\%}$ and low power by $45{\%}$ against the conventional method.