Skip to main content

Table 1 Iterative p -shift Kalman-like UFIR filtering algorithm

From: Optimal and unbiased FIR filtering in discrete time state space with smoothing and predictive properties

Stage

 

Given:

K, N, p, l = α, …, n, s = α − 1

 

α = max(m + K, m + 2, m + 2 − p),

Set:

ϒ= ( C s m T C s m ) 1

 

F s = A s m + p ϒ A s m + p T

 

x ̄ s | s p = A s m + p ϒ C s m T Y s p , m p

Update:

F l = [ C T C + ( A F l 1 A T ) 1 ] 1

 

x ̄ l | l p =A x ̄ l 1 | l p 1

 

+ A p F l C T ( y l p C A 1 p x ̄ l 1 | l p 1 )

Remark:

Use x ̄ l | l p as the output when l = n