• 제목/요약/키워드: synthesis algorithm

검색결과 668건 처리시간 0.02초

최적 연료주입 모델 추종형 ${\mu}-$합성 제어기의 설계에 관한 연구 (A study of design on model following ${\mu}-$synthesis controller for optimal fuel-injection)

  • 황현준;김동완;정호성;손무헌;김영훈;황기현;문경준;박준호;황창선
    • 제어로봇시스템학회논문지
    • /
    • 제4권2호
    • /
    • pp.163-169
    • /
    • 1998
  • In this paper, we design an optimal model following ${\mu}-$synthesis control system for fuel-injection of diesel engine which has robust performance and satisfactory command tracking performance in spite of uncertainties of the system. To do this, we give gain and dynamics parameters to the weighting functions and apply genetic algorithm with reference model to the optimal determination of the weighting functions that are given by the D-K iteration method which can design ${\mu}-$synthesis controller in the state space. These weighting functions are optimized simultaneously in the search domain which guarantees the robust performance of the system. The ${\mu}-$synthesis control system for fuel-injection designed by the above method has not only the robust performance but also a better command tracking performance than those of the ${\mu}-$synthesis control system designed by trial-and-error method. The effectiveness of this ${\mu}-$synthesis control system for fuel-injection is verified by computer simulation.

  • PDF

가변 데이터 입력 간격을 지원하는 파이프라인 구조의 합성 (Synthesis of Pipeline Structures with Variable Data Initiation Intervals)

  • 전홍신;황선영
    • 전자공학회논문지A
    • /
    • 제31A권6호
    • /
    • pp.149-158
    • /
    • 1994
  • Through high level synthesis, designers can obtain the precious information on the area and speed trade-offs as well as synthesized datapaths from behavioral design descriptions. While previous researches were concentrated on the synthesis of pipelined, datapaths with fixed DII (Data Initiation Interval) by inserting delay elements where needed, we propose a novel methodology of synthesizing pipeline structures with variable DIIs. Determining the time-overlapping of pipeline stages with variable DIIs, the proosed algorithm performs scheduling and module allocation using the time-overlapping information. Experimental results show that significant improvement can be achieved both in speed and in area.

  • PDF

평면 배열 안테나에 의한 다중 빔 복사 패턴의 합성 (A Multibeam Pattern Synthesis of Planar Array Antenna)

  • 허문만;이인재;윤현보
    • 한국전자파학회논문지
    • /
    • 제17권10호
    • /
    • pp.1007-1019
    • /
    • 2006
  • 임의의 필드 분포를 갖는 단일 페치 안테나를 평면 배열하고 각 소자에 공급되는 급전 신호의 크기와 위상을 유전자 알고리즘으로 최적화하여, 여러 방향의 지향성과 널을 갖는 다중 빔 복사 패턴의 합성 방법을 제안하였다. 제안된 방법의 유효성을 확인하기 위해서, $2{\times}2$ 평면 배열 안테나를 제작하고 원거리 복사 패턴의 계산 결과와 측정 결과를 비교하여 동일한 특성을 확인하였으며, 다중 빔 복사 패턴의 합성은 $8{\times}8$ 배열 안테나 시스템을 이용하여, 시뮬레이션을 통해서 각 소자의 급전 신호의 크기와 위상을 최적화하였다.

선형배열음원의 최적 지향성합성 (Optimal Directivity Synthesis of Linear array Sources)

  • 정의철;김상윤;김온;조기량
    • 한국통신학회논문지
    • /
    • 제37권4A호
    • /
    • pp.250-259
    • /
    • 2012
  • 본 논문에서는 반복계산에 따라 비선형 최소점을 탐색하는 최적화 알고리즘의 선택이 선형배열음원의 지향성합성에 미치는 영향을 목적지향성의 설계사양에 대한 만족도, 수렴성, 그리고 적응성의 면에서 비교 검토하였다. 지향성합성은 최적화 알고리즘인 DFP(Davidon-Fletcher-Powell)법과 BFGS (Broyden-Fletcher-Goldfarb-Shanno)법을 이용하였으며, 준이상 빔과 회전 빔, 그리고 멀티 빔을 목적지향성으로 설정하였다. 수치계산 결과, 지향성합성에 대한 준뉴톤법의 유효성 확인과 함께 수치계산 과정에서 발생된 문제점에 대한 해결 방법도 제시하였다.

