• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.5
• /
• pp.22-28
• /
• 2009

In this paper, we consider the problem of $H_{\infty}$ filtering for continuous-time singular systems with multiple state-delays. The aim of designed filter is to guarantee regularity, impulse-free, asymptotic stability and $H_{\infty}$ norm bound of filtering error singular system. By establishing a finite sum inequality based on quadratic terms, a new delay-dependent BRL (bounded real lemma) for singular systems with multiple state-delays is derived. Based on the result, the existence condition of $H_{\infty}$ filter and filter design method are proposed in terms of LMI (linear matrix inequality). Finally, a numerical example is provided to show the validity of the design methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.435-444
• /
• 2002

In this paper, a novel packet scheduling algorithm, so-called the CSL algorithm is discussed, whereby the firewall property as well as the deterministic delay bound guarantee are supported in session level. Lots of simulation studies validate those properties of the CSL algorithm. The CSL algorithm is distingushable from the well- known EDD scheme in terms of the firewall property. Regarding the implementation complexity, the CSL algorithm turns out to be of 0(1) besides the sorting overhead. Owing to the maintained generic fair queueing structure in the CSL algorithm, a various fair queueing schemes can be applied with minor modification. For the TCP/IP network which is vulnerable to the misbehaving traffic sources, the firewall property of the CSL algorithm is quite useful for the advanced quality of services.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.197-207
• /
• 2006

When the latency of a flow in a fair packet scheduler, which is determined by its rate, violates its required delay bound, the scheduler should reduce the latency with even raising the rate being reserved for the flow. The excessively reserved rate win enforce some outgoing link bandwidth be lost. This loss can not be, unfortunately, evaluated by the three metrics of latency, fairness and implementation complexity used in previous works. This paper is aimed to first introduce the metric of bandwidth utilization to investigate the bandwidth loss in a scheduler and then evaluate the timestamp based schedulers in terms of the bandwidth and payload utilizations. The results show that the bandwidth utilization increases with loosing the required delay bound and, in particular, schedulers with the latency property of WFQ have much better payload utilization by up to 50% than that in the SCFQ one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.78-101
• /
• 2017

High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1009-1012
• /
• 1998

An efficient algorithm for clock skew optimization is proposed in this paper. It construct a new clock routing topology which is the generalized graph model while previous methods uses tree-structured routing topology. Edge-insertion technique is used in order to reduce the clock skew. A link-edge is inserted repeatedly between two sinks whose delay difference is large and the distance is small. As a result, the delay of a sink which has the longer delay is decreased and the clock skew is reduced. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the total wire length minimization under the given skew bound.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.8
• /
• pp.1464-1470
• /
• 2010

In this paper, we consider the $H_{\infty}$ control of time-delayed linear systems with saturating actuators. The considered time-delay is a time-varying one having bounds on magnitude and time-derivative, and the control permits the predetermined degree of saturation. Based on two modified Lyapunov-Krasovskii(L-K) functionals, we derive a $H_{\infty}$ control in the form of linear matrix inequalities(LMI) having three non-convex design parameters. The result is dependent on the characteristics of time-delay, predetermined degree of saturation level, and bound of disturbance. Finally, we give a comparative example to show the effectiveness and usefulness of our result.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.5
• /
• pp.806-811
• /
• 2017

This paper considers the delay-dependent stability of linear systems with a time-varying delay in the frame work of Lyapunov-Krasovskii functional(LKF) approach. In this approach, an integral inequality is essential to estimate the upper bound of time-derivative of LKF, and a less conservative one is needed to get a less conservative stability result. In this paper, based on free weighting matrices, an improved integral inequality encompassing well-known results is proposed and then a stability result in the form of linear matrix inequality is derived based on an augmented LKF. Finally, two well-known numerical examples are given to demonstrate the usefulness of the proposed result.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.139-145
• /
• 2001

In this paper, we consider the H$_2$(or guaranteed cost control) and H$_{\infty}$ controller design methods for singular(or descriptor) systems with input time delay. Also, a mixed H$_2$and H$_{\infty}$ controller design algorithm is treated by combination of the proposed H$_2$and H$_{\infty}$ controller design method. The sufficient conditions for the existence of controllers and controller design methods are introduced at each Lemma and Theorem. Furthermore, we present optimization problems to get the upper bound of performance measures. The proposed methods are checked by examples.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.106-112
• /
• 1999

This paper presents an H$\infty$ controller design method for linear systems with time-varying delayed states, inputs, and measurement outputs. Using a Lyapounov unctional , the stability for delay systems is discussed independently of time delays . And a sufficient condition for the existence of H$\infty$ controllers of n-th order is given in terms of three matrix inequalities. Based on the positive-definite solutions of their matrix inequalities, we briefly explain how to construct H$\infty$ construct H$\infty$ controller, which stabilizes time-delay systems independently of delays and guarantees an H$\infty$ norm bound.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.4
• /
• pp.324-329
• /
• 2002

In this paper, the guaranteed cost filtering design method for linear time delay systems with convex bounded uncertainties in discrete-time case is presented. The uncertain parameters are assumed to be unknown but belonging to known convex compact set of polytotype less conservative than norm bounded parameter uncertainty. The main purpose is to design a stable filter which minimizes the guaranteed cost. The sufficient condition for the existence of filter, the guaranteed cost filter design method, and the upper bound of the guaranteed cost are proposed. Since the proposed sufficient conditions are LMI(linear matrix inequality) forms in terms of all finding variables, all solutions can be obtained simultaneously by means of powerful convex programming tools with global convergence assured. Finally, a numerical example is given to check the validity of the proposed method.