References

References

  1. Y. Polyanskiy, H. V. Poor, and S. Verd\'u, Channel Coding Rate in the Finite Blocklength Regime, IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307--2359, 2010

    The foundational paper on finite blocklength information theory. Derives the normal approximation, RCU bound, and meta-converse for the AWGN channel and other memoryless channels.

  2. G. Durisi, T. Koch, and P. Popovski, Toward Massive, Ultrareliable, and Low-Latency Wireless Communication with Short Packets, Proceedings of the IEEE, vol. 104, no. 9, pp. 1711--1726, 2016

    Comprehensive survey connecting finite blocklength theory to URLLC system design. Covers fading channels, MIMO, and the diversity-multiplexing-latency trade-off.

  3. M. Bennis, M. Debbah, and H. V. Poor, Ultrareliable and Low-Latency Wireless Communication: Tail, Risk, and Scale, Proceedings of the IEEE, vol. 106, no. 10, pp. 1834--1853, 2018

    Addresses URLLC from a network-level perspective, covering tail probability analysis, risk-sensitive optimisation, and the challenge of scaling URLLC to many users.

  4. L. Liu and W. Yu, Massive Connectivity with Massive MIMO -- Part I: Device Activity Detection and Channel Estimation, IEEE Transactions on Signal Processing, vol. 66, no. 11, pp. 2933--2946, 2018

    Develops the AMP-based activity detection and channel estimation framework for mMTC with massive MIMO. Derives state evolution and phase transition results.

  5. Z. Chen, F. Sohrabi, and W. Yu, Sparse Activity Detection for Massive Connectivity, IEEE Transactions on Signal Processing, vol. 66, no. 7, pp. 1890--1904, 2018

    Analyses the covariance-based activity detection approach as an alternative to AMP, providing non-asymptotic performance guarantees for the MMV compressed sensing problem.

  6. Y. Polyanskiy, A Perspective on Massive Random Access, IEEE International Symposium on Information Theory (ISIT), pp. 2523--2527, 2017

    Introduces the unsourced random access model and derives the random coding achievability bound. Establishes the fundamental limits that practical schemes should approach.

  7. S. Kaul, R. Yates, and M. Gruteser, Real-Time Status: How Often Should One Update?, IEEE INFOCOM, pp. 2731--2735, 2012

    The paper that introduced the Age of Information metric. Derives AoI for M/M/1, M/D/1, and D/M/1 queues and shows the U-shaped AoI curve.

  8. R. D. Yates, Y. Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, Age of Information: An Introduction and Survey, IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1183--1210, 2021

    Comprehensive survey of AoI theory, covering single and multi-source systems, scheduling, energy harvesting, sampling, and connections to remote estimation.

  9. G. Liva, Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA, IEEE Transactions on Communications, vol. 59, no. 2, pp. 477--487, 2011

    Develops the IRSA framework using the analogy between successive interference cancellation and iterative decoding of LDPC codes on bipartite graphs.

  10. A. Fengler, S. Haghighatshoar, P. Jung, and G. Caire, Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access with a Massive MIMO Receiver, IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2925--2951, 2021

    Develops practical coded compressed sensing schemes for unsourced random access that approach the Polyanskiy bound within a few dB.

  11. 3GPP, TR 38.824: Study on Physical Layer Enhancements for NR Ultra-Reliable and Low Latency Communication (URLLC), 3GPP Technical Report, Release 16, 2019

    The 3GPP study item documenting physical layer design choices for URLLC in 5G NR, including mini-slot design, HARQ enhancements, and configured grant.

  12. P. Popovski, K. F. Trillingsgaard, O. Simeone, and G. Durisi, 5G Wireless Network Slicing for eMBB, URLLC, and mMTC: A Communication-Theoretic View, IEEE Access, vol. 6, pp. 55765--55779, 2019

    Information-theoretic perspective on network slicing across the three 5G service categories. Analyses the fundamental trade-offs in sharing resources among heterogeneous traffic types.

Further Reading

For readers who want to go deeper into specific topics from this chapter.

  • Second-order asymptotics and refinements

    V. Y. F. Tan, *Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities*, Foundations and Trends in Communications and Information Theory, vol. 11, no. 1--2, pp. 1--184, 2014

    Provides a rigorous and self-contained treatment of second-order and moderate deviations asymptotics, covering both achievability (random coding) and converse (information spectrum) methods. Essential for understanding the $O(\log n / n)$ remainder in the normal approximation.

  • URLLC in 5G NR: from theory to implementation

    N. H. Mahmood et al., "White Paper on Critical and Massive Machine Type Communication towards 6G," 6G Flagship White Paper, University of Oulu, 2020

    Bridges the gap between information-theoretic URLLC limits and practical 5G/6G system design. Covers physical layer procedures, HARQ design, multi-connectivity, and network architecture for mission-critical services.

  • Compressed sensing for massive connectivity

    Z. Chen, F. Sohrabi, Y.-F. Liu, and W. Yu, "Covariance Based Joint Activity and Data Detection for Massive Random Access with Massive MIMO," IEEE International Conference on Communications (ICC), 2019

    Presents the covariance-based approach to joint activity and data detection, which avoids explicit sparse recovery and instead exploits the structure of the sample covariance matrix. Complements the AMP-based methods in Section 32.3.

  • Age of Information: scheduling and optimisation

    I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, "Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks," IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637--2650, Dec. 2018

    Develops optimal and near-optimal scheduling policies for minimising AoI in multi-user systems with shared wireless channels. Extends the single-source results from Section 32.4 to the network setting.

  • Semantic communication and goal-oriented networking

    E. Uysal et al., "Semantic Communications in Networked Systems: A Data Significance Perspective," IEEE Network, vol. 36, no. 4, pp. 233--240, Jul./Aug. 2022

    Explores the frontier beyond AoI, where the value and meaning of transmitted information --- not just its timeliness --- drive network design. Connects to the emerging 6G vision of task-oriented and goal-oriented communication.

  • Coded random access and LDPC-like schemes

    E. Paolini, G. Liva, and M. Chiani, "Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access," IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6815--6832, Dec. 2015

    Extends IRSA to coded slotted ALOHA using local codes across slots. The density evolution analysis parallels that of LDPC codes and provides the tools to optimise degree distributions for maximum throughput.

ExercisesCh 33 →