Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1501.07132 v1 pith:VJ37Z2NQ submitted 2015-01-27 cs.SY cs.SY

On Kalman-Like Finite Impulse Response Filters

classification cs.SY cs.SY
keywords filterfiltersfiniteimpulsekalman-likeresponserevelationufir
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This note reveals an explicit relationship between two representative finite impulse response (FIR) filters, i.e. the newly derived and popularized Kalman-Like unbiased FIR filter (UFIR) and the receding horizon Kalman FIR filter (RHKF). It is pointed out that the only difference of the two algorithms lies in the noise statistics ignorance and appropriate initial condition construction strategy in UFIR. The revelation can benefit the performance improvement of one by drawing lessons from the other. Some interesting conclusions have also been drawn and discussed from this revelation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.