인간형 로봇 손 시스템과 실시간 파지 동작 제어에 관한 연구 (A Study on Humanoid Robot Hand System and Real-Time Grasp Motion Control)

  • 임미섭;오상록;손재범;이병주;유범재;홍예선
    • 제어로봇시스템학회논문지
    • /
    • 제6권5호
    • /
    • pp.404-414
    • /
    • 2000
  • This paper addresses the development of a 3-fingered humanoid robot hand system and a real-time grasp synthesis of multifingered robot hands to find grasp configurations which satisfy the force closure condition of arbitrary shaped objects. We propose a fast and efficient grasp synthesis algorithm for planar polygonal objects, which yields the contact locations on a given polygonal object to obtain a force closure grasp by the multifingered robot hand. For an optimum grasp and real-time computation, we develop the preference and the hibernation process and assign physical constraints of the humanoid hand to the motion of each finger. The preferences consist of each sublayer reflecting the primitive preference similar to the conditional behaviors of humans for given objectives and their arrangements are adjusted by the heuristics inspired from human's grasping behaviors. The proposed method reduces the computational time significantly at the sacrifice of global optimality, and enables the grasp posture to be changable within two-finger and three-finger grasps. The performance of the presented algorithm is evaluated via simulation studies to obtain the force-closure grasps of polygonal objects with fingertip grasps. The architecture suggested is verified through experimental implementation to our robot hand system by solving the 2- or 3-finger grasp synthesis.

  • PDF

SPEECH SYNTHESIS IN THE TIME DOMAIN BY PITCH CONTROL USING LAGRANGE INTERPOLATION(TD-PCULI)

  • Kang, Chan-Hee;Shin, Yong-Jo;Kim, Yun-Seok-;Kang, Dae-Soo;Lee, Jong-Heon-;Kwon, Ki-Hyung;An, Jeong-Keun;Sea, Sung-Tae;Chin, Yong-Ohk
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 1994년도 FIFTH WESTERN PACIFIC REGIONAL ACOUSTICS CONFERENCE SEOUL KOREA
    • /
    • pp.984-990
    • /
    • 1994
  • In this paper a new speech synthesis method in the time domain using mono-syllables is proposed. It is to overcome the degradation of the synthetic speech quality by the synthesis method in the frequency domain and to develop an algorithm in the time domain for the prosodic control. In particular when we use a method in a time domain with mono-syllable as a synthesis unit it will be the main issues which are to control th pitch period and to smooth the energy pattern. As a solution to the pitch control, a method using Lagrange interpolation is suggested. As a solution to the other problem, an algorithm which can control the amplitude envelop shape of mono-syllable is proposed. As the results of experiments it was possible to synthesize unlimited Korean speeches including the prosody control. Accoding to the MOS evaluation the quality and the naturality in them was improved to be a good level.

  • PDF

열교환망 자동합성을 위한 새로운 방법 (A new method for an automated synthesis of heat exchanger networks)

  • 이규황;김민석;이인범;고홍철
    • 제어로봇시스템학회논문지
    • /
    • 제4권2호
    • /
    • pp.256-263
    • /
    • 1998
  • Among process synthesis problems, the heat exchanger network (HEN) has been subjected to the most concentrated effort because this kind of problems was well defined for solving it and 20-30% energy savings could be realized in the present chemical processes. In this paper, we use an evolutionary approach for HEN synthesis because this approach can overcome the local optimum and combine some heuristic rules. The basic evolutionary approach is composed of three parts, that is, initialization step, growth step and mutation step, as in the simulated annealing and genetic algorithm. This algorithm uses the ecological rule that a better cell will live and worse cell should decompose after repeated generations. With this basic concept, a new procedure is developed and a more efficient method is proposed to generate initial solutions. Its effectiveness is shown using test examples.

  • PDF

k-평균 알고리즘을 활용한 음성의 대표 감정 스타일 결정 방법 (Determination of representative emotional style of speech based on k-means algorithm)

  • 오상신;엄세연;장인선;안충현;강홍구
    • 한국음향학회지
    • /
    • 제38권5호
    • /
    • pp.614-620
    • /
    • 2019
  • 본 논문은 전역 스타일 토큰(Global Style Token, GST)을 사용하는 종단 간(end-to-end) 감정 음성 합성 시스템의 성능을 높이기 위해 각 감정의 스타일 벡터를 효과적으로 결정하는 방법을 제안한다. 기존 방법은 각 감정을 표현하기 위해 한 개의 대푯값만을 사용하므로 감정 표현의 풍부함 측면에서 크게 제한된다. 이를 해결하기 위해 본 논문에서는 k-평균 알고리즘을 사용하여 다수의 대표 스타일을 추출하는 방법을 제안한다. 청취 평가를 통해 제안 방법을 이용해 추출한 각 감정의 대표 스타일이 기존 방법에 비해 감정 표현 정도가 뛰어나며, 감정 간의 차이를 명확히 구별할 수 있음을 보였다.

A fast running FIR Filter structure reducing computational complexity

  • Lee, Jae-Kyun;Lee, Chae-Wook
    • 한국정보기술응용학회:학술대회논문집
    • /
    • 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
    • /
    • pp.45-48
    • /
    • 2005
  • In this paper, we propose a new fast running FIR filter structure that improves the convergence speed of adaptive signal processing and reduces the computational complexity. The proposed filter is applied to wavelet based adaptive algorithm. Actually we compared the performance of the proposed algorithm with other algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, We know the proposed algorithm is prefer than the existent algorithm.

  • PDF