• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.162-168
• /
• 1998

The traditional robot manipulators are actuated by continuous range of motion actuators such as motors or hydraulic cylinders. However, there are many applications of mechanisms and robotic manipulators where only a finite number of locations need to be reached, and the robot's trajectory is not important as long as it is bounded. Binary manipulator uses actuators which have only two stable states. As a result, binary manipulators have a finite number of states. The number of states of a binary manipulator grows exponentially with the number of actuators. This kind of robot manipulator has some advantage compared to a traditional one. Feedback control is not required, task repeatability can be very high, and finite state actuators are generally inexpensive. And this kind of robot manipulator has a fault tolerant mechanism because of kinematic redundancy. This paper develops algorithms for kinematics and workspace analysis of a binary manipulator.

• Korean Journal of Mathematics
• /
• v.7 no.1
• /
• pp.37-44
• /
• 1999

We study the relations among the domination number, the independent domination number, and the independence number of an oriented tree and establish their bounds. We also do the same for a binary tree.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.1 s.94
• /
• pp.211-218
• /
• 1999

The traditional robot manipulators are actuated by continuous range of motion actuators such as motors or hydraulic cylinders. However, there are many applications of mechanisms and robotic manipulators where only a finite number of locations need to be reached, and the robot’s trajectory is not important as long as it is bounded. Binary manipulator uses actuators which have only two stable states. As a result, binary manipulators have a finite number of states. The number of states of a binary manipulator grows exponentially with the number of actuators. This kind of robot manipulator has some advantage compared to a traditional one. Feedback control is not required, task repeatability can be very high, and finite state actuators are generally inexpensive. And this kind of robot manipulator has a fault tolerant mechanism because of kinematic redundancy. In this paper, we solve the inverse kinematic problem of a binary parallel robot manipulator using neural network and test the validity of this structure using some arbitrary points m the workspace of the robot manipulator. As a result, we can show that the neural network can find the nearest feasible points and corresponding binary states of the joints of the robot manipulator

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.216-221
• /
• 2004

This paper describes an optimal synthesis method of binary neural network for pattern recognition. Our objective is to minimize the number of connections and the number of neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm (NETLA) for the multilayered neural networks. The synthesis method in NETLA uses the Expanded Sum of Product (ESP) of the boolean expressions and is based on the multilayer perceptron. It has an ability to optimize a given binary neural network in the binary space without any iterative learning as the conventional Error Back Propagation (EBP) algorithm. Furthermore, NETLA can reduce the number of the required neurons in hidden layer and the number of connections. Therefore, this learning algorithm can speed up training for the pattern recognition problems. The superiority of NETLA to other learning algorithms is demonstrated by an practical application to the approximation problem of a circular region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1474-1481
• /
• 2000

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.5
• /
• pp.492-504
• /
• 1987

The Binary Decision method can evaluate any switching function in the number of steps not exceeding the number of input variables. A Binary Decision Programmable Controller module is designed using this method so as to improve scan speed. A compiler system is also developed to relieve the memory problem which the Binary Decision method entails. A communication channel between MDS and BD-PC modules is also constructed to load the compiled BD-PC object program into the memory of BD machine.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.1-8
• /
• 2003

A novel CORDIC circuit is presented based on a redundant number system eliminating global carry Propagation. The number format employs a new recoding scheme similar to the Booth receding resolving carry problems in addition. A pipelined architecture is introduced having a constant scale factor in its computation of trigonometric functions. The operational time of the circuit is constant independent of the number of operand digits.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.1
• /
• pp.122-128
• /
• 2003

In this paper, a 16${\times}$16-bit Multiplier and Accumulator (MAC) is designed using a Redundant Binary Adder (RBA) circuit so that it can make a fast addition of the Redundant Binary Partial Products (RB_PP's) by using Wallace-tree structure. Because a RBA adds two RB numbers, it acts as a 4-2 compressor, which reduces four inputs to two output signals. We propose a method to convert the Redundant Binary (RB) representation into the 2's complement binary representation. Instead of using the conventional full adders, a more efficient RB number to binary number converter can be designed with new conversion method.