Analog Codes on Graphs

TL;DR

This paper introduces an analog coding scheme for transmitting band-limited analog signals over noisy channels, achieving significantly improved mean-squared error performance across various SNR levels compared to previous methods.

Contribution

The paper presents a novel analog coding scheme that leverages graph-based codes to enhance transmission quality over noisy channels with bandwidth expansion.

Findings

Achieves mean-squared error proportional to (1+SNR)^{-B}

Performs better than existing analog coding systems across SNR range

Utilizes a bandwidth expansion factor of B/R for improved performance

Abstract

We consider the problem of transmission of a sequence of real data produced by a Nyquist sampled band-limited analog source over a band-limited analog channel, which introduces an additive white Gaussian noise. An analog coding scheme is described, which can achieve a mean-squared error distortion proportional to $(1+SNR)^{-B}$ for a bandwidth expansion factor of $B/R$, where $0 < R < 1$ is the rate of individual component binary codes used in the construction and $B \geq 1$ is an integer. Thus, over a wide range of SNR values, the proposed code performs much better than any single previously known analog coding system.