Finite-Blocklength Lossy Joint Source-Channel Coding over Unknown Channels
未知信道上的有限分组长度有损联合源信道编码
Adeel Mahmood, Harish Viswanathan, Jinfeng Du
AI总结 针对未知信道,提出基于失配设计的联合源信道编码可达性结果,并证明在块擦除信道上无性能损失,进而构造了二阶通用码族。
详情
我们在未知信道框架下分析了有损联合源信道编码(JSCC)的有限分组长度性能,其中真实信道未知但源分布已知。我们建立了失配设计JSCC的可达性结果,其中代码设计基于信道$Q_{Y|X}$,但部署在另一信道$P_{Y|X}$上。我们的失配设计可达性结果允许非平稳信道律和源、再现、信道输入和信道输出的任意标准Borel字母表。可达性界由率失真和率色散函数以及两个信道相关量(我们称为失配设计率和失配设计率色散)给出。对于块擦除信道,我们的结果表明信道失配不会导致性能损失。然后,我们在块擦除信道集合上展示了二阶通用源信道码族。我们的码构造使用适当条件概率测度的泊松函数表示来产生编码器和解码器输出。我们使用参数化的吉布斯后验族作为解码器侧核,其包络恢复了广义互信息。
We analyze the finite-blocklength performance of lossy joint source-channel codes (JSCC) in an unknown-channel framework, where the true channel is unknown but the source distribution is known. We establish achievability results for mismatched-design JSCC, where the code design is based on a channel $Q_{Y|X}$ but deployed over a different channel $P_{Y|X}$. Our mismatched-design achievability result allows nonstationary channel laws and arbitrary standard Borel alphabets for the source, reproduction, channel input and channel output. The achievability bound is given in terms of the rate-distortion and rate-dispersion functions, as well as two channel-dependent quantities that we call the mismatched-design rate and mismatched-design rate-dispersion. For block erasure channels, our result shows that channel mismatch incurs no penalty. We then show a second-order universal family of source-channel codes over the set of block erasure channels. Our code construction uses Poisson functional representations of suitable conditional probability measures to produce the encoder and decoder outputs. We use a parameterized family of Gibbs posteriors as the decoder-side kernels, whose envelope recovers the generalized mutual information.