• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.574-580
• /
• 2015

The stability condition of linear discrete interval systems with a time-varying delay time is considered. The considered system has interval system matrices for both non-delayed and delayed states with time-varying delay time within given interval values. The proposed condition is derived by using Lyapunov stability theory and expressed by very simple inequality. Compared to previous results, the stability issue on the interval systems is expanded to time-varying delay. Furthermore, the new condition can imply the existing results on the time-invariant case and show the relation between interval time-varying delay time and stability of the system. The proposed condition can be applied to find the stability bound of the discrete interval system. Some numerical examples are given to show the effectiveness of the new condition and comparisons with the previously reported results are also presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• Journal of Navigation and Port Research
• /
• v.36 no.8
• /
• pp.637-641
• /
• 2012

In this paper, the method that reduce a computation time by optimizing computation process is proposed to realize low-power underwater acoustic communication system. At first, dependency of decision delay on tap length of linear equalizer was investigated. Variance is calculated based on this result, and the optimal decision delay bound is estimated. In addition to decide optimal tap length with decision delay, we extracted the MSE(Mean Square Error) graph. From the graph, we obtained variance value of the MSE-decision delay, and estimated the optimum decision delay range from the variance value. Also, using the extracted optimal parameters, we performed a simulation. According to the result, the simulation employing optimal tap length, which is only 40% of maximum tap length, showed a satisfactory performance comparable to simulation employing maximum tap length. We verified that the proposed method has 33% lower tap length than maximal tap length via sea trial.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.459-462
• /
• 2004

In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. A a reducing power consumption of a scheduling for module selection under the time constraint execute scheduling and allocation for considering the switching activity. The focus scheduling of this phase adopt Force-Directed Scheduling for low power to existed Force-Directed Scheduling. and it constructs the module selection RT library by in account consideration the mutual correlation of parameters in which the power and the area and delay. when it is, in this paper we formulate the module selection method as a multi-objective optimization and propose a branch and bound approach to explore the large design space of module selection. Therefore, the optimal module selection method proposed to consider power, area, delay parameter at the same time. The comparison experiment analyzed a point of difference between the existed FDS algorithm and a new FDS_RPC algorithm.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.34-39
• /
• 2015

In opportunistic networks, it is difficult to predict when a node encounters others and how long it keeps in contact with another. Nodes continually attempt to explore neighbor nodes in the vicinity to transmit data. In battery-operated devices, this persistent exploration consumes a great deal of energy. In this paper, we propose an optimal energy-efficient neighbor discovery scheme (OPEED) that guarantees neighbor discovery within a delay bound. Through performance evaluation, we show that the OPEED scheme consumes 33%-83% less energy than other schemes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.9
• /
• pp.1648-1654
• /
• 2007

In this paper, we consider the design of $H_\infty$ high-gain state feedback control for time-delayed linear systems with limited actuator capacities. The high-gain control means that the control permits the predetermined degree of saturation. Based on new Lyapunov-Krasovskii functional, we derive a result in the form of matrix inequalities. The matrix inequalities are consisted of LMIs those confirm the positive definiteness of Lyapunov- Krasovskii functional, satisfaction of predetermined degree of saturation, reachable set and $L_2$ gain constraint. The result is dependent on the bound of time-delay and its rate, predetermined degree of saturation, actuator capacity, and the allowed size of disturbances. Finally, we give a numerical example to show the effectiveness and usefulness of our result.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.458-465
• /
• 2008

In this paper, we propose a non-fragile guaranteed cost controller design method for uncertain linear systems with constant delyas in state. The norm bounded and time-varying uncertainties are subjected to system and controller design matrices. A quadratic cost function is considered as the performance measure for the system. Based on the Lyapunov method, an LMI(Linear Matrix Inequality) optimization problem is established to design the controller which uses information of delayed state and minimizes the upper bound of the quadratic cost function for all admissible system uncertainties and controller gain variations. Numerical examples show the effectiveness of the proposed method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.1-6
• /
• 2004

This paper deals with a balanced model reduction for T-S(Takagi-Sugeno) fuzzy systems with time varying state delay. We define a generalized controllability gramian and a generalized observability gramian for a stable T-S fuzzy delayed systems. We obtain a balanced state space realization using the generalized controllability and observability gramian and obtain a reduced model by truncating states from the balanced state space realization. We also present an upper bound of the approximation error. The generalized controllability gramian and observability gramian can be computed from solutions of linear matrix inequalities. We demonstrate the efficacy of the suggested method by illustrating a numerical example.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.7
• /
• pp.578-583
• /
• 2002

This paper presents a method for designing fuzzy $H_2/H_{\infty}$ controllers of nonlinear systems with time varying delay. Takagi-Sugeno fuzzy model is employed to represent nonlinear systems with time varying delay. Using a single quadratic Lyapunov function, the globally exponential stability and $H_2/H_{\infty}$ performance problem are discussed. A sufficient condition for the existence of fuzzy $H_2/H_{\infty}$ controllers is then presented in terms of linear matrix inequalities(LMls). The proposed fuzzy $H_2/H_{\infty}$ controllers minimizes the upper bound on the linear quadratic performance measure.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.383-390
• /
• 2008

Clock skew modeling is important in the performance evaluation and prediction of clock distribution network and it is one of the major constraints for high-speed operation of synchronous integrated circuits. In clock routing synthesis, it is necessary to reduce the clock skew under the specified skew bound, while minimizing the cost such as total wire length and delay. In this paper, a new efficient bounded clock skew routing method is described, which generalizes the well-known bounded skew tree method by allowing loops, i.e., link-edges can be inserted to a clock tree when they are beneficial to reduce the clock skew and/or the wire length. Furthermore, routing topology construction and wire sizing is used to reduce clock delay.