Variable-length coding with stop-feedback for the common-message broadcast channel
| Autor: | Wei Yang, Giuseppe Durisi, Petar Popovski, Kasper Floe Trillingsgaard |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Theoretical computer science
Binary number 020206 networking & telecommunications 02 engineering and technology Code rate Square root Converse 0202 electrical engineering electronic engineering information engineering Asymptotic expansion Encoder Algorithm Decoding methods Computer Science::Information Theory Mathematics Coding (social sciences) |
| Zdroj: | ISIT 2016 IEEE International Symposium on Information Theory (ISIT) Trillingsgaard, K F, Yang, W, Durisi, G & Popovski, P 2016, Variable-Length Coding with Stop-Feedback for the Common-Message Broadcast Channel . in Information Theory (ISIT), 2016 IEEE International Symposium on . IEEE, I E E E International Symposium on Information Theory. Proceedings, pp. 2674-2678, IEEE International Symposium on Information Theory, Barcelona, Spain, 10/07/2016 . https://doi.org/10.1109/ISIT.2016.7541784 |
| DOI: | 10.1109/isit.2016.7541784 |
| Popis: | This paper investigates the maximum coding rate over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. Specifically, upon decoding the common message, each decoder sends a stop signal to the encoder, which transmits continuously until it receives all K stop signals. We present nonasymptotic achievability and converse bounds for the maximum coding rate, which strengthen and generalize the bounds previously reported in Trillingsgaard et al. (2015) for the two-user case. An asymptotic analysis of these bounds reveal that---contrary to the point-to-point case---the second-order term in the asymptotic expansion of the maximum coding rate decays inversely proportional to the square root of the average blocklength. This holds for certain nontrivial common-message broadcast channels, such as the binary symmetric broadcast channel. Furthermore, we identify conditions under which our converse and achievability bounds are tight up to the second order. Through numerical evaluations, we illustrate that our second-order asymptotic expansion approximates accurately the maximum coding rate and that the speed of convergence to capacity is indeed slower than for the point-to-point case. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|