• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.285-290
• /
• 2007

In this paper, we presents robust digital redesign (DR) method for observer-based linear time-invariant (LTI) system. The term of DR involves converting an analog controller into an equivalent digital one by considering two condition: state-matching and stability. The design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed the uncertain parts of given observer-based system more precisely, When a sampling period is sufficiently small, the conversion of a analog structured uncertain system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs).

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.2
• /
• pp.333-342
• /
• 2022

Cellular Automata (CA) is a discrete and abstract computational model that is being applied in various fields. Applicable as an excellent pseudo-random sequence generator, CA has recently developed into a basic element of cryptographic systems. Several studies on CA-based stream ciphers have been conducted and it has been observed that the encryption strength increases when the radius of a CA's neighbor is increased when appropriate CA rules are used. In this paper, among CAs that can be applied as a one-dimensional pseudo-random number sequence generator (PRNG), one-dimensional 5-neighbor CAs are classified according to the connection state of their neighbors, and the ignition relationship of the characteristic polynomial is obtained. Also this paper propose a synthesis algorithm for an asymmetric 1-D linear 5-neighbor MLCA in which the radius of the neighbor is increased by 2 using the one-dimensional 3-neighbor 90/150 CA state transition matrix.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.549-555
• /
• 2003

CA is cost-effective to generate pseudorandom patterns than LFSR. Based on the effectiveness of a CA based pseudorandom pattern generator, CA have been employed successfully in several applications. Especially Nongroup CA is applied to efficient hash function generation, cryptography and image compression. In this paper we analyze the properties of TPNCA and by using basic paths in the 0-tree of a linear TPNCA we analyze the structure of the state-transition graph. Also by showing the structure of the complemented CA which have the acyclic state of the 0-tree as the complement vector is isomorphic to the structure of the original TPNCA, we reduce the time in analyzing the CA-states.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.4
• /
• pp.575-584
• /
• 2017

It is suggested the circuit network to analyze the time response of control system. And it is analyzed the interrelation for classical control and modern control by the transfer function and the state equation. Without complicated integration of state transition equation, it is suggested to possible time response by combining the state transition matrix and the transfer function. A source program is coded to display the time response according to the unit-step and the sinusoidal input. Transient response is analyzed in the unit-step input and phase difference between current and voltage is analyzed in sinusoidal input. As writing the suggested contents in transient response or state-space analysis, it is improved the understanding for control engineering and ability for system design.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.68-74
• /
• 1998

This paper deals with a model reduction problem for the linear systems with state delay. After defining the controllability/observability Gramians, the concept of a balanced model for the linear systems with state delay is introduced. Based on solutions of linear matrix inequalities, the model reduction method with guaranteed error bounds is developed. In order to demonstrate the efficacy of teh suggested method, a numerical example is also performed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.144-149
• /
• 2006

This paper deals with a balanced model reduction for uncertain nonlinear systems via T-S fuzzy approach. We define a generalized controllability/observability gramian and obtain a balanced state space model using generalized gramians which can be obtained from solutions of linear matrix inequalities. We present a balanced model reduction scheme by truncating not only state variables but also uncertain elements. An upper bound of the model reduction error will also be suggested. In order to demonstrate the efficacy of our method, a numerical example will be presented.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.383-390
• /
• 2004

This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.67-80
• /
• 2005

In this paper, the primary objective of the research are to review the methods currently avaliable for estimating the delay incurred by vehicles at signalized intersections. The paper compares the delay estimates from a deterministic queueing model, a model based on shock wave theory , the steady-state Webster model, the queue-based models defined in the 1994 and 2001 version of the High way Capacity Manual, in addition to the delays estimated from the TRANSYT-7F macroscopic simulation and NETSIM microscopic simulation. More especially, this paper is to compare the delay estimates obtained using macroscopic and microscopic simulation tools against state-of-the practice analytical models that are derived from deterministic queueing and shock wave analysis theory. The results of the comparisons indicate that all delay models produce relatively similar results for signalized intersections with low traffic demand, but that increasing differences occur as the traffic demand approaches saturation. In particular, when the TRANSYT-7F and NETSIM are compared, it is highly differences as approach for traffic condition to over-saturation. Also, the NETSIM microscopic simulation is the lowest estimates among the various models.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.473-476
• /
• 1989

Quadratic weighting matrices have an effect on the transition and steady state responses in a LQ tracking problem. They are usually decided on trial and error in order to get a good response. In this paper a method is presented which calculates a steady - state deviation without solving Riccati equation. By using this method, a new procedure for selecting the weighting matrices is proposed when a tolerance on the steady - state deviation is given.