• 제목/요약/키워드: Problem of synthesis

검색결과 512건 처리시간 0.024초

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

  • 김용주;최기영
    • 전자공학회논문지C
    • /
    • 제34C권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

ACCURATE SYNTHESIS OF SEEDLING SEPARATING-PLANTING MECHANISM OF RICE TRANSPLANTER

  • Hu, Hanxiang;Chen, Dejun;Wang, Changbing;Li, Zhenyong;Wu, Jienian;Xu, Jinda
    • 한국농업기계학회:학술대회논문집
    • /
    • 한국농업기계학회 1993년도 Proceedings of International Conference for Agricultural Machinery and Process Engineering
    • /
    • pp.284-290
    • /
    • 1993
  • In order to improve the adaptability of rice transplanter to seeding with different length when transplanting multicropping rice in south China. The seedling separating planting mechanism is resynthesized in the paper. According to the agronomy requirements of seedling's transplanting, optimum motional path of the tip point of planting needle is obtained. by applying the established kinematic model of the separating planting mechanism, the relevant software is compiled. On the basis of the features of the problem, the constrained optimization method is utilized to solve the problem with 24 restrictions. Thus, the optimum structure parameters are obtained to satisfy the path points accurately.

  • PDF

Robust $\textrm{H}_\infty$ Control Design for the Space Station with Structured Parameter Uncertainty

  • Byun, Kuk-Whan;Bong-Wie;Dabid-Gaiier;John-Sunkel
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.431-441
    • /
    • 1991
  • A robust H$_{\infty}$ control design methodology and its application to a Space Station attitude and momentum control problem are presented. This new approach incorporates nonlinear multi-parameter variations in the state-space formulation of H$_{\infty}$ control theory. An application of this robust H$_{\infty}$ control synthesis technique to the Space Station control problem yields a remarkable result in stability robustness with respect to the moments-of-inertia variation of about 73% in one of the structured uncertainty directions. The performance and stability of this new robust H$_{\infty}$ controller for the Space Station are compared to those of other controllers designed using a standard linear-quadratic-regulator synthesis technique.que.

  • PDF

Behavior-level Service Composition by Variable Abstraction

  • Kil, Hyun-Young
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권9호
    • /
    • pp.59-67
    • /
    • 2019
  • The service composition based on Service-Oriented Architecture(SOA) can make us view various machines or its functionalities in the Web or Internet-of-Things environment as 'service', and efficiently create new value-added services that users want by compositing different services if there is no service to satisfy the client. The service composition problem with respect to behavioral descriptions deals with the automatic synthesis of a coordinator service that controls a set of services to reach a goal state. Despite its importance, however, solving the service composition problem with only partial observations remains to be doubly exponential in the number of variables in service descriptions, rendering any attempts to compute an exact solution for modest size impractical. Toward this challenge, in this paper, we propose novel approximation-based approaches using abstraction methods. We empirically validate that our proposals can solve realistic problems efficiently.

Real-Time Generation of City Map for Games in Unity with View-dependent Refinement and Pattern Synthesis Algorithm

  • Kim, Jong-Hyun
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권4호
    • /
    • pp.51-56
    • /
    • 2019
  • In this paper, we propose an algorithm that can quickly generate and synthesize city maps in racing games. Racing games are characterized by moving a wide map rather than a fixed map, but designing and developing a wide map requires a lot of production time. This problem can be mitigated by creating a large map in the preprocessing step, but a fixed map makes the game tedious. It is also inefficient to process all the various maps in the preprocessing step. In order to solve this problem, we propose a technique to create a terrain pattern in the preprocessing process, to generate a map in real time, and to synthesize various maps randomly. In addition, we reduced unnecessary rendering computations by integrating view-dependent techniques into the proposed framework. This study was developed in Unity3D and can be used for various contents as well as racing game.

효율적인 Partial Scan 설계 알고리듬 (An Efficient Algorithm for Partial Scan Designs)

  • 김윤홍;신재흥
    • 전기학회논문지P
    • /
    • 제53권4호
    • /
    • pp.210-215
    • /
    • 2004
  • This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

NEW POLYIMIDES: SYNTHESIS, PROPERTIES AND POTENTIAL APPLICATION

  • Kravtsova, V.D.;Zhubanov, B.A.;Bekmagambetova, K.H.
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 1998년도 춘계학술대회 논문집
    • /
    • pp.481-483
    • /
    • 1998
  • The problem of production of new materials based on polyheteroarylenes and other polymers combining good mechanical and dielectric properties. radiation and chemical stability with heat- and thermal stability is related with the development of efficient synthesis technique of starting low-molecular compounds. Alicyclic dianhydrides are believed to be the promising monomers to synthesize various polymers.

  • PDF

Synthesis of Multiple Constant Multiplication Circuits Using GA with Chromosomes Composed of Stack Type Operators

  • Isoo, Yosuke;Toyoshima, Hisamichi
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -2
    • /
    • pp.623-626
    • /
    • 2000
  • The purpose of this paper is to find an efficient solution for multiple constant multiplication (MCM) problem. Since the circuit structure can be represented as a directed acyclic graph, evolutionary computing is considered as an effective tool for optimization of circuit synthesis. In this paper, we propose a stack type operator as a chromosome element to synthesize a directed acyclic graph efficiently. This type of chromosome can represent a graph structure with a set of simple symbols and so we can employ the similar method to a conventional GA.

  • PDF

부분구조합성법을 이용한 냉장고의 진동해석 (Vibration Analysis of a Refrigerator Using Component Synthesis Method)

  • 김석관;김성대;임기수
    • 소음진동
    • /
    • 제3권3호
    • /
    • pp.253-257
    • /
    • 1993
  • In this study, vibration analysis of a refrigerator was carried out to reduce vibration induced noise. When the components of a machine are assembled together, the natural frequencies of each component are changed since they have influences on one another. To avoid the problem of resonance, the vibration characteristics of each component must be checked systematically after they are designed. For this purpose, vibration analysis of a refrigerator was done using a component synthesis method. The experimental and analytical results showed good agreement and are presented here.

  • PDF

파라미터 불확실성 시스템에 대한 비약성 제어기 설계에 관한 연구 (A Study on Non-Fragile Controller Design for Parameter Uncertain Systems)

  • 박성욱;오준호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.272-272
    • /
    • 2000
  • since the controller is part or the overall closed-Loop system, it is necessary that the designed controller be able to tolerate some uncertainty in its coefficients. The adequate stability and performance margins are required for the designed nominal controllers. In the paper. we study the method to design the non-fragile fixed-structured controller for real parametric uncertain systems. When we impose the controller parameter perturbation, the structure of the controller must be given. Therefore, we assume that the controller has fixed-structure. The fixed-structure controller is practically necessary especially when the robust controller synthesis results in a high-order controller. In SISO systems, we propose the robust controller design method using the Mapping theorem. In the method, the plant uncertainty and controller Parameter are of the multilineal form in the stability and performance conditions. Then, the controller synthesis problem is easily recast to Linear Programming Problem.

  • PDF