Analog Codes on Graphs

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 15 figures, Portions appeared in Proceedings of the International Symposium on Information Theory (ISIT), Yokohama,

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Analog Codes on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analog Codes on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analog Codes on Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-571890

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.