• Title/Summary/Keyword: Synthesis Algorithm

Search Result 667, Processing Time 0.031 seconds

ANN Synthesis Models Trained with Modified GA-LM Algorithm for ACPWs with Conductor Backing and Substrate Overlaying

  • Wang, Zhongbao;Fang, Shaojun;Fu, Shiqiang
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.696-705
    • /
    • 2012
  • Accurate synthesis models based on artificial neural networks (ANNs) are proposed to directly obtain the physical dimensions of an asymmetric coplanar waveguide with conductor backing and substrate overlaying (ACPWCBSO). First, the ACPWCBSO is analyzed with the conformal mapping technique (CMT) to obtain the training data. Then, a modified genetic-algorithm-Levenberg-Marquardt (GA-LM) algorithm is adopted to train ANNs. In the algorithm, the maximal relative error (MRE) is used as the fitness function of the chromosomes to guarantee that the MRE is small, while the mean square error is used as the error function in LM training to ensure that the average relative error is small. The MRE of ANNs trained with the modified GA-LM algorithm is less than 8.1%, which is smaller than those trained with the existing GA-LM algorithm and the LM algorithm (greater than 15%). Lastly, the ANN synthesis models are validated by the CMT analysis, electromagnetic simulation, and measurements.

A Study of Synthesis Algorithm for Component Mapping (콤포넌트 맵핑을 위한 합성 알고리즘에 관한 연구)

  • 김재진;이사원
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.44-48
    • /
    • 1998
  • In this paper proposed Component Synthesis Algorithm(CSA) for mapping described HDL to RT component of given library. CSA transform I/O variables of HDL and relation of operators to control/data flow graph(CDFG) that consists of graph, reduce the size of graph, compute the cost, the bound, and the method that use compatibility graph(CG), and then mapping to component. Component synthesis used branch-and-bound algorithm. The result that synthesis using CSA algorithm was proved that this result and the cost of the manual were indentified.

  • PDF

Parallel Rotated Exemplar-based Texture Synthesis (병렬 회전 예제 기반 텍스처 합성)

  • Park, Han-Wook;Kim, Chang-Hun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.15 no.1
    • /
    • pp.17-23
    • /
    • 2009
  • We present a simple new idea to improve the quality of exemplar based texture synthesis using multiple rotated input exemplars. Our algorithm successfully obtain rotational synthesis feature variations and manages to reduce the artifacts in the results, especially patch seams due to the structure of the exemplars provided which have been inappropriate for previous neighborhood matching synthesis algorithms. Our algorithm is parallel in nature, thus it is possible to implement our algorithm using GPU or multi-core CPU to accelerate synthesis process.

  • PDF

Offset Slider-Rocker Linkage Synthesis Using Transmission Angles as Synthesis Parameters (전달각을 이용한 오프셋 슬라이더-로커 링크장치의 합성)

  • Gwon, Seong-Gyu
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.4 s.175
    • /
    • pp.881-893
    • /
    • 2000
  • An analytical synthesis technique for offset slider-rocker 4-bar linkages is devised where transmission angles are used as essential synthesis parameters. Finding the location where both the maximum and the minimum transmission angles arise leads to establishing the algorithm for limiting transmission angles of the slider-rocker linkage which has different offsets according to the direction of the slider. Position analysis by the algorithm gives formula for the dimensional synthesis for the linkage. Application to examples shows that the algorithm and the formula yield proper slider-rocker linkages with regard to limiting transmission angles to the maximum value.

Synthesis Problems of the Nonlinear Systems Via Dynamic Feedback (비선형 시스템의 Dynamic Feedback을 이용한 합성)

  • 이홍기;전홍태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.12
    • /
    • pp.19-26
    • /
    • 1991
  • In this paper, we give a structure algorithm for the synthesis problems of the nonlinear system via dynamic feedback. Using our algorithm, sufficient conditions for the input-output synthesis problems are discussed. The problems we consider in this paper include dynamic input-output decoupling input-output linearization, and immersion into a linear system.

  • PDF

Synthesis of Multi-View Images Based on a Convergence Camera Model

  • Choi, Hyun-Jun
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.197-200
    • /
    • 2011
  • In this paper, we propose a multi-view stereoscopic image synthesis algorithm for 3DTV system using depth information with an RGB texture from a depth camera. The proposed algorithm synthesizes multi-view images which a virtual convergence camera model could generate. Experimental results showed that the performance of the proposed algorithm is better than those of conventional methods.

A Hardware Allocation Algorithm for Data Path Synthesis (데이터 경로 합성을 위한 하드웨어 할당 알고리즘)

  • 김홍식;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.8
    • /
    • pp.1303-1310
    • /
    • 1990
  • This paper describes the design and implementation of a system for automatic data path synthesis in digital system. There are four subtasks to synthesize a digital system: scheduling, register allocation, functional unit allocation and bus allocation. In this paper, force directed algorithm is used for the scheduling while new algorithms are proposed for the allocation subtasks. Synthesis results of two experimental data paths including MC6502 have shown that our proposed algorithm out goes most of previous works.

  • PDF

A Minimal Resource High-Level Synthesis Algorithm for Low Power Design Automation (저 전력 설계 자동화를 위한 최소 자원 상위 레벨 합성 알고리즘)

  • Lin, Chi-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.3
    • /
    • pp.95-99
    • /
    • 2008
  • This paper proposes a new minimal resource high-level synthesis algorithm for low power design automation. The proposed algorithm executes an efficient approach to minimize the power consumption of the functional units in a circuit during the high level synthesis. In this paper, we visit all control steps one by one to reduce the switching activity in CDFG. The register sharing algorithm determines the minimum register after the life time analysis of all variable. According to property of input signal for functional unit, the proposed method visits all control step one by one and determines the resource allocation with minimal power consumption at each control step in a greedy fashion. The effect of the proposed algorithm has been proved through various filter benchmark to adopt a new scheduling and allocation algorithm considering the low rover.

  • PDF

Kinematic Tolerance Synthesis Using Generalized Configuration Spaces (컨피규레이션 공간을 이용한 기구학적 공차 설계)

  • Kyung M.-H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.4
    • /
    • pp.284-292
    • /
    • 2005
  • This paper presents a new framework of kinematic tolerance synthesis and describes the implemented algorithm for planar mechanical systems comprised of higher kinematic pairs. Input to the synthesis algorithm is a parametric model of the mechanical system with allowed parameter ranges (tolerance ranges). The model is specified as the part profiles consisting of line and arc segments and the motion axes along which each part moves. The algorithm analyzes tolerance in generalized configuration space, called contact zones bounding the worst-case variations, and identifies bad system variations. The bad system variations then are removed out of the parameter ranges by adjusting the nominal parameter values if possible and then shrinking the ranges otherwise. This cycle is repeated until no more bad variations we found. I show the effectiveness of the algorithm by case studies on several mechanisms.