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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages617-622
Number of pages6
ISBN (Electronic)9798350382846
DOIs
StatePublished - 2024
Event2024 IEEE International Symposium on Information Theory, ISIT 2024 - Athens, Greece
Duration: Jul 7 2024Jul 12 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2024 IEEE International Symposium on Information Theory, ISIT 2024
Country/TerritoryGreece
CityAthens
Period7/7/247/12/24

Bibliographical note

Publisher Copyright:
© 2024 IEEE.

Fingerprint

Dive into the research topics of 'Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme'. Together they form a unique fingerprint.

Cite this