• Title/Summary/Keyword: State Update Interval

Search Result 4, Processing Time 0.02 seconds

Combination of Two Affine Projection Algorithm Filters with Different Update Interval based on Independent Adaptation (독립적 적응을 기반으로 한 업데이트 간격이 다른 Affine Projection 알고리즘 필터의 조합)

  • Kim, Kwang-Hoon;Choi, Young-Seok;Song, Woo-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.895-896
    • /
    • 2008
  • We propose a adaptive combination of affine projection algorithm (APA) filters with different update interval. Two APA filters with different update interval are adapted independently in order to keep the advantages of both component filters. This novel scheme provides improvement of performance in term of the convergence rate and the steady-state error. Experimental results show good properties of the proposed algorithm.

  • PDF

Optimized Medium Access Probability for Networked Control Systems (네트워크 제어 시스템을 위한 최적화된 매체 접근 확률)

  • Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2457-2464
    • /
    • 2015
  • Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.

Performance Analysis of Cal1 Arrival History-Based Location Update Algorithm (호도착기록에 기반한 위치갱신 알고리즘의 성능 분석)

  • Lee, Jong-Min;Kwon, Bo-seob;Maeng, Seung-Ryoul
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.381-388
    • /
    • 2003
  • Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.

Multi-States Based Hybrid Location Update Strategy in Wireless Communication System (이동 통신망에서의 다중 상태 기반의 혼합형 위치 갱신 방법)

  • Lee, Goo-Yeon;Lee, Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.1
    • /
    • pp.113-122
    • /
    • 2007
  • In this paper, we propose a multi-state based hybrid location update scheme, which integrates the time-based and the movement-based methods. In the proposed scheme, a mobile terminal updates its location after n cell boundary crossing and a time interval of T[sec]. We derive an analytical solution for the performance of the hybrid scheme with exponential cell resident time and evaluate it numerically with time-varying random walk mobility model, which we model as multi-states Markov chain. Furthermore, we also evaluate the scheme for arbitrary cell resident times by simulation. From the numerical analysis and the simulation results, we prove that the proposed scheme significantly outperforms the time-based and the movement-based methods, when implemented alone, more accurately adapting to the time-varying user mobility.