• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.41-47
• /
• 2008

Most of media compression CODECs adopts the variable length coding method. This paper proposes special registers and instruction set for bit stream process in order to accelerate the decoding process of the variable length code. The instruction set shares the conventional data path to minimize additional costs. And bit stream is read from the memory instead of the special port. Therefore the instruction set minimizes the change of the processor, and is adopted without any additional input controller and buffer, and accelerate decoding process of variable length code. The data path of the instruction set needs additional 65 bits memory and 344 equivalent gates, 0.19 ns delay under TSMC $0.25{\mu}m$ technology. The instruction set reduced the execution time of the variable length code decoding process in H.264/AVC by about 55%.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.434-442
• /
• 2012

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.163-174
• /
• 2016

In this paper, we propose an optimal choice scheme to determine the best option among comparable options whose current expectations are all the same under the condition that an investor has a confidence in the future value realization of underlying assets. For this purpose, we use a path-averaged option as our base instrument in which we calculate the time discounted value along the path and divide it by the number of time steps for a given expected path. First, we consider three European call options such as vanilla, cash-or-nothing, and asset-or-nothing as our comparable set of choice schemes. Next, we perform the experiments using historical data to prove the usefulness of our proposed scheme. The test suggests that the path-averaged option value is a good guideline to choose an optimal option.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.72-79
• /
• 1989

In this paper we consider the problem of finding an optimal straight line path of moving facility which interacts with a set of existing facilities fixed within a given rectangular area. We present a simple algorithm for rectilinear metric which greatly improves the pervious method and also propose algorithms for Euclidean and squared Euclidean distances.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.45-55
• /
• 1997

To design a ATM Switch which ahs advantages in high sped packet switching, it is essential to set multiple paths between input ports and output ports and to design a new packet transfer technique on that paths for decreasing Packet Loss by conflicts in internal Switch Plane. We propose new packet transfer method, Alternate Path Transfer Mechanism by Dynamic Bypass Transfer Method which can solve conflict problem in Banyan network easily. Proposed ATM Switch consists of Banyan networks, Input/Ouput Port, Bypass Link, and Bypass Link Controller. Packets caused conflicts in SEs have another chances of packet transfer over alternate switching planes by using this mechanism.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.946-955
• /
• 2004

It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.91-103
• /
• 2008

In order to simulate the behavior of automated manufacturing systems, the performance of material handling systems should be measured dynamically. Multi-Agent technology could be well adapted for the development of simulator for distributed and intelligent manufacture systems. A multi-agent system is composed of one coordination agent and multiple application agents. Issues in AGVS simulator can be classified by the set-up and operating problems. Decisions on the number of vehicles, bi- or uni-directional guide-path, etc. are fallen into the set-up problem category, while deadlock tree algorithm and conflict resolution are in operating problem. In this paper, a multi-agent based deadlock-free simulator for automated guided vehicle system(AGVS) are proposed through the use of multi-agent technologies and the development of deadlock-free algorithm. In this AGVS simulator proposed, well-known Floyd algorithm is used to create AGVS Guide path, through which AGVS move. Also, AGVs avoid vehicle conflict and deadlock using check path algorithm. And Moving vehicle agents are operated in real-time control by coordination agent. AGV position is dynamically calculated based on the concept of rolling time horizon. Simulator receives and presents operating information of vehicle in AGVS Gaunt chart. The performance of the proposed algorithm and developed simulator based on multi-agent are validated through set of experiments.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.493-498
• /
• 2004

A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.