Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme (2401.17419v1)

Published 30 Jan 2024 in cs.IT and math.IT

Abstract: In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ 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 $N$ 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$ so that the proposed scheme achieves a distortion $D$, where $-\log(D)$ is within $O(\log\log(\SNR))$ of the optimal performance for all values of $\SNR$, leading to a channel-agnostic scheme.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. V. Kostina and S. Verdú, “Lossy joint source-channel coding in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2545–2575, 2013.
  2. Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, 2010.
  3. G. Caire, N. Jindal, M. Kobayashi, and N. Ravindran, “Multiuser MIMO achievable rates with downlink training and channel state feedback,” IEEE Transactions on Information Theory, vol. 56, no. 6, pp. 2845–2866, 2010.
  4. S. Tatikonda and S. Mitter, “Control under communication constraints,” IEEE Transactions on automatic control, vol. 49, no. 7, pp. 1056–1068, 2004.
  5. C. E. Shannon, “Communication in the presence of noise,” Proceedings of the IRE, vol. 37, no. 1, pp. 10–21, 1949.
  6. M. Cagnazzo and M. Kieffer, “Shannon-kotelnikov mappings for softcast-based joint source-channel video coding,” in 2015 IEEE International Conference on Image Processing (ICIP).   IEEE, 2015, pp. 1085–1089.
  7. U. Timor, “Design of signals for analog communication,” IEEE Transactions on Information Theory, vol. 16, no. 5, pp. 581–587, 1970.
  8. B. Chen and G. W. Wornell, “Analog error-correcting codes based on chaotic dynamical systems,” IEEE Transactions on Communications, vol. 46, no. 7, pp. 881–890, 1998.
  9. V. A. Vaishampayan and S. I. R. Costa, “Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources,” IEEE Transactions on Information Theory, vol. 49, no. 7, pp. 1658–1672, 2003.
  10. M. Skoglund, N. Phamdo, and F. Alajaji, “Design and performance of vq-based hybrid digital-analog joint source-channel codes,” IEEE Transactions on Information Theory, vol. 48, no. 3, pp. 708–720, 2002.
  11. ——, “Hybrid digital–analog source–channel coding for bandwidth compression/expansion,” IEEE Transactions on Information Theory, vol. 52, no. 8, pp. 3757–3763, 2006.
  12. U. Mittal and N. Phamdo, “Hybrid digital-analog (hda) joint source-channel codes for broadcasting and robust communications,” IEEE Transactions on Information Theory, vol. 48, no. 5, pp. 1082–1102, 2002.
  13. N. Santhi and A. Vardy, “Analog codes on graphs,” arXiv preprint cs/0608086, 2006.
  14. M. Taherzadeh and A. K. Khandani, “Single-sample robust joint source–channel coding: Achieving asymptotically optimum scaling of sdr versus snr,” IEEE transactions on information theory, vol. 58, no. 3, pp. 1565–1577, 2012.

Summary

We haven't generated a summary for this paper yet.