›› 2016, Vol. 42 ›› Issue (2): 43-48.doi: 10.3969/j.issn.1674-1579.2016.02.008

Previous Articles     Next Articles

Robustness of an CPFODTBased Algorithm for RealTime Data Processing

 LIANG  Hong   

  1. People’s Liberation Army Unit 91550, Dalian 116023,China
  • Online:2016-04-23 Published:2016-04-28

Abstract: Abstract:To improve the precision in calculation and state prediction of realtime data near the endpoints of measurement sequence, the cubicpolynomial firstorderderivativetheorem (CPFODT) is put forward and proved, and a new algorithm based on CPFODT is researched for calculating the first order derivative of realtime data. How the sampling length, measure error bounds and sampling interval affect the results is shown by simulation calculation. The errors are analyzed, and some basic principles of parameter selection are given. Verification of the algorithm is made by measurement, and the results indicate that it is very robust and reliable. Not only can this algorithm improve the precision in calculation and state prediction of realtime data near the endpoints of measurement sequence, but also some interpolation algorithms can derive from it. So, it can provide high accurate data.

Key words: Keywords: cubic polynomial, firstorder derivative, realtime data processing, robustness

CLC Number: 

  • V557