A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme

Details A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme

2010-01-14

arxiv.org/abs/1001.2488v1

Computer Science

Information Theory

5 pages, submitted to IEEE International Symposium on Information Theory (ISIT) 2010

Scientific paper

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmitting the quantizer outputs in the first channel uses, and sending the remaining quantization error uncoded in the last channel use. The bound coincides with the performance achieved by a suboptimal decoder studied by the authors in a previous paper, thereby establishing that the bound is tight.

Affiliated with

Also associated with

No associations

Rating

A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme 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 A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568400