ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LkL_k be the filter matrix, and let AA, CC, and HH be the system matrices appearing in the unbiasedness condition. For a delay rr, suppose that LkL_k must satisfy

Lk[CArHCAr−1H\hdotsCH]=[H0\hdots0].L_k\begin{bmatrix}CA^{r}H & CA^{r-1}H & \hdots & CH\end{bmatrix}=\begin{bmatrix}H & 0 & \hdots & 0\end{bmatrix}.

Uniqueness of the unbiased delay. The filter will be unbiased for only one value of the delay rr; equivalently, there exists only one value of rr satisfying the displayed condition.

The claim concerns the existence and maximum allowable delay of the recursive filter. The surrounding argument shows that the delay cannot be arbitrary and must be smaller than the system order, while its lower bound is determined by the first full-rank Markov parameter; the uniqueness assertion is not established by the supplied context.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.