• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2002.11a
• /
• pp.250-254
• /
• 2002

In this paper, we design an optimized planar array structure with triangular lattice for side-lobe reduction using a genetic algorithm. A constraint optimization is implemented by optimally removing some outer array elements far from the array center. It is shown that only the proper array shape without optimizing the magnitudes and phases of each array antenna can give low side-lobe level with a slight main beam broadening.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.477-480
• /
• 2003

Packet losses in the Internet can dramatically degrade quality of multimedia streams. Forward Error Correction (FEC) is one of the best methods that can protect data from packet erasures by means of sending additional redundant information. Proposed control algorithm provides the possibility of receiving real-time multimedia streams of given quality wifth minimal traffic overhead. The traffic optimization is reached by adjusting packet size as well as block code parameters. Calculations and simulation results show that for non-bursty network conditions traffic optimization can lead to more than 50% bandwidth reduction.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.29-32
• /
• 2002

In this paper the wheeled mobile robot is studied. The kinematic and dynamic modeling of the robot is presented via LPD(Linear Parameter Dependent) framework. A path-planning algorithm which is optimized in the sense of robot mobility and distance is presented. And by using PI controller we show that the presented algorithm and model is work very well in the computer simulation and experiment.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.4
• /
• pp.64-73
• /
• 1992

This paper presents the design of multi-level logic optimization algorithm and the development of the SMILE system based on the algorithm. Considering the fanin constraints in algorithmic level, SMILE performs global and local optimization in a predefined sequence using heuristic information. Designed under the Sogang Silicon Compiler design environment, SMILE takes the SLIF netlist or Berkeley equation formats obtained from high-level synthesis process, and generates the optimized circuits in the same format. Experimental results show that SMILE produces the promising results for some circuits from MCNC benchmarks, comparable to the popularly used multi-level logic optimization system, MIS.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.104-115
• /
• 1994

This paper presents the design of a placement sysyem integrated in PCB design system. to get an optimal component positioning from part and net list. Unplaced components are placed in initial process using modified cluster development algorithm and are swapped in improvement process using the GFDR(Generalized Force Directed Relaxation) algorithm. The result is optimized in post process by component rotating or pin/gate swapping. Experimental results shwo that the placement system produces manufacturable layouts which are optimal in terms of total routing length.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.1
• /
• pp.27-34
• /
• 2004

A tetrahedral mesh generation scheme using 3-D operators has been presented. The proposed scheme employs new 3-D operators such as rearranging and modified finishing operators in addition to the previous trimming, wedging, digging, splitting and finishing operators. These new operators have been introduced in order to increase the stability of mesh generation process. Check processings with surrounded element edges and faces have also been optimized by employing a searching algorithm. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2002.11d
• /
• pp.56-60
• /
• 2002

The paper presents the optimum design of a linear induction motor(LIM) using Genetic algorithm, Neural Network and SUMT. The design variables are optimized by three different optimization methods and the results are discussed.

• Proceedings of the KIEE Conference
• /
• 2000.07b
• /
• pp.744-746
• /
• 2000

This paper presents an optimum design of a linear induction motor(LIM) using genetic algorithm(GA). Sequential unconstrained minimization technique(SUMT) is used to transform the nonlinear optimization with constraints to a simple unconstrained problem. The objective functions of LIM such as trust, weight are optimized and the result was applied to the design of linear induction pump.

• Journal of Mechanical Science and Technology
• /
• v.16 no.8
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.5
• /
• pp.285-292
• /
• 2014

The commonly used Newton-Raphson's floating-point number divider algorithm performs two multiplications in one iteration. In this paper, a tentative K'th Newton-Raphson's floating-point number divider algorithm which performs K times multiplications in one iteration is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation in single precision and double precision divider is derived from many reciprocal tables with varying sizes. In addition, an error correction algorithm, which consists of one multiplication and a decision, to get exact result in divider is proposed. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number divider unit. Also, it can be used to construct optimized approximate reciprocal tables.