Abstract:We study communication with noiseless feedback over Gaussian channels with stationary autoregressive noise of arbitrary finite order. We introduce a class of Gaussian feedback coding schemes, called SK(2), in which the message process follows a second-order deterministic recursion, and derive a closed-form characterization of its maximal achievable rate under an average-power constraint. As a first-order benchmark, we formulate the SK(1) scheme and show that it provides the branch-complete and sign-consistent reformulation of Butman's equal-energy linear-feedback construction. The SK(2) coding scheme achieves feedback capacity for the additive white Gaussian noise channel and stationary AR(1) Gaussian channels. For certain stationary AR(2) Gaussian channels, genuinely second-order SK(2) scheme strictly outperforms SK(1); for the subclass obtained by interleaving two independent AR(1) noise processes, SK(2) also achieves feedback capacity. These results show that first-order SK/Butman coding scheme is not universally optimal beyond first-order autoregressive noise and disprove the corrected form of Butman's conjecture.
From: Jun Su [view email]
[v1]
Wed, 14 Jan 2026 10:04:54 UTC (967 KB)
[v2]
Mon, 23 Feb 2026 13:36:51 UTC (939 KB)
[v3]
Wed, 26 Aug 2026 10:34:11 UTC (951 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。