• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.13-26
• /
• 1993

Motion picture algorithms are realized on the multiprocessor system presented in the Study I. For the most efficient processing of the algorithms, pipelining and geometrical parallel processing methods are employed, and processing time, communication load and efficiency of each algorithm are compared. The performance of the implemented system is compared and analysed with reference to MPEG coding algorithm. Theoretical calculations and experimental results both shows that geometrical partitioning is a more suitable parallel processing algorithm for moving picture coding having the advantage of easy algorithm modification and expansion, and the overall efficiency is higher than pipelining.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.281-284
• /
• 2004

This paper presents the design and implementation of a QoS based enhanced collaboration system in MDO. This is an efficient distributed communication tool between designers. It supports text communication, audio/video communication, file transfer and XML data sending/receiving. Specially, this system supports a dynamic QoS self-adaptation by using the improved direct adjustment algorithm (DAA+). The original direct adjustment algorithm adjusts the transmission rate according to the congestion level of the network, based on the end to end real time transport protocol (RTP), and controls the transmission rate by using the information of loss ratio in real time transport control protocol (RTCP). But the direct adjustment algorithm does not consider when the RTCP packets are lost. We suggest an improved direct adjustment algorithm to solve this problem. We apply our improved direct adjustment algorithm to our of QoS (Quality of Service) [1] based collaboration system and show the improved performance of transmission rate and loss ratio.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.34-39
• /
• 2004

Huffman coding which has been used in many data compression algorithms is a popular data compression technique used to reduce statistical redundancy of a signal. It has been proposed that the Huffman algorithm can decode efficiently using characteristics of the Huffman tables and patterns of the Huffman codeword. We propose a new Huffman decoding algorithm which used a multi way tree search and present an efficient hardware implementation method. This algorithm has a small logic area and memory space and is optimized for high speed decoding. The proposed Huffman decoding algorithm can be applied for many multimedia systems such as MPEG audio decoder.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.4
• /
• pp.9-19
• /
• 2008

In this paper, it is studied anti-collision algorithm based on the transmission protocol for RFID baseband system of the lSO/IEC 18000-6 Type-C regulation and designed the baseband part of RFID reader system using FPGA. To compensate this weak point of the slot random aloha algorithm which must have a long time to be dumped before deciding an appropriate slot size according to the number of surrounding tag, we suggested how to apply Bit By Bit algorithm to be able to recognize the tag when the tag is clashing. The design of the baseband part in the RFID reader system is accomplish by use of the ISE9.1i and I made an experiment on it targeting Spartan2. Construction verification is measured each block through Logic Analyzer and I can verify it has no error. I also compared and analyzed the performance between proposed algorithm and past algorithm and verified the improvement of performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.3
• /
• pp.62-67
• /
• 2002

From the view point of VLSI implementation, a new teaming algorithm suited for network with quantized connection weights is desired. This paper presents a new teaming algorithm for the DBM(deterministic Boltzmann machine) network with quantized connection weight. The performance of proposed algorithm is tested with the 2-input XOR problem and the 3-input parity problem through computer simulations. The simulation results show that our algorithm is efficient for quantized connection neural networks.

• Journal of Mechanical Science and Technology
• /
• v.17 no.10
• /
• pp.1399-1410
• /
• 2003

In this paper, we develop a joystick manual driving algorithm for an electric vehicle called Cycab. Cycab is developed as a public transportation vehicle, which can be driven either by a manual joystick or an automated driving mode. The vehicle uses six motors for driving four wheels, and front/rear steerings. Cycab utilizes one industrial PC with a real time Linux kernel and four Motorola MPC555 micro controllers, and a CAN network for the communication among the five processors. The developed algorithm consists of two automatic vehicle speed control algorithms for normal and emergency situations that override the driver's joystick command and an open loop torque distribution algorithm for the traction motors. In this study, the algorithm is developed using SynDEx, which is a system level CAD software dedicated to rapid prototyping and optimizing the implementation of real-time embedded applications on distributed architectures. The experimental results verify the usefulness of the two automatic vehicle control algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.2
• /
• pp.145-152
• /
• 2004

This paper proposes a representation for the embodiment design of mechanical structures and a genetic algorithm suited for the representation. In order to represent early stages and latter stages of the embodiment design, the designs are modeled as simultaneous multi-objective optimization problems of parametric designs for parts and of layout generation for structures. The study, thus, involves genotypes that are adequate to represent phenotypes of the models for the genetic algorithm to solve the given problems. We demonstrate the implementation of the genetic algorithm with the result applied to the gear equipment design.

• International Journal of Ocean System Engineering
• /
• v.2 no.3
• /
• pp.139-150
• /
• 2012

This paper presents an improved guidance algorithm for autonomous underwater vehicles (AUV) in 3D space for generating smoother vehicle turn during the course change at the way-points. The way-point guidance by the line-of-sight (LOS) method has been modified for correcting the reference angles to achieve minimal calculation and smoother transition at the way-points. The algorithm has two phases in which the first phase brings the vehicle to converge to a distance threshold point on the line segment connecting the first two way-points and the next phase generates an angular path with smoother transition at the way-points. Then the desired angles are calculated from the reference and correction angles. The path points are regularly parameterized in the spherical coordinates and mapped to the Cartesian coordinates. The proposed algorithm is found to be simple and can be used for real time implementation. The details of the algorithm and simulation results are presented.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.55-58
• /
• 2007

An adaptive subcarrier allocation scheme based on comparative superiority of opportunity cost between groups is proposed for the enhancement of system capacity and its simple implementation at the base station of a multiuser OFDM system. The proposed algorithm is similar to the blockwise or the decentralized subcarrier allocation algorithm proposed by Xiaowen et al and Alen et al, respectively. In the proposed algorithm, however, all subcarriers are grouped according to the coherence bandwidth and the comparative superiority concept, which swaps the groups between users if the system capacity is increased, is adopted for the enhancement of system capacity. In addition, the proposed algorithm provides a simple solution for the conflict problem among users by reallocating only the conflicted groups and unassigned groups instead of reallocating entire groups. Simulation results demonstrate that the proposed algorithm increases the system capacity effectively over a static, an adaptive blockwise, and a decentralized subcarrier allocation algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.