Computer Science – Information Theory
Scientific paper
2010-07-12
Computer Science
Information Theory
Scientific paper
We investigate the achievable error probability in communication over an AWGN discrete time memoryless channel with noiseless delay-less rate-limited feedback. For the case where the feedback rate R_FB is lower than the data rate R transmitted over the forward channel, we show that the decay of the probability of error is at most exponential in blocklength, and obtain an upper bound for increase in the error exponent due to feedback. Furthermore, we show that the use of feedback in this case results in an error exponent that is at least RF B higher than the error exponent in the absence of feedback. For the case where the feedback rate exceeds the forward rate (R_FB \geq R), we propose a simple iterative scheme that achieves a probability of error that decays doubly exponentially with the codeword blocklength n. More generally, for some positive integer L, we show that a L-th order exponential error decay is achievable if R_FB \geq (L-1)R. We prove that the above results hold whether the feedback constraint is expressed in terms of the average feedback rate or per channel use feedback rate. Our results show that the error exponent as a function of R_FB has a strong discontinuity at R, where it jumps from a finite value to infinity.
Goldsmith Andrea
Mirghaderi Reza
Weissman Tsachy
No associations
LandOfFree
Achievable Error Exponents in the Gaussian Channel with Rate-Limited Feedback 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 Achievable Error Exponents in the Gaussian Channel with Rate-Limited Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Error Exponents in the Gaussian Channel with Rate-Limited Feedback will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-350087