Metraipolis › archive › dc_8440bbc32600

Computing the entropy rate of a quantized stationary Gaussian process — arXiv:2609.18784

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18784
License (as archived)
CC0-1.0
Archived
2026-10-15T16:14:06.816Z
SHA-256 of the archived text
d7d28973f4a9ac6e6d72363ccb0a4f866b4973950aa115fdbc4401410730c8fd
Stable URL of this page
https://metraipolis.com/documento/dc_8440bbc32600

How to cite

Computing the entropy rate of a quantized stationary Gaussian process — arXiv:2609.18784 — arXiv (en), https://arxiv.org/abs/2609.18784 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8440bbc32600 (Metraipolis archive dc_8440bbc32600, sha256 d7d28973f4a9ac6e6d72363ccb0a4f866b4973950aa115fdbc4401410730c8fd)
BibTeX
@misc{dc8440bbc32600,
  title = {Computing the entropy rate of a quantized stationary Gaussian process — arXiv:2609.18784},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18784},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8440bbc32600; sha256 d7d28973f4a9ac6e6d72363ccb0a4f866b4973950aa115fdbc4401410730c8fd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18784. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider a stationary Gaussian process observed after uniform quantization. The entropy rate of the resulting integer sequence is the fundamental limit on lossless compression of the quantized signal, but it has no closed form, and the classical high-resolution approximation breaks down whenever the spectral density is small or vanishing on part of the band, as happens routinely after smoothing or filtering. Here we present two methods for computing the rate. The first is an analytical approximation obtained by combining an exact dithering identity with the Kolmogorov-Szegő formula; the quantization noise power acts as a floor on the spectral density, so the rate remains finite where the classical formula fails. The second is a Monte Carlo estimate of the exact rate. Its minimum-phase spectral factor represents the process as a finite moving average of Gaussian innovations, making the quantized sequence a hidden Markov process whose optimal (fully adapted) particle filter is available in closed form; by the Shannon-McMillan-Breiman theorem the rate follows from the filter's log-likelihood on a single long sequence. In experiments across six process families, the approximation agrees with the estimate to within a few millibits per sample over most of the parameter range for quantization steps up to the signal standard deviation, including strongly filtered processes on which the classical formula fails; at the most strongly filtered points the discrepancy grows to a few percent of the rate, and for much coarser steps the estimator should be used. We also compare lossless coders against this limit. At a step of one quarter of the standard deviation, linear predictive coding followed by an entropy coder comes within 2 to 4 percent of the entropy rate and FLAC within 3 to 32 percent, whereas five general-purpose compressors on the raw samples remain 12 to 89 percent above it.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.18784 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T15:40:33.223Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).