Exactness conjecture for the continuous-time zero-delay rate bound

Let R(D)R^*(D) denote the infimum mutual-information rate over generalized causal reproductions GCR\mathsf{GCR} whose long-term distortion is at most DD, and let R(D)R(D) denote the rate function obtained from the continuous-time linear Gaussian sensor optimization. The paper establishes R(D)R(D)R^*(D)\leq R(D) for every D>0D>0. Exactness conjecture. The lower bound is attained for every positive distortion level:

R(D)=R(D),;D>0.R^*(D)=R(D), \\; D>0.

This would identify the semidefinite-representable function R(D)R(D) with the fundamental performance limitation associated with continuous-time zero-delay source coding. The conjecture is motivated by corresponding discrete-time results, while the text does not report a proof or disproof.

Sources & referencesView supporting material

Primary source

Takashi Tanaka, Mikael Skoglund and Valeri Ugrinovskii, “Optimal Sensor Design and Zero-Delay Source Coding for Continuous-Time Vector Gauss-Markov Processes”, arXiv:1709.03026 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.