Analog Codes on Graphs
Information Theory
2007-07-16 v1 Discrete Mathematics
math.IT
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 for a bandwidth expansion factor of , where is the rate of individual component binary codes used in the construction and 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.
Cite
@article{arxiv.cs/0608086,
title = {Analog Codes on Graphs},
author = {Nandakishore Santhi and Alexander Vardy},
journal= {arXiv preprint arXiv:cs/0608086},
year = {2007}
}
Comments
18 pages, 15 figures, Portions appeared in Proceedings of the International Symposium on Information Theory (ISIT), Yokohama, Japan, July 2003