• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.139-139
• /
• 1989

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.326-330
• /
• 1998

There have been several recent studies concerning the stability of fuzzy control systems and the synthesis of stabilizing fuzzy controller. This paper reports on a related study of the TS(Takagi-Sugeno) fuzzy systems, and it is shown that the controller synthesis problems for the nonlinear systems described by the TS fuzzy model can be reduced to convex problems involving LMIs(Linear matrix inequalities). After classifying the TS fuzzy systems into two families based on how diverse their input matrices are, different controller synthesis procedure is given for each of these families. A numerical example is presented to illustrate the synthesis procedures developed in this paper.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5744-5749
• /
• 2014

An extraction technique for a common logic expression is an extremely important part of multiple-output logic synthesis. This paper presents a new Boolean extraction technique using an exclusive-OR logic synthesis principle. The logic circuits produced only have AND, OR and NOT gates. Heuristic methods can also be applied to reduce the execution time and the number of literals. The experimental results showed improvements in the literal counts over the previous methods.

• Journal of Multimedia Information System
• /
• v.2 no.3
• /
• pp.263-274
• /
• 2015

The subject of this work is the complex discrete systems simulation special features with the aid of dynamic graph models. The proposed simulation technique allows to determine the ways for tasks solutions in terms of discrete systems analysis and synthesis of various complication: one-dimensional and multidimensional, steady and unstable, with the pulse elements abnormal operating mode and others. Often complex control systems analysis and synthesis task solutions, via classical approach comes out to be insolvent, because of the computational problems. The application of graph models allows to perform clear and strict characterization and computer procedures automation. The optimal controls synthesis algorithm presented in this paper, transferring the discrete system from target initial state to target final state within the minimum time, allows to consider the zero initial conditions systems, with the initial potential energy, with the control actions limitations and complex pulse elements operating mode.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.8
• /
• pp.649-654
• /
• 2002

The essential philosophy of the QFT(Quantitative Feedback Theory) is that a suitable controller can be found by loop shaping a nominal loop transfer function such that the frequency response of this function does not violate the QFT bounds. The loop shaping synthesis involves the identification of a structure and its specialization by means of the parameter optimization. This paper presents an optimization algorithm to estimate the controller parameters from the frequency transfer function synthesis using the TLS(Total Least Squares) in the QFT loop shaping procedure. The proposed method identifies the parameter vector of the robust controller from an overdetermined linear system developed from rearranging the two dimensional system matrices and output vectors obtained from the QFT bounds. The feasibility of the suggested algorithm is illustrated with an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.566-570
• /
• 2005

A digital controller for nonlinear time-delay system is proposed in this paper. A nonlinear time-delay system is discretized by using Taylor's discretization method. And the discretized system can be converted to a general nonlinear system. For this reason, general nonlinear controller synthesis can be applied to the discretized time-delay system. We adopted MAC controller synthesis for this study. Computer simulations are conducted to verify the performance of the proposed method. The results of simulation show good performance of the proposed controller synthesis and the proposed method is useful to control nonlinear time-delay system easily.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.216-221
• /
• 2004

This paper describes an optimal synthesis method of binary neural network for pattern recognition. Our objective is to minimize the number of connections and the number of neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm (NETLA) for the multilayered neural networks. The synthesis method in NETLA uses the Expanded Sum of Product (ESP) of the boolean expressions and is based on the multilayer perceptron. It has an ability to optimize a given binary neural network in the binary space without any iterative learning as the conventional Error Back Propagation (EBP) algorithm. Furthermore, NETLA can reduce the number of the required neurons in hidden layer and the number of connections. Therefore, this learning algorithm can speed up training for the pattern recognition problems. The superiority of NETLA to other learning algorithms is demonstrated by an practical application to the approximation problem of a circular region.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.587-589
• /
• 1997

In this paper we design the model following ${\mu}$-synthesis control system for optimal fuel-injection of diesel engine using genetic algorithms. To do this, we give gain and dynamics parameters to the weighting functions and apply genetic algorithms with reference model to the optimal determination of weighting functions that are given by D-K iteration method which can design ${\mu}$-synthesis controller in the state space. These weighting functions are optimized simultaneously in the search domain selected adequately. The effectiveness of this ${\mu}$-synthesis control system for fuel-injection is verified by computer simulation.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1739-1748
• /
• 2008

When we conduct a data mining procedure on sample data sources, several rules are generated. But some rules are redundant or logically disjoint and therefore they can be removed. We suggest a new rule minimization algorithm inspired from logic synthesis to improve comprehensibility and eliminate redundant rules. The method can merge several relevant rules into one based on data mining and logic synthesis without high loss of accuracy. In case of two or more rules are candidates to be merged, we merge the rules with the attribute having the lowest information gain. To show the proposed method could be a reasonable solution, we applied the proposed approach to a problem domain constructing user preferred ontology in anti-spam systems.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.223-230
• /
• 2002

In a speech coding system using excitation source of voiced and unvoiced, it would be involves a distortion of speech waveform in case coexist with a voiced and an unvoiced consonants in a frame. This paper present a new method of TSIUVC (Transition Segment Including Unvoiced Consonant) approximate-synthesis by using Least Mean Square. The TSIUVC extraction is based on a zero crossing rate and IPP (Individual Pitch Pulses) extraction algorithm using residual signal of FIR-STREAK Digital Filter. As a result, This method obtain a high Quality approximation-synthesis waveform by using Least Mean Square. The important thing is that the frequency signals in a maximum error signal can be made with low distortion approximation-synthesis waveform. This method has the capability of being applied to a new speech coding of Voiced/Silence/TSIUVC, speech analysis and speech synthesis.