QUY TRÌNH KHAI THAÙC DÖÕ LIEÄU

Voõ Löông Hoàng Phöôùc

04.10.07
 Noäi dung
• YÙ nghóa
• Caùc quy trình laáy maãu
• Caùc yeâu caàu cô baûn veà laáy maãu (sampling)
• Phaân tích soá lieäu soá (digital analysis)
2.Caùc quy trình laáy maãu
 ςn −ς
ξn =
σς
N
1
ς=
N
∑ς
n −1
n

( )
1/ 2
⎡ 1 N
2⎤
σς = ⎢ ∑
⎣ N − 1 n −1
ςn −ς ⎥
⎦
we assume that the original wave data {ς n } can be approximated by a polynomial of order K:

K
ς n = ∑ bk (n∆t )
~
k

k =0
A “least squares” fit provides a system of equations for unknown coefficients bk as
(Bendat and Piersol, 1986):

K N N

∑ b ∑ (n∆t ) = ∑ ς n (n∆t )
k +m m
k
k =0 n =1 n =1

m=0,1,2,...,K

2(2 N + 1)∑n =1 ς n − 6 ∑n =1 nς n
N N
K=1
b0 =
N ( N − 1)
12∑n =1 nς n − 6 (N + 1)∑n =1 ς n
N N

b1 =
∆tN (N − 1)( N + 1)
 ^
The corrected time series ς
n

K
ς n (n∆t ) = ς n (n∆t ) − ∑ bk (n∆t )
^
k

k =0