›› 2016, Vol. 42 ›› Issue (2): 43-48.doi: 10.3969/j.issn.1674-1579.2016.02.008
Previous Articles Next Articles
LIANG Hong
Online:
Published:
Abstract: Abstract:To improve the precision in calculation and state prediction of realtime data near the endpoints of measurement sequence, the cubicpolynomial firstorderderivativetheorem (CPFODT) is put forward and proved, and a new algorithm based on CPFODT is researched for calculating the first order derivative of realtime 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 realtime 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, firstorder derivative, realtime data processing, robustness
CLC Number:
LIANG Hong. Robustness of an CPFODTBased Algorithm for RealTime Data Processing[J]., 2016, 42(2): 43-48.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://journal01.magtech.org.cn/Jwk3_kjkzjs/EN/10.3969/j.issn.1674-1579.2016.02.008
http://journal01.magtech.org.cn/Jwk3_kjkzjs/EN/Y2016/V42/I2/43
Cited