English

Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme

Information Theory 2024-02-01 v1 math.IT

Abstract

In this paper, we investigate the problem of transmitting an analog source to a destination over NN uses of an additive-white-Gaussian-noise (AWGN) channel, where NN is very small (in the order of 10 or even less). The proposed coding scheme is based on representing the source symbol using a novel progressive expansion technique, partitioning the digits of expansion into NN ordered sets, and finally mapping the symbols in each set to a real number by applying the reverse progressive expansion. In the last step, we introduce some gaps between the signal levels to prevent the carry-over of the additive noise from propagation to other levels. This shields the most significant levels of the signal from an additive noise, hitting the signal at a less significant level. The parameters of the progressive expansion and the shielding procedure are opportunistically independent of the \SNR\SNR so that the proposed scheme achieves a distortion DD, where log(D)-\log(D) is within O(loglog(\SNR))O(\log\log(\SNR)) of the optimal performance for all values of \SNR\SNR, leading to a channel-agnostic scheme.

Keywords

Cite

@article{arxiv.2401.17419,
  title  = {Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme},
  author = {Mohammad Ali Maddah-Ali and Soheil Mohajer},
  journal= {arXiv preprint arXiv:2401.17419},
  year   = {2024}
}
R2 v1 2026-06-28T14:32:27.409Z