TY - GEN
T1 - Error exponent for Gaussian channels with partial sequential feedback
AU - Agarwal, Manish
AU - Guo, Dongning
AU - Honig, Michael L
PY - 2007/12/1
Y1 - 2007/12/1
N2 - We consider an additive white Gaussian noise (AWGN) channel with partial sequential feedback. Namely, for every fixed-length block of forward transmissions a fraction of the received symbols are fed back sequentially to the transmitter through a noiseless feedback link. It is well known that complete noiseless feedback can provide a dramatic improvement in reliability (i.e., double-exponential error rate with block length). We show that partial feedback can also provide a substantial improvement in error rate. Specifically, we propose a capacity-achieving coding scheme with partial feedback, in which the feedback is used to induce a prior distribution for the decoding of random forward error control (FEC) codewords. The error-exponent for this scheme is larger than the error-exponent with FEC coding only at all rates. For rates greater than those achieved by transmissions with feedback alone, we give an upper bound on the error exponent. Exponents close to this bound can be achieved with both the proposed scheme and a simple rate-splitting scheme. With finite block lengths, the proposed coding scheme achieves lower error rates than rate-splitting.
AB - We consider an additive white Gaussian noise (AWGN) channel with partial sequential feedback. Namely, for every fixed-length block of forward transmissions a fraction of the received symbols are fed back sequentially to the transmitter through a noiseless feedback link. It is well known that complete noiseless feedback can provide a dramatic improvement in reliability (i.e., double-exponential error rate with block length). We show that partial feedback can also provide a substantial improvement in error rate. Specifically, we propose a capacity-achieving coding scheme with partial feedback, in which the feedback is used to induce a prior distribution for the decoding of random forward error control (FEC) codewords. The error-exponent for this scheme is larger than the error-exponent with FEC coding only at all rates. For rates greater than those achieved by transmissions with feedback alone, we give an upper bound on the error exponent. Exponents close to this bound can be achieved with both the proposed scheme and a simple rate-splitting scheme. With finite block lengths, the proposed coding scheme achieves lower error rates than rate-splitting.
UR - http://www.scopus.com/inward/record.url?scp=51649094035&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51649094035&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2007.4557133
DO - 10.1109/ISIT.2007.4557133
M3 - Conference contribution
AN - SCOPUS:51649094035
SN - 1424414296
SN - 9781424414291
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1426
EP - 1430
BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Y2 - 24 June 2007 through 29 June 2007
ER -