Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Kalman Filtering Solution Converges on a Personal Computer

    https://doi.org/10.1142/S0218126617500050Cited by:0 (Source: Crossref)

    Instantaneous observability is used to watch a system output with very fast signals as well as it is a system property that enables to estimate system internal states. This property depends on the pair of discrete matrices {A(k),C(k)} and it considers that the system state equations are known. The problem is that the system states are inside and they are not always accessible directly. A process, which is a time-varying running program in four parts composes the system under investigation here. It is shown it is possible to apply Kalman filtering on a digital personal computer’s system with particularly the four parts like the ones under investigation. A computing process is performed during a period of time called latency. The calculation of latency considers it as a random variable with Gaussian distribution. The potential application of the results attained is the forecasting of data traffic-jam on a digital personal computer, which has very fast signals inside. In a broader perspective, this method to calculate latency can be applied on other digital personal computer processes such as processes on random access memory. It is also possible to apply this method on local area networks and mainframes.

    This paper was recommended by Regional Editor Emre Salman.