• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.1-4
• /
• 1984

The design of a system for the synthesis of one frequency from another is discussed in terms of mathematical methods of approximating real number. A revised design algorithm is derived and it is shown.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.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.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.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.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.1007-1019
• /
• 2006

In this paper, the synthesis method of multibeam radiation pattern with multi-directional beams and nulls is proposed. Genetic algorithm is applied for the optimization of amplitude and phase of the feeding signal into each element that is structured in planar array of single patch antenna with an arbitrary field distribution. To verify the validity of the proposed method, $2{\times}2$ planar array antenna is used for the measurement and the measured far field radiation pattern is compared with the simulation result. As a result, the synthesis of multibeam radiation pattern is implemented by the optimization of amplitude and phase of the feeding signal into each element of $8{\times}8$ planar array antenna system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.250-259
• /
• 2012

This paper compared and investigated the choice of optimal algorithm affects on the directivity synthesis of linear array in the satisfaction to the design specification of the desired directivity, convergence characteristic, and adaptability. Optimal algorithms use a quasi-Newton method(DFP and BFGS method) for realizing the desired directivity, used a quasi-ideal beam, steering beam, and a multi-beam, chosen as desired directivity. In the numerical result, this paper verified the effectiveness of the quasi-Newton method to the directivity synthesis, and offered a solving approach of occurred problems in the numerical simulation process.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.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.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.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.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.5
• /
• pp.614-620
• /
• 2019

In this paper, we propose a method to effectively determine the representative style embedding of each emotion class to improve the global style token-based end-to-end speech synthesis system. The emotion expressiveness of conventional approach was limited because it utilized only one style representative per each emotion. We overcome the problem by extracting multiple number of representatives per each emotion using a k-means clustering algorithm. Through the results of listening tests, it is proved that the proposed method clearly express each emotion while distinguishing one emotion from others.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• 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.