An upper bound on the error probability is obtained for digital communication (with average power Poand no bandwidth constraint) in the presence of additive white gaussian noise (with one-sided spectral density No) with the use of a noiseless feedback link. A repeat-request strategy is used: the receiver decodes a signal only when it is relatively sure that one particular message was actually transmitted, otherwise it requests (via the feedback channel) a retransmission. We show that as the coding delay T becomes large, we can transmit at an effective rateR̄ < C = P_ / N_,the channel capacity, with error probability Peapproximately exp- T[(√C - √R̄)² + C - R̄],which is a considerable improvement over the reliability attainable with a one-way channel. These results parallel those obtained earlier by Forney for the discrete memoryless channel.
No takes yet. Share an insight, caveat, or question.
A.D. Wyner (1969) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: