arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.05199cs.DMcs.ITmath.IT
收藏

模拟信号的在线代码

Online codes for analog signals

Leonard J. Schulman, Piyush Srivastava

摘要:

本文回顾了通信理论中的一个经典场景:尽管有噪声,但要对以规则间隔采样的波形进行编码,以使其重建时的失真最小化。这种转换必须是在线的(因果关系),以实现实时信令;并且不应使用比原始信号更多的功率。我们考虑的噪声模型是标准(离散字母表)汉明权重有界模型的“原子范数”凸松弛:即对抗性$\ell_1$有界。在“块编码”(非因果)设置中,由于$\ell_1$空间中存在大的几乎欧几里德部分,这种编码是可能的,这是Dvoretzky在1961年首次研究的概念。我们的主要结果是,一个类似的结果是可以实现的,甚至因果关系。等价地,我们的工作可以看作是$\ell_1$ Dvoretzky定理的“下三角”版本。在通信方面,保证表示在一定的时间加权范数:时间加权$\ell_2$规范强加给解码器的强制越来越准确的重建遥远的过去的信号,而时间加权$\ell_1$规范的噪声确保消失的干扰从遥远的过去的噪声。编码是线性的(因此易于在模拟硬件中实现)。解码由类似于压缩感测中使用的LP执行。

英文摘要:

This paper revisits a classical scenario in communication theory: a waveform sampled at regular intervals is to be encoded so as to minimize distortion in its reconstruction, despite noise. This transformation must be online (causal), to enable real-time signaling; and should use no more power than the original signal. The noise model we consider is an "atomic norm" convex relaxation of the standard (discrete alphabet) Hamming-weight-bounded model: namely, adversarial $\ell_1$-bounded. In the "block coding" (noncausal) setting, such encoding is possible due to the existence of large almost-Euclidean sections in $\ell_1$ spaces, a notion first studied in the work of Dvoretzky in 1961. Our main result is that an analogous result is achievable even causally. Equivalently, our work may be seen as a "lower triangular" version of $\ell_1$ Dvoretzky theorems. In terms of communication, the guarantees are expressed in terms of certain time-weighted norms: the time-weighted $\ell_2$ norm imposed on the decoder forces increasingly accurate reconstruction of the distant past signal, while the time-weighted $\ell_1$ norm on the noise ensures vanishing interference from distant past noise. Encoding is linear (hence easy to implement in analog hardware). Decoding is performed by an LP analogous to those used in compressed sensing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