• 제목/요약/키워드: delay bound

검색결과 194건 처리시간 0.025초

다중 상태 시간지연을 가지는 연속시간 특이시스템의 지연종속 $H_{\infty}$ 필터링 (Delay-dependent $H_{\infty}$ filtering for continuous-time singular systems with multiple state-delays)

  • 김종해
    • 전자공학회논문지SC
    • /
    • 제46권5호
    • /
    • pp.22-28
    • /
    • 2009
  • 본 논문에서는 다중 상태 시변 시간지연을 가지는 연속시간 특이시스템의 $H_{\infty}$ 필터링 문제를 다룬다. 제안하는 필터의 목적은 필터링 오차 특이시스템(filtering error singular system)이 정규성, 임펄스 프리, 점근적 안정성 및 $H_{\infty}$ 노옴 유계(bound)를 만족하는 선형 필터를 설계하는 것이다. 먼저, 다중 상태 시변 시간지연을 가지는 특이시스템에 대한 새로운 지연종속 유계실수정리(bounded real lemma)를 자승 요소를 기초로 하는 유한 합 부등식(finite sum inequality)을 이용하여 제안하고, 이로부터 $H_{\infty}$ 필터가 존재할 조건과 필터의 설계기법을 최적화가 가능한 선형행렬부등식(linear matrix inequality)으로 제시한다. 마지막으로 예제를 통하여 제안한 필터 설계 알고리듬의 타당성을 확인한다.

지연의 상한 보장과 안정성을 고려한 패킷 스케쥴링 알고리즘 (Packet scheduling algorithm for guaranteed bound and firewall property of delay performance)

  • 정대인
    • 한국통신학회논문지
    • /
    • 제27권5C호
    • /
    • pp.435-444
    • /
    • 2002
  • 본 논문에서는, 세션별 결정적 지연품질의 보장이 주어짐과 동시에, 세션간 서비스품질의 안정성이 지원되는 패킷 스케쥴링 알고리즘인 "클래스별 서비스 차등제공" (CSL: Class level Service Lagging) 알고리즘[6]에 대하여, 시뮬레이션을 통한 기능 검증과, 실질적 구현에 관련된 이슈를 분석하였다. 서비스품질의 안정성 면에서 CSL알고리즘과 EDD(Earliest Due Date) 방식과의 차별성을 확인하였다. 구현의 복잡성에 대한 검토에서, CSL알고리즘은 sorting을 제외하고는, 0(1)의 복잡성을 갖도록 구현될 수 있음을 보였다. 공평큐잉의 기본 골격이 유지됨으로써, 다양한 형태의 공평큐잉 구현에 쉽게 적용될 수 있는 점은 CSL알고리즘이 갖는 주요 특징이다. TCP/IP 네트워크에서와 같이, 사용자의 의지에 의존하는 TCP 혼잡제어의 환경에서, 세션간 서비스품질의 안정성 보장은 필수적이며, 이러한 측면에서 CSL알고리즘이 갖는 적합성을 확인하였다.합성을 확인하였다.

대역폭 이용도 측면에서 공정 패킷 스케줄러의 성능 분석 (Performance Analysis of Fair Packet Schedulers in Bandwidth Utilization)

  • 안효범;김태준
    • 한국멀티미디어학회논문지
    • /
    • 제9권2호
    • /
    • pp.197-207
    • /
    • 2006
  • 공정 패킷 스케줄러에서 트래픽 흐름의 속도에 의해 결정되는 최대전달지연이 그 흐름의 요구 지연규격을 위반할 경우 예약속도를 높여서 이를 줄여야 한다. 이러한 과잉예약의 결과로 전송대역폭이 손실되나, 이전연구에서 사용되었던 레이턴시, 공정성 및 구현복잡성의 세가지 성능지표로는 손실대역폭을 평가할 수 없다. 본 논문에서는 스케줄링 서버 자원의 손실특성을 평가할 수 있는 대역폭 이용도 지표를 제안하고, 대역폭 및 페이로드(payload) 이용도 측면에서 공정 패킷 스케줄러의 성능을 분석 및 평가하였다. 평가결과 요구 지연규격이 느슨할수록 높은 페이로드 이용도를 얻을 수 있었고, 특히 WFQ급 레이턴시를 갖는 스케줄러의 페이로드 이용도가 SCFQ에 비해 50%까지 개선됨을 발견할 수 있었다.

  • PDF

Phase Switching Mechanism for WiFi-based Long Distance Networks in Industrial Real-Time Applications

  • Wang, Jintao;Jin, Xi;Zeng, Peng;Wang, Zhaowei;Wan, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권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.

연결-에지 추가 기법을 이용한 클락 스큐 최적화 (Clock Skew Optimization Using Link-Edge Insertion)

  • 정공옥;류광기신현철정정화
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • 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.

  • PDF

포화 구동기를 갖는 시간 시연 선형 시스템의 H 제어 (H Control of Time-Delayed Linear Systems with Saturating Actuators)

  • 송용희;김진훈
    • 전기학회논문지
    • /
    • 제59권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.

개선된 적분부등식을 이용한 시간지연 선형 시스템의 안정성 (Stability of Time-delayed Linear Systems using an Improved Integral Inequality)

  • 김진훈
    • 전기학회논문지
    • /
    • 제66권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.

Development of Mixed $H_2$/$H_{\infty}$ Controller Design Algorithms for Singular Systems with Time Delay

  • Kim, Jong-Hae
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제3권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.

  • PDF

H$\infty$ Control for Linear Systems with Time-Varying Delayed States, Control Inputs, and Measurement Outputs

  • Jeung, Eun-Tae;Kwon, Sung-Ha;Kim, Jong-Hae;Park, Hong-Bae
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제1권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.

  • PDF

Discrete-Time Robust Guaranteed Cost Filtering for Convex Bounded Uncertain Systems With Time Delay

  • Kim, Jong-Hae
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제4권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.