Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Achievability Bound for Variable-Length Stop-Feedback Coding over the Gaussian Channel

Published 21 Mar 2024 in cs.IT and math.IT | (2403.14360v1)

Abstract: Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error probability to zero with respect to blocklength. Motivated by this fact, we present a non-asymptotic achievability bound for variable-length coding with stop-feedback. Specifically, a general achievability bound is derived, that employs a random coding ensemble in combination with minimum distance decoding. The general bound is particularized for the Gaussian channel. Numerical evaluation of the bound confirms the significant value of feedback compared to transmission with fixed blocklength coding and without feedback.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (9)
  1. C. Shannon, “The zero error capacity of a noisy channel,” IRE Transactions on Information Theory, vol. 2, no. 3, pp. 8–19, 1956.
  2. M. Burnashev, “Data transmission over a discrete channel with feedback. Random transmission time,” Probl. Peredachi Inf., vol. 12, no. 4, pp. 10–30, 1976.
  3. Y. Polyanskiy, H. V. Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory, vol. 56, pp. 2307–2359, May 2010.
  4. Y. Polyanskiy, H. V. Poor, and S. Verdu, “Feedback in the non-asymptotic regime,” IEEE Transactions on Information Theory, vol. 57, no. 8, pp. 4903–4925, 2011.
  5. J. Östman, R. Devassy, G. Durisi, and E. G. Ström, “Short-packet transmission via variable-length codes in the presence of noisy stop feedback,” IEEE Transactions on Wireless Communications, pp. 1–1, 2020.
  6. L. V. Truong and V. Y. F. Tan, “On gaussian macs with variable-length feedback and non-vanishing error probabilities,” IEEE Transactions on Information Theory, vol. 64, no. 4, pp. 2333–2346, 2018.
  7. I. Papoutsidakis, A. Doufexi, and R. J. Piechocki, “Efficient evaluation of the probability of error of random coding ensembles,” in 2023 IEEE International Symposium on Information Theory (ISIT), pp. 2117–2122, 2023.
  8. C. E. Shannon, “Probability of error for optimal codes in a gaussian channel,” The Bell System Technical Journal, vol. 38, no. 3, pp. 611–656, 1959.
  9. L. Devroye, Non-Uniform Random Variate Generation. Springer New York, 1986.
Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.