• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.4
• /
• pp.33-41
• /
• 2006

RSA cryptosystem is of great use in systems such as IC card, mobile system, WPKI, electronic cash, SET, SSL and so on. RSA is performed through modular exponentiation. It is well known that the Montgomery multiplier is efficient in general. The critical path delay of the Montgomery multiplier depends on an addition of three operands, the problem that is taken over carry-propagation makes big influence at an efficiency of Montgomery Multiplier. Recently, the use of the Carry Save Adder(CSA) which has no carry propagation has worked McIvor et al. proposed a couple of Montgomery multiplication for an ideal exponentiation, the one and the other are made of 3 steps and 2 steps of CSA respectively. The latter one is more efficient than the first one in terms of the time complexity. In this paper, for faster operation than the latter one we use binary signed-digit(SD) number system which has no carry-propagation. We propose a new redundant binary adder(RBA) that performs the addition between two binary SD numbers and apply to Montgomery multiplier. Instead of the binary SD addition rule using in existing RBAs, we propose a new addition rule. And, we construct and simulate to the proposed adder using gates provided from SAMSUNG STD130 $0.18{\mu}m$ 1.8V CMOS Standard Cell Library. The result is faster by a minimum 12.46% in terms of the time complexity than McIvor's 2 method and existing RBAs.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.38.3-38
• /
• 2002

$\textbullet$ The topological map using a thinning needs much simpler computation than that using a Voronoi. $\textbullet$ A thinning can provide much information on the environment (additional nodes). $\textbullet$ Each node created in a local map is considered as temporary and redundant nodes are discarded. $\textbullet$ A global topological map can be built fast and correctly through a thinning algorithm. $\textbullet$ Path planning can be easily achieved with a topological map.

• Journal of Information Technology Services
• /
• v.12 no.2
• /
• pp.257-268
• /
• 2013

Query processing on streamed XML fragments is one of key issues in XML databases. In this paper, XFSeed (XML Fragment Processor with Seed label) is proposed to provide effective query processing by removing many redundant path evaluations and minimizing the number of fragments processed. The conducted experimental results reveal that the proposed scheme efficiently handles query processing and reduces memory usage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.577-585
• /
• 2006

This paper presents a method for reliability evaluation of a telecommunication network with variable link-capacities when the simple paths of the network are known. The LP-EM, suggested by Lee and Park (2001), identifies a composite path as a subnetwork and adds only a minimal set of links at each step which gives maximal increase on the maximum capacity flow of the subnetwork. Thereby the LP-EM reduces the possible occurrence of redundant composite paths significantly over other existing methods. Based on the LP-EM, our method further reduces the possible redundancy by identifying such simple paths that could give no increase of maximum capacity flow on the current subnetwork and excluding those simple paths from consideration in the process of constructing composite paths.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.130.1-130
• /
• 2001

In this paper, a motion control algorithm is developed using a fuzzy control and the optimization of performance function, which makes a robot arm avoid an unexpected obstacle when the end-effector of the robot arm is moving to the goal position. During the motion, if there exists no obstacle, the end-effector of the robot arm moves along the pre-defined path. But if there exists an obstacle and close to the robot arm, the fuzzy motion controller is activated to adjust the path of the end-effector of the robot arm. Then, the robot arm takes the optimal posture for collision avoidance with the obstacle. To show the feasibility of the developed algorithm, numerical simulations are carried out with changing both the positions and sizes of obstacles. It was concluded ...

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.2
• /
• pp.107-114
• /
• 2007

This paper describes the Petri Net(PN) model for reliability analysis of fault-tolerant dual Ethernet which Is applied in Naval Combat System. The network for Naval Combat System performs failure detection and auto path recovery by handling redundant path in case of temporary link failure. After studying the behavior of this kind of network, the reliability analysis model is proposed using stochastic Petri Net and continuous-time Markov chains. Finally, the numerical result is analyzed according to changing the failure rate and the recover rate of link.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.5 s.170
• /
• pp.95-102
• /
• 2005

The coordination of locomotion and manipulation has been the typical and main issue for a mobile manipulator. This is particularly because the solution for the control parameters is redundant and the accuracies of controlling the each joints are different. This paper presents a motion planning method for which the mobile base locomotion is less precise than the manipulator control. In such a case, it is appropriate to move the mobile base to discrete poses and then to move the manipulator to track a prescribed path of the end effector, while the base is stationary. It uses a variant of the conventional manipulability measure that is developed for the trajectory control of the end effector of the mobile manipulator along an arbitrary path in the three dimensional space. The proposed method was implemented on the simulation and the experiments of a mobile manipulator and showed its effectiveness.

• Journal of Korean Society for Quality Management
• /
• v.47 no.4
• /
• pp.701-711
• /
• 2019

Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

• Journal of the Korean Society of Industry Convergence
• /
• v.20 no.1
• /
• pp.49-55
• /
• 2017

This study proposes a new approach to Control and trajectory generation of a 8 DOF human robot arm with computational complexity and singularity problem. To deal with such problems, analytical methods for a redundant robot arm have been researched to enhance the performance of research, we propose an analytical kinematics algorithm for a 8 DOF bipped dual robot arm. Using this algorithm, it is possible to generate a trajectory passing through the singular points and intuitively move the elbow without regarding to the end-effector pose. Performance of the proposed algorithm was verified by simulation test with various conditions. It has been verified that the trajectory planning using this algorithm.