• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.10
• /
• pp.1621-1626
• /
• 2001

The structural optimization have been carried out in the continuous design space or in the discrete design space. Methods fur discrete variables such as genetic algorithms , are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete des inn space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions leer constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.5
• /
• pp.74-83
• /
• 1996

An iterative tuning technique is derived for PID controllers which are widely used in industries. The tuning algorithm is based upon a fuzzy indirect reasoning method and an iterative technique. The PID gains for the first tuning action are determined by a method which is modified from the Ziegler-Nichols step response method. The first PID gains are determined to obtain a control performance so close to a design performance that the following tuning process can be made effectively. The design paramaters are given as time-domain variables which human is familiar with. The results of simulation studies show that the proposed tuning method can produce an effective tuning for arbitrary design performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.798-809
• /
• 2013

In this paper, we propose robust relay and destination filter design methods for the multi-user peer-to-peer amplify-and-forward relaying systems while taking imperfect channel knowledge into consideration. Specifically, the relay and destination filter sets are developed to minimize the sum mean-squared-error (MSE). We first present a robust joint optimum relay and destination filter calculation method with an iterative algorithm. Motivated by the need to reduce computational complexity of the iterative scheme, we then formulate a simplified sum MSE minimization problem using the relay filter decomposability, which lead to two robust sub-optimum non-iterative design methods. Finally, we propose robust modified destination filter design methods which require only local channel state information between relay node and a specific destination node. The analysis and simulation results verify that, compared with the optimum iterative method, the proposed non-iterative schemes suffer a marginal loss in performance while enjoying significantly improved implementation efficiencies. Also it is confirmed that the proposed robust filter design methods provide desired robustness in the presence of channel uncertainty.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.32 no.3
• /
• pp.258-266
• /
• 2008

The conventional approximate optimization method, which uses the statistical design of experiments(DOE) and response surface method(RSM), can derive an approximated optimum results through the iterative process by a trial and error. The quality of results depends seriously on the factors and levels assigned by a designer. The purpose of this study is to propose a new technique, which is called a sequential design of experiments(SDOE), to reduce a trial and error procedure and to find an appropriate condition for using artificial neural network(ANN) systematically. An appropriate condition is determined from the iterative process based on the analysis of means. With this new technique and ANN, it is possible to find an optimum design accurately and efficiently. The suggested algorithm has been applied to various mathematical examples and a structural problem.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.333-336
• /
• 2001

This paper reports that the Lambert W function applies to a non-iterative design of minimum mean square-error scalar quantizers for a Laplacian source. The contribution of the paper is in the reduction of the time needed for the design and the increased accuracy in resulting quantization points and thresholds, because the algorithm is non-iterative and the Lambert W function can be evaluated as accurately as desired.

• Proceedings of the Optical Society of Korea Conference
• /
• 2000.02a
• /
• pp.296-297
• /
• 2000

프라운호퍼 회절에 의하여 주어진 세기 무늬를 발생시키는 회절광학소자(Diffractive Optical Element, DOE)는 회절무늬소자, 키노폼(kinoform), 컴퓨터 푸리에 홀로그램 (computer-generated Fourier hologram) 등으로 불리우며, 광정보처리, 광연결, 레이저가공에서 중요한 역할을 한다. 이 소자를 설계하는 매우 다양한 방법들이 제안되었는데, iterative Fourier transform 알고리즘(IFTA)과 이를 변형한 알고리즘들이 가장 널리 사용된다. IFTA는 fast Fourier transform(FFT)를 활용하므로 계산시간이 절감되지만 국소 최소점에 고착되는 stagnation문제가 있어 이를 해결하기 위한 많은 변형된 알고리즘들이 제안되었다. 본 연구에서는 최근에 제안한 new Pnoise algorithm with hybrid input-output algorithm(NPA-HIOA)$^{(1)}$ 의 설계 성능을 IFTA, hybrid input-output 알고리즘(HIOA), new Pnoise 알고리즘(NPA)$^{(2)}$ , Nonlinear Least-Square (NLS)$^{(3)}$ 등의 기존의 알고리즘들과 비교하고자 한다. (중략)

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2004-2009
• /
• 2003

A robust optimal control design is proposed in this study for rigid robotic systems under the unknown load and the other uncertainties. The uncertainties are quadratically bounded for some positive definite matrix. Iterative method finding the Q weighting matrix is shown. Computer simulations have been done for a weight-lifting operation of a two-link manipulator and the result of the simulation shows that the proposed algorithm is very effective for a robust control of robotic systems.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.5
• /
• pp.445-454
• /
• 2015

In this paper, we propose an optimal design method for a dual reflector antenna(DRA) using the Genetic algorithm. In order to reduce the computational burden during the optimal design, we exploit the iterative physical optics(IPO) to calculate the surface current distribution at each reflector antenna. To improve the accuracy, we consider the shadow effect by the structure and the coupling effect by the multi-reflection based on the iterative MFIE(Magnetic Field Integral Equation). To reduce the number of design variables and generate a smooth surface, we use the Bezier function with the control points, which become the design variables in this paper. We adopt the HPBW(Half Power Beam Width), the FNBW(First Null Beam Width), and the SLL(Side Lobe Level) as the objective or cost functions. To verify the results, we compare them with the those of the commercial tool.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.16-25
• /
• 2005

In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency