• Title/Summary/Keyword: Optimal Synthesis

Search Result 569, Processing Time 0.031 seconds

Analysis of Optical Transfer Function and Phase Error of the Modified Triangular Interferometer

  • Kim, Soo-Gil;Ryeom, Jeong-Duk
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.21 no.1
    • /
    • pp.10-18
    • /
    • 2007
  • We synthesize and analyze the optical transfer function(OTF) of the modified triangular interferometer(MTI) using two-pupil synthesis method and we present the optimal MTI, which can obtain any bipolar function by combining a wave plate and a linear polarizer. Also, we analyze its potential phase error sources caused by polarization components.

FSM Synthesis from High-Level Descriptions (상위 수준 기술로부터 순차 회로의 자동 생성)

  • 황선영;유진수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.12
    • /
    • pp.1906-1915
    • /
    • 1990
  • A synthesis system generating sequential circuits from a high-level hardware descdription language CHDL, modelling language for Thor functional/behavioral simulator, is developed. In this paper, we describe the semantic analysis process, state minimization and state assignment algorithms. proposed assignment algorithm generates optimal state vectors using constraint matrix and similarity graph. Expremental results for MCNC benchmarks, standard test circuits, show that the system inplementing the proposed algorithms can be a viable tool for designing large finite state machines.

  • PDF

A New Methodology for the Optimal Design of BSB Neural Associative Memories Considering the Domain of Attraction

  • Park, Yonmook;Tahk, Min-Jea;Bang, Hyo-Choong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.43.5-43
    • /
    • 2001
  • This paper considers a new synthesis of the optimally performing brain-state-in-a-box (BSB) neural associative memory given a set of prototype patterns to be stored as asymptotically stable equilibrium points with the large and uniform size of the domain of attraction (DOA). First, we propose a new theorem that will be used to provide a guideline in design of the BSB neural associative memory. Finally, a design example is given to illustrate the proposed approach and to compare with existing synthesis methods.

  • PDF

A Scheduling Technique for Pipelined Datapath Synthesis (파이프라인형 데이타패스 합성을 위한 스케쥴링 기법)

  • 이근만;임인칠
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.4
    • /
    • pp.74-82
    • /
    • 1992
  • This paper deals with the scheduling problems, which are the most important subtask in High-level Synthesis. ILP(integer linear programming) formulations are used as a scheduling problem approach.For practical application to digital system design, we have concentrated our attentions on pipelined datapath scheduling. For experiment results, we choose the 5-th order digital wave filter as a benchmark and do the schedule. Finally, we can obtain better and near-optimal scheduling results.

  • PDF

Production of Polysaccharide by the Edible Mushroom, Grifola frondosa

  • Kim, Yeon-Ran
    • Mycobiology
    • /
    • v.31 no.4
    • /
    • pp.205-208
    • /
    • 2003
  • The production of polysaccharide according to various developmental stages(mycelium growth, primordium appearance, and fruiting-body formation) in the edible mushroom Grifola frondosa was studied. The cap of the mature mushroom showed the highest amount of polysacchride. Mycelial growth and polysaccharide synthesis were optimal at pH 5 and $20^{\circ}C$. Polysaccharide synthesis was maximal after 12 days of cultivation, whereas maximum mycelial growth was shown after 18 days. Mannose, cellobiose and starch increased the level of polysaccharide as well as growth in submerged culture. Glucose and sucrose appeared to be good substrates for fruiting of Grifola frondosa.

QFT Tunning of Multivariable Mu Controllers

  • Lee, J.W.;Y. Chait;M. Steinbuch
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.157-160
    • /
    • 1998
  • We argue that the combination of optimal control synthesis and QFT tuning enables design of controllers with levels of performance that surpasses what can be achieved using only a single technique. Using a constructive example, we demonstrate how the strength of each technique is utilized to arrive at a particularly desired controller in terms of tradeoffs between performance and controller complexity.

  • PDF

A genetic-algorithm-based high-level synthesis for partitioned bus architecture (유전자 알고리즘을 이용한 분할 버스 아키텍처의 상위 수준 합성)

  • 김용주;최기영
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.3
    • /
    • pp.1-10
    • /
    • 1997
  • We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

  • PDF

Optimal 3D Grasp Planning for unknown objects (임의 물체에 대한 최적 3차원 Grasp Planning)

  • 이현기;최상균;이상릉
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.462-465
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

  • PDF

The Optimal Grasp Planning by Using a 3-D Computer Vision Technique (3차원 영상처리 기술을 이용한 Grasp planning의 최적화)

  • 이현기;김성환;최상균;이상룡
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.11
    • /
    • pp.54-64
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has mainly analyzed with either unknown objects 2-dimensionally by vision sensor or known objects, such as cylindrical objects, 3-dimensionally. As extending the previous work, in this study we propose an algorithm to analyze grasp of unknown objects 3-dimensionally by using vision sensor. This is archived by two steps. The first step is to make a 3-dimensional geometrical model for unknown objects by using stereo matching. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand which has the characteristic of multi-finger hand and is easy to model. To find the optimal grasping points, genetic algorithm is employed and objective function minimizes the admissible force of finger tip applied to the objects. The algorithm is verified by computer simulation by which optimal grasping points of known objects with different angle are checked.

A NEW ALGORITGMIC HEURISTICS FOR THE SYNTHESIS OF OPTIMAL HEAT EXCHANGER NETWORT

  • Cho, Y.S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.819-824
    • /
    • 1989
  • This paper proposes a new method for the discovery and design of an optimal heat exchanger network. The method is based upon the concept of pinch, a problem reduction technique and the heuristics developed in this work. It generates subproblems in a logical way and solves the subproblems by the heuristics to synthesize an optimal network structure. It is thought that the heuristics can preserve the minimum utility consumption, the minimum number of heat exchanger units, and the minimum number of stream splittings needed for a given problem. The minimum heat exchanger area for the optimal network can then be obtained by adjusting the temperatures associate with the heat exchanger in the optimal network structure. The method is applied to the problems appeared in the literatures. The results show the reductions in the number of heat exchanger units for some problems.

  • PDF