6 May 2020 in IEEE Transactions on Broadcasting
We present the latest developments in the physical layer evolution for the transmission of Multimedia Broadcast Multicast Service (MBMS) over fifth generation (5G) cellular networks. We first provide an overview of how the MBMS physical layer has evolved during the initial releases of the Third Generation Partnership Project (3GPP) specifications and provide motivations and insights for key developments that have helped mature MBMS into a competitive broadcasting solution. We provide an overview of dedicated MBMS carriers for Multimedia Broadcast multicast service Single Frequency Network (MBSFN) transmission as well as Orthogonal Frequency Division Multiplexing (OFDM) numerologies with longer cyclic prefixes to support MBSFN transmission over large geographical areas with large distances between cooperating cell sites. Next, we describe the most recent enhancements to the MBMS physical layer, addressing advanced use cases in the recently completed release of the 3GPP specifications (Release 16). First, we describe the physical layer design for enabling MBSFN-based MBMS services for rooftop receivers with inter-site distances between cooperating cell sites as large as 125 km. In this realm, we demonstrate the need for an OFDM numerology with a 300-microsecond cyclic prefix to communicate effectively over channels with very large delay spreads. Next, we explain how support for high mobility up to 250 kmph was added to the standards by using an OFDM numerology that gracefully trades off inter-symbol interference due to large delay spreads and inter-carrier interference due to large doppler spreads to achieve better performance than existing numerologies at high speeds. Finally, we describe the enhancements that were made to the Cell Acquisition Subframe (CAS)--specifically, the introduction of larger aggregation levels for the Physical Downlink Control Channel (PDCCH) and the support of Physical Broadcast Channel (PBCH) repetitions--that significantly increase the coverage for the control and system information associated with MBMS that are carried by these subframes.
15 July 2014 in IEEE Transactions on Wireless Communications
This paper contributes to the design and analysis of Quantize-Map-and-Forward (QMF) relaying by optimizing its performance for small relay networks. QMF was proved to achieve the capacity of arbitrary networks within a bounded gap, as well as the optimal diversity-multiplexing tradeoff over slow fading networks. The initial QMF scheme has each relay performing the same operation, agnostic to the network topology and the channel state information (CSI); this facilitates the analysis for arbitrary networks, yet comes at a performance penalty for small networks and medium SNR regimes. This paper demonstrates the benefits we can gain for QMF if we optimize its performance by leveraging topological and channel state information. We show that for the N-relay diamond network, by taking into account topological information, we can exponentially reduce the QMF additive approximation gap from Θ(N) bits/s/Hz to Θ(log N) bits/s/Hz, while for the one-relay and two-relay networks, use of topological information and CSI can help to gain as much as 6 dB. Moreover, we explore what benefits we can realize if we jointly optimize QMF and half-duplex scheduling, as well as if we employ hybrid schemes that combine QMF and Decode-and-Forward (DF) relay operations.
29 December 2025 in IEEE Communications Standards Magazine
HKHarikumar Krishnamurthy
+1
3GPP Release-19 is introducing an interesting new feature for narrowband Internet of Things (NB-IoT) and enhanced machine type communications (eMTC). The solution, currently enabled only for IoT over non-terrestrial networks, consists in the use of contention-based early data transmission (CB-EDT) procedures to allow a UE send data over shared uplink resources following a random access approach. In contrast to the existing EDT solution, the new feature does not rely on the exchange of a random access preamble and random access response, but rather foresees the UE directly transmitting its message, thus saving overhead and reducing delay. Moreover, CB-EDT implements diversity slotted ALOHA (DSA), so that a UE transmits multiple replicas of its packet over the available uplink resources, aiming to enhance the probability of having at least one of its messages not colllided. Further improvements are attained by using a multicast acknowledgment (message 4), addressing multiple UEs and saving downlink capacity. This article provides a description of the new feature, starting from its basic working principles and adding up details that cover the current 3GPP implementation status. The potential of the solution is demonstrated and discussed by means of numerical results, also identifying potential developments in future releases.
21 July 2020 in IEEE Transactions on Information Theory
This paper explores the network simplification problem for Gaussian full-duplex relay networks with arbitrary topology. Particularly, given an $N$ -relay Gaussian full-duplex network, the network simplification problem seeks to find fundamental guarantees on the capacity of the best subnetwork, among a particular class of subnetworks, as a fraction of the full-network capacity. The focus of this work is the case when the selected subnetwork class is a path from the source to the destination. The main result of the paper shows that for an $N$ -relay Gaussian networks with arbitrary topology, the best route can in the worst case guarantee an approximate fraction $\frac {1}{ \lfloor N/2 \rfloor + 1}$ of the capacity of the full network, independently of the channel coefficients and/or operating SNR. Furthermore, this guarantee is shown to be fundamental, i.e., it is the highest worst-case guarantee that can be provided for routing in relay networks. A key step in the proof of the main result lies in the derivation of a simplification result for antenna selection in MIMO channels that may also be of independent interest. To the best of our knowledge, this is the first result that characterizes the performance of routing in comparison to physical layer cooperation techniques that approximately achieve the network capacity for general wireless network topologies. The results in this paper show that routing can, in the worst case, result in an unbounded gap from the network capacity - or reversely, physical layer cooperation can offer unbounded gains over routing.