Search

The Last decade saw significant growth in the digital terrestrial television (DTT) subscribers. The High peak-to-average power ratio (PAPR) of the transmitted signal is implied by the large fluctuations in its amplitude, which is a serious issue in the contemporary and next generation DTT broadcasting systems. These large fluctuations prevent feeding the high power amplifier (HPA) at an operating point near its non-linear (NL) saturation region, thereby lowering its power efficiency. For a better future, energy-efficient green communications is the need of hour. This paper focuses on digital predistortion (DPD), which is among the widely used techniques for HPA linearization in order to minimize the NL effects. DPD technique requires a feedback signal. This paper proposes a novel adding signal-based digital predistortion, where the output of the HPA is gradually linearized by adding a signal at the input in an iterative manner. By Taylor series approximation, the DPD problem can be posed as a convex one. We prove that a tighter upper bound exists for the convergence factor and instead of directly solving the convex problem, we pick a convergence factor value within its bounds that offers a good trade-off between convergence speed and residual error value. The simulation results show that the proposed technique can quickly linearize the HPA with good convergence. [ABSTRACT FROM AUTHOR]

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound. [ABSTRACT FROM AUTHOR]

Dirty paper coding (DPC) scheme is the capacity achieving transmission technique in multiuser MIMO downlink channels. As a suboptimal solution to DPC, successive zero-forcing DPC (SZF-DPC) has been proposed recently. The zero-interference constraint in designing the precoding matrices limits the number of supportable users. In this correspondence, we propose three low-complexity suboptimal user scheduling algorithms to exploit the multiuser diversity gain in SZF-DPC as the number of users grows. The first algorithm greedily maximizes the true sum rate. The second algorithm is based on eigenvalues. The third algorithm relies on the diagonal elements of the effective channel matrix since eigenvalues and diagonal entries of a Hermitian matrix have a strong relationship. Simulation results show that the proposed scheduling algorithms can obtain a significant fraction of sum rate of the optimal solution. Furthermore, the performance analysis is provided to prove that the proposed user selection algorithms can achieve the same asymptotic sum rate as that of DPC. [ABSTRACT FROM AUTHOR]

This letter presents two results for multiuser wireless systems employing dirty-paper coding strategies along with greedy scheduling over the broadcast multiple-input multiple-output channel. Specifically, an efficient and suboptimal downlink scheduler is proposed to approximate the maximum sum rate using equal power allocation, and it is shown to approach the maximum sum rate of optimal power allocation for a large number of users under optimal scheduling. The second result demonstrates that the average maximum sum rate can be tightly upper bounded when spatial multiplexing is maximized. [ABSTRACT FROM AUTHOR]

The 2020 Scott Helt Memorial Award was awarded to Manuel Fuentes, Hongzhi Chen, Eduardo Garro, Jose Luis Carcel, David Vargas, Belkacem Mouhouche, David Gomez-Barquero for their paper, “Physical Layer Performance Evaluation of LTE-Advanced Pro Broadcast and ATSC 3.0 Systems.” The papers appeared in the IEEE Transactions on Broadcasting, vol. 65, no. 3, pp. 477–488, September 2019. The purpose of the IEEE Scott Helt Memorial Award is to recognize exceptional publications in the field and to stimulate interest in and encourage contributions to the fields of interest of the Society. [ABSTRACT FROM AUTHOR]

We compare the capacity of dirty-paper coding (DPC) to that of time-division multiple access (TDMA) for a multiple-antenna (multiple- input multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC) of the multiple-antenna BC Is at most min(M, K) times the largest single-user capacity (i.e., the TDMA sum-rate) in the system, where M is the number of transmit antennas and K is the number of receivers. This result is Independent of the number of receive antennas and the channel gain matrix, and is valid at all signal-to-noise ratios (SNRs). We investigate the tightness of this bound In a time-varying channel (assuming perfect channel knowledge at receivers and transmitters) where the channel experiences uncorrelated Rayleigh fading and In some situations we find that the dirty paper gain is upper-bounded by the ratio of transmit-to-receive antennas. We also show that min(M, K) upper-bounds the sum-rate gain of successive decoding over TDMA for the uplink channel, where M is the number of receive antennas at the base station and K is the number of transmitters. [ABSTRACT FROM AUTHOR]

The 2018 Scott Helt Memorial Award was awarded to Seho Myung, Sung-Ik Park, Kyung-Joong Kim, Jae-Young Lee, Sunhyoung Kwon, Jeongchang Kim, for their paper, “Offset and Normalized Min-Sum Algorithms for ATSC 3.0 LDPC Decoder.” The papers appeared in the IEEE Transactions on Broadcasting, vol. 63, no. 4, pp. 734–739, Dec. 2017. The purpose of the IEEE Scott Helt Memorial Award is to recognize exceptional publications in the field and to stimulate interest in and encourage contributions to the fields of interest of the Society. [ABSTRACT FROM AUTHOR]

This paper develops a methodology for finding minimum energy per bit in networks with correlated information, without at need for finding bounds on capacity. This is used to derive the exact minimum energy per bit for some broadcast and interference channels with common and correlated messages, and bounds on the minimum energy per bit for some other channels. [ABSTRACT FROM PUBLISHER]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

The article offers information regarding details for Papers Institute of Electrical and Electronics Engineers (IEEE) Transactions on Broadcasting that focuses on the 5G wireless networks. It mentions its main aim to revolutionize different vertical industries including media broadcasting and also mentions the increasing importance of fixed and mobile broadband IP delivery.

This paper presents the research and implementation of a China Digital Radio (CDR) experimental network in Hubei, China with two FM-CDR transmitting stations and four FM-band channels. To study the coverage discontinuity problem in a large service area, the experimental network employs an intelligent networking solution that incorporates multiple service channels carrying Broadcast and Data Services (BADS) and a Common-Regional-Information Channel (CRIC) carrying both service data and system information. The electronic service guide (ESG) carried by CRIC can inform the receivers about the available contents from current and adjacent stations, which can significantly improve the service quality in the overlapping areas, especially under mobile reception environment. Two RF tuners are used in the receiving terminals to access the CRIC, and the BADS channel, respectively. This paper first presents the frequency analysis and coverage tests of the experimental network, and then summarizes the coverage performances with different transmission parameter combinations. The goal is to gain experience in frequency planning, coverage prediction, as well as supportable services of CDR digital audio broadcasting. [ABSTRACT FROM AUTHOR]

Multicast and broadcast transmissions enhance the spectrum efficiency by delivering a single packet to multiple terminal users. The service continuity (SC) mechanism enables users to continue the service reception when the original transmission is not available anymore. For multicast and broadcast transmissions, the SC mechanism is different from that of unicast because of the different reception conditions. We design and analyze a set of SC mechanisms for New Radio (NR) multicast and broadcast transmissions (MBS) in this paper. The designed SC mechanisms do not require extra data-forwarding resources while meeting the interruption time requirements of diverse applications. To minimize the signalling overhead while meeting the latency requirements, we propose a dynamic SC configuration framework. With the framework, the network condition information is collected and the most suitable SC mechanism is chosen with its parameters. Simulation results demonstrate that the proposed dynamic configuration framework outperforms the LTE eMBMS solution with up to 84.07% signaling overhead reduction, facilitating a more efficient multicast and broadcast system in NR. [ABSTRACT FROM AUTHOR]

There emerges a strong trend recently to create an intelligent and controllable wireless transmission environment by installing reconfigurable intelligent surfaces (RIS) on the surface of diverse. We research the use of RIS in 5G multicast TV applications in this paper. In particular, the shape-adaptive RIS is developed to relay 5G multicast TV signals and achieve extra RIS gain. To optimize the shape bending in RIS model, we employ the algorithm of Deep Deterministic Policy Gradient (DDPG), a reinforcement learning technique that combines both Q-learning and Policy gradients. Our simulation results show that RIS can considerably enhance the SINR of worst users and improve the system’s overall Modulation and Coding Scheme (MCS) level for 5G mobile broadcasting services. [ABSTRACT FROM AUTHOR]

The 2010 Scott Helt Memorial Award was awarded to Bogdan Ciubotaru, Gabriel-Miro Muntean, and Gheorghita Ghinea for their paper, "Objective Assessment of Region of Interest-Aware Adaptive Multimedia Streaming Quality," which appeared in the IEEE Transactions on Broadcasting, vol. 55, pp. 202-212, June 2009. [ABSTRACT FROM AUTHOR]

Terrestrial broadcast has traditionally targeted TV receivers in the home. But today’s most popular screens are those of SmartPhones and Tablet PCs. (Painful) Experience has shown that in order to reach those gadgets, IEEE- and 3GPP-specified solutions are required. Starting with TOoL+, the authors have proposed bridges between traditional broadcast and today’s wireless connectivity. Within the set of specifications of 3GPP such bridges named MBS, MBMS, and FeMBMS now exist – with limited acceptance by cellular network operators so far. The rapidly growing number of popular data services to SmartPhones, connected cars, etc., and 5G New Radio may change this in the future. Therefore, this paper presents a broadcast extension of today’s 5G New Radio supporting the implementation of High Tower High Power/Medium Power Medium Tower networks overlaying cellular networks. The extension was implemented using software defined radio and tested in a real-world field trial in Germany. [ABSTRACT FROM AUTHOR]

This paper encompasses various topics for 5G-involved broadcasting under the common context converged distribution of 5G media. Particularly, two primary subtopics are addressed: An overlaid coexistence of 5G terrestrial broadcast and Advanced Television Systems Committee (ATSC) 3.0; and dual connectivity applications built on top of the convergence between digital broadcasting and 5G unicasting. In the first part, a viable, time-sharing co-transmission system is introduced to overlay 5G Broadcast and ATSC 3.0 frames in the same radio spectrum. The system is carefully designed to comply with current 5G and ATSC 3.0 standards, so that it does not require modifications in either ATSC 3.0 or 5G specifications. To help the future planning in a technical aspect, the reliability performance is in-depth compared between 5G Broadcast and ATSC 3.0 frames, and the motivation of tower overlaying is discussed as well. Subsequently in the $2^{\mathrm{ nd}}$ part, the convergence is in parallel explored with respect to the dual connectivity. To settle a broad-ranged consensus for future convergence, various possible use cases are proposed in an application aspect. Technical, conceptual proposals and implementations are presented, specifically related to edge caching; 8K streaming (with a working prototype); large-scale software updating; data security; and location tracking. We hereby point out how dual connectivity can contribute to realistic scenarios. In turn, the scope of convergence use cases is desirably expanded, so that would encourage the initiatives bridging 5G and broadcasting into practice. [ABSTRACT FROM AUTHOR]

Along with the commercialization of evolved multimedia broadcast multicast services (eMBMS), the number of mobile broadcasting users is growing notably. Previous works reveal that the accuracy of mobile channel estimation will significantly impact the quality of broadcasting services. Motivated by this fact, we apply machine learning (ML) to the fifth-generation Radio Access Network (5G RAN) slicing in this paper for the estimation and the prediction of the channel status in mobile scenarios. More specifically, a cascaded convolutional neural network (CNN)-long short term memory network (LSTM) architecture is developed to achieve channel estimation for mobile broadcasting users. The energy efficiency of the base station (BS) is modeled mathematically, and the sub-optimal solution is achieved by deep Q-Network (DQN) based on the available channel status. Finally, we present the simulation results to justify the performance of our proposed schemes. [ABSTRACT FROM AUTHOR]

Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively. [ABSTRACT FROM AUTHOR]

Cognitive radio promises a low-cost, highly flexible alternative to the classic single-frequency band, single-protocol wireless device. By sensing and adapting to its environment, such a device is able to fill voids in the wireless spectrum and can dramatically increase spectral efficiency. In this paper, the cognitive radio channel is defined as a two-sender, two-receiver interference channel in which sender 2 obtains the encoded message sender 1 plans to transmit. We consider two cases: in the genie-aided cognitive radio channel, sender 2 is noncausally presented the data to be transmitted by sender 1 while in the causal cognitive radio channel, the data is obtained causally. The cognitive radio at sender 2 may then choose to transmit simultaneously over the same channel, as opposed to waiting for an idle channel as is traditional for a cognitive radio. Our main result is the development of an achievable region which combines Gel'fand-Pinkser coding with an achievable region construction for the interference channel. In the additive Gaussian noise case, this resembles dirty-paper coding, a technique used in the computation of the capacity of the Gaussian multiple-input multiple-output (MIMO) broadcast channel. Numerical evaluation of the region in the Gaussian noise case is performed, and compared to an inner bound, the interference channel, and an outer bound, a modified Gaussian MIMO broadcast channel. Results are also extended to the case in which the message is causally obtained. [ABSTRACT FROM AUTHOR]

To protect military broadcasting against both hostile interference and eavesdropping, an artificial noise (AN) sheltered frequency hopping (FH) broadcasting (ANS-FHB) architecture is proposed in this paper, and the secrecy capacity is employed to measure its secrecy performance. Besides, considering the inevitable frequency mismatch after synchronization will degrade system secrecy in practical applications, the optimal transmitting power allocation (PA) for the confidential information (CI) and AN is provided to maximize secrecy capacity in presence of frequency mismatch. Moreover, to be adapted to various application scenarios, the proposed optimal PA scheme is further simplified according to the frequency synchronization ability and relative channel quality. The analysis and simulations show that the proposed ANS-FHB system can achieve a non-negative secrecy rate even when existing multiple eavesdroppers. In addition, the optimal power ratio of AN to CI shows a downward trend from one to zero as frequency mismatch increases to mitigate the secrecy loss. [ABSTRACT FROM AUTHOR]

The 3rd Generation Partnership Project (3GPP) has defined based on the Long Term Evolution (LTE) enhanced Multicast Broadcast Multimedia Service (eMBMS) a set of new features to support the distribution of Terrestrial Broadcast services in Release 14. On the other hand, a new 5th Generation (5G) system architecture and radio access technology, 5G New Radio (NR), are being standardized from Release 15 onwards, which so far have only focused on unicast connectivity. This may change in Release 17 given a new Work Item set to specify basic Radio Access Network (RAN) functionalities for the provision of multicast/broadcast communications for NR. This work initially excludes some of the functionalities originally supported for Terrestrial Broadcast services under LTE, e.g., free to air, receive-only mode, large-area single frequency networks, etc. This paper proposes an enhanced Next Generation RAN architecture based on 3GPP Release 15 with a series of architectural and functional enhancements, to support an efficient, flexible and dynamic selection between unicast and multicast/broadcast transmission modes and also the delivery of Terrestrial Broadcast services. The paper elaborates on the Cloud-RAN based architecture and proposes new concepts such as the RAN Broadcast/Multicast Areas that allows a more flexible deployment in comparison to eMBMS. High-level assessment methodologies including complexity analysis and inspection are used to evaluate the feasibility of the proposed architecture design and compare it with the 3GPP architectural requirements. [ABSTRACT FROM AUTHOR]

3GPP is now carrying forward the development of the point to multipoint transmission mode of 5G on the basis of the cellular infrastructure and standard. Since the dedicated proposal for multimedia broadcast multicast system (MBMS) was approved, the MBMS technologies are evolving with the update of the requirements from 3G to 5G. This paper reviews the latest progress during the evolved MBMS standardization, which focuses on the LTE-based 5G terrestrial broadcast mode. Some agreements in terms of two widely discussed topics during 3GPP meetings, cell acquisition subframe (CAS) enhancement and numerology refinement, are presented. The enhancement of CAS and the update of numerology aim to deal with the service outage issue in the case of covering large area and serving high-mobility users. To verify the improvement brought by the CAS enhancement and the new numerology, simulations from system level and link level are carried out by several organizations and the representative results are presented and analyzed in this paper. [ABSTRACT FROM AUTHOR]

As an emerging broadband service pattern in the 5G era, VR broadcasting needs a considerable amount of bandwidth and strict quality of service (QoS) control. The traditional eMBMS or enTV transmission mode in HetNets consisting of macro cells and small cells cannot bring about a good trade-off between broadband performance and resource utilization for VR broadcasting service. D2D multicasting applied to VR broadcasting can improve the performance of edge users and resource utilization. Motivated by the rapid development of AI techniques, this paper proposes a novel hybrid transmission mode selection based on online reinforcement learning to address this problem. Each VR broadband user can be associated by one of the three modes: macrocell broadcasting, mmWave small cell unicasting and D2D multicasting. This paper first models this intelligent mode decision process as a problem to pursue the optimal system throughput. Then, an online machine learning-based method is proposed to solve this problem, which consists of a fast D2D clustering module based on unsupervised learning and a smart mode selection module based on reinforcement learning. The simulation results verify that the WoLF-PHC and Nash Q-learning perform better than other algorithms in large-scale scenarios and small-scale scenarios, respectively. The proposed intelligent transmission mode selection can also achieve larger VR throughput than traditional broadcasting strategies with a good balance between broadband performance and resource utilization. [ABSTRACT FROM AUTHOR]

We consider practical schemes for binary dirty-paper channels and broadcast channels (BCs) with two receivers and varying channel quality. With the BC application in mind, this paper proposes a new design for binary dirty paper coding (DPC). By exploiting the concept of coset binning, the complexity of the system is greatly reduced when compared to the existing works. Some design challenges of the coset binning approach are identified and addressed. The proposed binary DPC system achieves similar performance to the state-of-the-art, superposition-coding-based system while demonstrating significant advantages in terms of complexity and flexibility of system design. For binary BCs, achieving the capacity generally requires the superposition of a normal channel code and a carefully designed channel code with non-uniform bit distribution. The non-uniform bit distribution is chosen according to the channel conditions. Therefore, to achieve the capacity for binary BCs with varying channel quality, it is necessary to use quantization codes of different rates, which significantly increases the implementation complexity. In this paper, we also propose a broadcast scheme that generalizes the concept of binary DPC, which we term soft DPC. By combining soft DPC with time sharing, we achieve a large percentage of the capacity for a wide range of channel quality with little complexity overhead. Our scheme uses only one fixed pair of codes for users 1 and 2, and a single quantization code, which possesses many practical advantages over traditional time sharing and superposition coding solutions and provides strictly better performance. [ABSTRACT FROM PUBLISHER]

This paper presents feasibility verification of the Advanced Television Systems Committee (ATSC) 3.0 MIMO system for 8K-UHD terrestrial broadcasting services. For a reliable performance evaluation, computer simulation, laboratory test, and field trial are conducted, and the tests’ results are compared with the same performance metrics. Several physical layer configurations with various data rates from 63 Mbps to 113 Mbps are verified. The field trial results confirm that the ATSC 3.0 MIMO system can support data rates up to 113 Mbps within a 6 MHz bandwidth. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS), a recently introduced technology for future wireless communication systems, enhances the spectral and energy efficiency by intelligently adjusting the propagation conditions between base stations (BSs) and mobile equipments (MEs). An RIS consists of many low-cost passive reflecting elements that are optimized to improve the quality of the received signal. In this paper, we study the problem of power control at the BS and RIS optimization for application to physical-layer broadcasting. Our goal is to minimize the transmit power at the BS by jointly designing the transmit beamforming at the BS and the phase shifts of the passive elements at the RIS. Furthermore, to help validate the proposed optimization methods, we derive lower bounds to quantify the average transmit power at the BS as a function of the number of MEs, the number of RIS elements, and the number of antennas at the BS. The simulation results demonstrate that the average transmit power at the BS is close to the lower bound in an RIS-aided system, and is significantly lower than the average transmit power in conventional schemes without an RIS. [ABSTRACT FROM AUTHOR]

The problem of disseminating continuous data flow from a given source node to all other network nodes is known as the dynamic broadcast problem, which is also a fundamental problem in multi-hop wireless networks (e.g., wireless ad hoc and sensor networks). Due to link unreliability and node mobility, the topology of a network typically changes with time. Little work has been conducted to address the dynamic broadcast problem in time-varying wireless multi-hop networks, especially under the popular Signal-to-Interference-plus-Noise-Ratio (SINR) interference model. In this paper, we study the dynamic broadcast problem in SINR-based time-varying directed acyclic multi-hop wireless networks formed by point-to-point wireless links. We consider the SINR-based link transmission rate model involved in the slot-based link scheduling. We first prove a tight upper bound for the broadcast capacity of the multi-hop wireless networks under study. We then propose an online max-weight Throughput-Optimal Dynamic Broadcast algorithm (TODB) which performs link weight allocation, link scheduling, and data forwarding for each time slot according to the current network connectivity and data reception rates of nodes. We derive the throughput-optimality of the TODB algorithm by proving that the broadcast throughput of TODB can achieve the aforementioned upper bound of the broadcast capacity. We evaluate the performance of TODB in terms of throughput and latency via simulations and the results validate its effectiveness. [ABSTRACT FROM AUTHOR]

The Digital Video Broadcasting (DVB) has proposed to introduce the Ultra-High Definition services in three phases: UHD-1 phase 1, UHD-1 phase 2 and UHD-2. The UHD-1 phase 2 specification includes several new features such as High Dynamic Range (HDR) and High Frame-Rate (HFR). It has been shown in several studies that HFR (+100 fps) enhances the perceptual quality and that this quality enhancement is content-dependent. On the other hand, HFR brings several challenges to the transmission chain including codec complexity increase and bit-rate overhead, which may delay or even prevent its deployment in the broadcast echo-system. In this paper, we propose a Variable Frame Rate (VFR) solution to determine the minimum (critical) frame-rate that preserves the perceived video quality of HFR video. The frame-rate determination is modeled as a 3-class classification problem which consists in dynamically and locally selecting one frame-rate among three: 30, 60 and 120 frames per second. Two random forests classifiers are trained with a ground truth carefully built by experts for this purpose. The subjective results conducted on ten HFR video contents, not included in the training set, clearly show the efficiency of the proposed solution enabling to locally determine the lowest possible frame-rate while preserving the quality of the HFR content. Moreover, our VFR solution enables significant bit-rate savings and complexity reductions at both encoder and decoder sides. [ABSTRACT FROM AUTHOR]

We investigate the problem of downlink user scheduling in multiple-input multiple-output (MIMO) systems with M transmit antennas and K homogeneous multiantenna receiving users. We develop a simple algorithm to schedule a subset of M active users for data transmission.We first identify a set of L candidate users that should provide channel information feedback. We then select M active users among the L candidates based on joint consideration of their effective channel gains and directions. We derive an asymptotic upper bound for the sum rate gap between the maximum sum rate of the M selected active users, achieved by dirty paper coding, and the full sum capacity of the original MIMO broadcast channel. Utilizing the upper bound, we show that the sum rate gap can be reduced to meet user requirement by suitably choosing a large but still finite L. Furthermore, we also investigate the performance of the low complexity zero-forcing beamforming (ZFBF) for the M active users. [ABSTRACT FROM AUTHOR]

This paper investigates secure broadcast communications in intelligent reflecting surface (IRS)-aided millimeter wave (mmWave) symbiotic radio (SR) networks, where the IRS and the base station (BS) are cooperating. Specifically, the IRS assists secure broadcasting for the BS by smartly reconfiguring the phase shifts of the signals from the BS, while delivering its own information to an Internet-of-Things device (IoD). We aim at maximizing the minimum secrecy rate of multiple users by jointly designing the hybrid precoder at the BS and the passive beamformer at the IRS, subject to the rate constraints of both the multiple users and the IoD. The design is formulated as a non-convex optimization problem, which is intractable. To handle it, we develop a computationally efficient iterative algorithm based on the successive convex approximation, the efficiency and superiority of which have been validated by simulation results. [ABSTRACT FROM AUTHOR]

The new ways to consume and deliver media content in a wireless environment have led to a significant increase in the demand for spectrum resources. In addition, the arrival of next-generation wireless communication technologies has encouraged the creating of new verticals targeting novel applications, such as industry IoT, e-health, distance learning, smart city, smart-metering. All these new use cases are centred on an IP-based infrastructure. A promising alternative to satisfy the demand for resources is to incorporate a new delivery mechanism that can alleviate the congestion of classical cell-based point-to-point broadband wireless infrastructures. The best-positioned candidate is the next-generation Digital Terrestrial Television system, which offers a very spectrum efficient one-to-many PHY, and for the first time, native IP support. In ATSC 3.0, the whole system was designed with an IP-centric view, whereas DVB has created standards to deliver services to generic IP devices (DVB-I). Nevertheless, there is still a last missing piece to bring the broadcast infrastructure to the IP-connected world: a Broadcast Core Network (BCN). In this paper, the basics of a BCN are presented with new use cases that are attractive to Broadcast Network Operator (BNO). A possible roadmap towards implementation is described, and a service-based architecture for a BCN is presented and discussed. [ABSTRACT FROM AUTHOR]

This paper describes systems, devices, and methods to implement a bi-directional integrated inter-tower wireless communications network (IITWCN). The described technology can be implemented in combination with the Broadcast Core Network (BCN) in next generation broadcast eco-system and, therefore, support new business cases for broadcast operators such as the delivery of flexible datacasting services or support broadcast or point-to-point Internet services. The introduced bi-directional inter-tower communications network (ITCN) extends the previous unidirectional in-band distribution links (IDL) and adopts the on-channel repeater (OCR) as a simplified backhaul solution in single frequency networks (SFN). The concept of the coordinated ITCN is also presented, aiming at future broadcast Internet services. The ITCN provides a scalable and configurable network solution embedded in a broadcast system, which becomes independent from any non-broadcasting telecommunication infrastructure. The described technology partially relies on the infrastructure of the underlying broadcast/multicast network, using the allocated service channels without requiring additional frequency bands or a separate frequency band. The bi-directional inter-transmitter communication links are therefore referred to as integrated transmission links and the corresponding network as an integrated network. [ABSTRACT FROM AUTHOR]

In Multimedia Broadcast/Multicast Service(MBMS), Multicast/Broadcast Single Frequency Network (MBSFN) and Single-cell Point-to-multipoint Network (SC-PTM) are two essential ways to organize networks to provide multicast services. MBSFN shows its unique advantage of enhancing signals at the boundary of two cells, however, highly requiring synchronization of symbols. SC-PTM shows the advantage of the flexibility on the network deployment. The comparison and complementarity of these two modes are explored. In this paper, we analyze the reception performance of MBSFN and SC-PTM from multiple perspectives. We first compare the successful transmission probability (STP) of MBSFN with that of SC-PTM. Then, we consider optimal power control problems in MBSFN and SC-PTM. The corresponding power control optimization problems are with fraction and max-min forms and solved by the Dinkelbach algorithm. Furthermore, we propose a joint mode-selection and power-control method in the hybrid mode of MBSFN and SC-PTM, where each cell could select the multicast mode from MBSFN and SC-PTM. This is a mixed-integer nonlinear programming (MINLP) problem and solved by the concave-convex procedure (CCCP) and the Dinkelbach algorithm. To further improve the throughput, the appropriate successful reception proportion is selected under the opportunistic multicast. Finally, the numerical simulations show the performance of our algorithms and compare the throughput of two modes, which verify our analysis. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive broadcast interval for data dissemination for an infrastructure-to-vehicle (I2V) environment. The roadside units (RSUs) disseminate the data to the vehicles after a specified broadcast time interval. Time interval tuning for the data dissemination is one of the parameters used to determine the effectiveness of the broadcast time interval at RSU for safety and infotainment message dissemination to the vehicles under a particular RSU coverage. We formulated the problem of computing an optimal broadcast time interval to maximize the service ratio, reducing the duplicate message overhead. The proposed scheme uses the software-defined network (SDN) architecture having OpenFlow-enabled RSUs and SDN controllers. Based on the global view of traffic-related information, the proposed SDN controller computes the broadcast time interval for data dissemination among the vehicles. We used the NS-3 simulator to evaluate the proposed scheme's performance by generating a real scenario of VANET traffic using SUMO. Simulation results show that the proposed SDN-based scheme increases the average service ratio by 15-20% and reduces duplicate message overhead by 7-10% in comparison to the other existing state-of-the-art schemes. [ABSTRACT FROM AUTHOR]

Quality of experience (QoE) that serves as a direct evaluation of viewing experience from the end users is of vital importance for network optimization, and should be constantly monitored. Unlike existing video-on-demand streaming services, real-time interactivity is critical to the mobile live broadcasting experience for both broadcasters and their audiences. While existing QoE metrics that are validated on limited video contents and synthetic stall patterns have shown effectiveness in their trained QoE benchmarks, a common caveat is that they often encounter challenges in practical live broadcasting scenarios, where one needs to accurately understand the activity in the video with fluctuating QoE and figure out what is going to happen to support the real-time feedback to the broadcaster. In this paper, we propose a temporal relational reasoning guided QoE evaluation approach for mobile live video broadcasting, namely TRR-QoE, which explicitly attends to the temporal relationships between consecutive frames to achieve a more comprehensive understanding of the distortion-aware variation. In our design, video frames are first processed by deep neural network (DNN) to extract quality-indicative features. Afterwards, besides explicitly integrating features of individual frames to account for the spatial distortion information, multi-scale temporal relational information corresponding to diverse temporal resolutions are made full use of to capture temporal-distortion-aware variation. As a result, the overall QoE prediction could be derived by combining both aspects. The results of experiments conducted on a number of benchmark databases demonstrate the superiority of TRR-QoE over the representative state-of-the-art metrics. [ABSTRACT FROM AUTHOR]

Beacon broadcasting is of great importance in improving road safety and avoiding dangerous situations in vehicular ad hoc networks (VANETs). In order to support emerging vehicular applications such as autonomous driving, the reliability of beacon broadcasting becomes an indispensable issue which is also difficult given the highly dynamic topology and vehicle density. For the territories which are not covered with communication infrastructure, controlling and scheduling in a centralized way may not be applicable. Therefore, vehicle-to-vehicle (V2V) ad hoc communication is promising to address the ubiquitousness coverage concern. In this paper, a distributed network coding-based medium access control protocol (NC–MAC) is proposed to support V2V beacon broadcasting. We combine the preamble-based feedback mechanism, retransmissions, and network coding together to enhance broadcasting reliability. Extensive simulations are given to show the performance gain of NC–MAC protocol compared to the existing 5 G cellular vehicle-to-everything (C–V2X) MAC protocol in a wide range of scenarios including highway and urban vehicle traces generated by simulation of urban mobility (SUMO). The results show that the proposed protocol can improve the communication reliability as well as scalability. [ABSTRACT FROM AUTHOR]

Multi-layer broadcast systems distribute services across time and frequency domain by means of power-division multiplexing. Successive interference cancelation is required, in general, in order to extract the content of all services. For a low-complexity implementation, the receiver can obtain the strongest (top-layer) signal assuming underlying signals to behave like thermal noise. The thermal noise assumption may not be valid under certain conditions and a more accurate characterization of the interference could bring improved performance. This paper analyzes the validity of the noise-like assumption considering the power ratio between signals and the required carrier-to-noise ratio for error-free reception. The main contribution of the paper is the proposal of a demapping algorithm that exploits the knowledge of the constellation of underlying signals. Generalized mutual information, performance evaluation, and complexity analysis are provided with the additive white Gaussian noise-like assumptions and with the proposed alternative in order to assess the potential performance improvements that can be achieved. [ABSTRACT FROM AUTHOR]

The era of the fifth-generation (5G) New Radio (NR) technology has just begun, and its promises to substantially improve the system performance have turned into reality. The 5G NR enabled Non-Terrestrial Network (NTN) is almost upon us and will represent an effective solution to provide services anytime, anywhere, and over wider coverage areas. In this context, high throughput satellite systems with advanced multi-beam transmissions have gained significant attention owing to their ability to boost the system capacity through beam frequency re-use, increased user data rates, and system spectral efficiency. In this paper, we propose a novel radio resource management scheme, named Single-Frequency Multi-Beam Transmission (SF-MBT), for efficient delivery of the enhanced Mobile Broadband (eMBB) services over the 5G NR multi-beam NTN systems. The main thinking is to group beams into the dedicated Beam Areas, wherein a certain content flow is delivered via simultaneous multi-beam transmissions over the same radio resources without causing inter-beam interference. A simulation campaign is conducted under different scenarios to assess the effectiveness of the proposed SF-MBT algorithm as compared to the current schemes based on frequency reuse. System-wide performance is evaluated in terms of the aggregate data rate, mean throughput, and system spectral efficiency. [ABSTRACT FROM AUTHOR]

To meet the ever increasing demand for better service quality and availability, the next generation digital TV (DTV) broadcast, a.k.a., the ATSC 3.0, is developed with new capabilities to deliver 4K ultra-high-definition (4K-UHD) services to fixed receivers, robust HD-quality services to mobile receivers, as well as non-broadcast services (e.g., broadband), including Internet of Things (IoT), Connected Vehicles, etc. To realize these capabilities, it becomes necessary to evolve the existing single-transmitter high-power-high-tower (HPHT) network to multi-transmitter low-power-low-tower single-frequency-networks (SFN), which requires installing new transmitters. Each new transmitter needs a feederlink to receive the service data from the broadcast gateway (BG) for transmission. This feederlink contributes to a significant portion of installation and operational costs of the new transmitters. This paper proposes a wireless in-band distribution link (WIDL) technology, where the distribution data is delivered to the newly deployed transmitters from the existing DTV towers wirelessly sharing the same TV band with the broadcast services. The distribution signal is multiplexed with service signal in the same ATSC 3.0 waveform. Layered division multiplexing (LDM) technology is proposed to achieve more efficient transmission of the distribution signal. The WIDL offers better performance and more robust operation than the on-channel repeater (OCR) technologies. More importantly, it offers the possibility of delivering backhaul data for future applications over the DTV infrastructure, such as IoT and connected vehicles. Therefore, the proposed WIDL is one enabling technology to achieve convergence of broadcast services with broadband and other wireless services on the DTV spectrum. [ABSTRACT FROM AUTHOR]

Efficiency of position-based emergency message broadcast protocols of Vehicular Ad-hoc Networks (VANET) is affected by the position of vehicles that depends entirely on accuracy of the positioning system. In addition, GPS-based dissemination protocols encounter many challenges due to high-energy consumption, low accuracy, and the need for up-to-date maps for real-world automatic applications. In this paper, a Route Segmented Broadcast Protocol based on Radio Frequency identification technology (RSBP-RF) is proposed to eliminate GPS-based problems and increase the efficiency of emergency message broadcasting by improving the positioning accuracy. In this protocol, embedded passive RFID tags are used to segment the route and provide a position-aware technique. In RSBP-RF, each vehicle is informed of its position by crossing on the tags and immediately broadcasts a beacon to its neighbors. Moreover, the proposed protocol includes a proactive relay vehicle selection scheme that uses the received beacons to select the farthest neighboring node. The results of the conducted simulations in the NS-3 tool have validated the effectiveness of the proposed protocol in terms of end-to-end delay, delivery ratio, one-hop delay, collision ratio, relay node selection accuracy, and dissemination performance. Moreover, analysis of the time complexity and message complexity proves the lightness of the RSBP-RF protocol. [ABSTRACT FROM AUTHOR]

This paper analyzes reliability and quality gains that can be achieved by a broadcast-unicast convergent platform operating in non-orthogonal multiple access (NOMA)-based cellular networks. The analysis is addressed in network scope, dealing with randomly distributed users and base stations (BSs) within a stochastic geometry framework. Additionally a well-known Zipf-distribution popularity model on user demands is also taken into account, which effectively reflects a broadcasting gain from reducing redundant resource expense toward the users demanding same contents. Based on the stochastic modeling, closed-form delivery success probabilities and the consequent transmission rates are analytically derived, where the derivations are obtained separately for the networks with different access control strategies. Furthermore, the optimal broadcast content selection strategy maximizing the transmission rates is proposed. By means of numerical calculations, NOMA is shown to achieve substantial gain at broadcast/unicast joint transmission compared to the conventional orthogonal multiple access (OMA) network, particularly for the service configuration with popular contents having lower target service rates than less popular contents as long as the number of broadcast programs is restricted to be equal to the number of unicast services in a single frame. [ABSTRACT FROM AUTHOR]

This paper tackles a non-orthogonal multiplexing (NOM)-based realization of broadcast-unicast overlay transmission in cloud-radio access networks (C-RANs). In particular, fronthaul compression and precoding are jointly optimized to maximize the throughput in the considered network. The problem further optimizing the power allocation between broadcast and unicast signals is addressed as well. The algorithmic solutions are obtained by means of majorization minimization (MM)-type difference-of-convex (DC) programming. Moreover, the proposed solutions are further extended to cope with the uncertainty of channel state information (CSI) to enable robust transmission. Computer simulations are performed to verify that the proposed scheme attains substantial achievable rate gain over the conventional decentralized precoding in entire parameter regions considered. [ABSTRACT FROM AUTHOR]

This paper investigated the psychological effects of viewing ultra-high-resolution images. Many subjective evaluation experiments assessing the quality of images have been conducted. However, the psychological effects of viewing ultra-high-resolution images have not been well investigated, especially under non-standard viewing conditions. Although a higher image resolution has been reported to affect the sense of realness, more impressive factors that appeal to the general viewers have not been examined. This paper conducted subjective evaluation experiments, in which images with different resolutions using familiar subjects were presented to viewers with practical viewing distances, and their ratings of impressions were obtained. In addition, we examined the relationship between higher- and lower-order impressions. We found an enhancement of the impressions of “beautiful” or “delicious” with an increase in the resolutions of the presented images. Furthermore, the tendency of this impression enhancement was observed even when viewing it as far as four times the design viewing distance. The results of multiple regression analyses provide insight on the production and processing of ultra-high-resolution images for impression enhancement. [ABSTRACT FROM AUTHOR]

This paper deals with the secure communication issues of wireless cooperative networks in the presence of multiple friendly but selfish intermediate nodes. On account of the broadcast nature of wireless communications, it is assailable to malicious eavesdropping. To tackle this challenge in the paper, we present a relay and jammer selection strategy that selects the jammer and relay nodes from intermediate nodes to improve the security of the eavesdropping attacks. The jammer is used to broadcast artificial interference noise on the eavesdropper. The relay acts as a traditional relay that retransmits source signal from the source to the intended destination. For achieving the maximum secrecy capacity by the selected nodes, we introduce a power allocation approach of intermediate nodes that is formulated as a Bertrand game based on price competition. We prove that an optimal pricing scheme can maximize the secrecy capacity and achieve the optimal profits for the selfish friendly nodes. Then, a new particle swarm with simulated anneal optimization algorithm is employed to obtain the solution of pricing and node selection. Finally, the simulation results verify our theoretical analysis. [ABSTRACT FROM PUBLISHER]

In wireless broadcast, random linear network coding (RLNC) over GF($2^{L}$) is known to asymptotically achieve the optimal completion delay with increasing $L$. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF($2^{L}$). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF($2^{L}$). Based on both theoretical and numerical analyses, the new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2). [ABSTRACT FROM AUTHOR]

This paper proposes the integration of non-orthogonal multiple access (NOMA) and broadcasting with buffer-aided (BA) full-duplex (FD) relaying to improve the spectral efficiency of a single-source two-user network. Furthermore, opportunistic relay selection is employed, activating one or two FD relays to support the end-to-end communication. The network performance is improved through buffers, allowing to switch to half-duplex (HD) transmission/reception when FD operation is not feasible. A hybrid BA FD/HD NOMA relay selection algorithm is proposed, herein called $\mathop {\mathrm{BAHyNOMA}}$ , orchestrating the three aforementioned techniques, towards a simple yet efficient and robust relay selection. $\mathop {\mathrm{BAHyNOMA}}$ is evaluated in terms of outage probability, average sum-rate and average delay, and it is observed that the average sum-rate can be doubled, while maintaining low latency. [ABSTRACT FROM AUTHOR]

Channel Inversion, and its Minimum Mean Square Error (MMSE) variation, are low complexity methods for Space Division Multiple Access (SDMA) in Multiple Input Multiple Output Broadcast Channel (MIMO-BC). As the channel matrix deviates from orthogonal, these methods result in a waste of transmit power. This paper proposes a trellis precoding method (across time and space) to improve the power efficiency. Adopting a 4-state trellis shaping method from [1], the complexity of the proposed method, which is entirely at the transmitter side, is equivalent to the search in a trellis with 4N states where N is the number of transmit antennas. Numerical results are presented showing that the achievable gains, which depend on the channel realization, can be significantly higher than the traditional shaping gain which is limited to 1.53dB. [ABSTRACT FROM AUTHOR]

This correspondence considers communication over two Gaussian channels with additive state interference anti noiseless output feedback-the multiple access channel (MAC) and the augmented broad- cast channel (ABC) (a special class of the physically degraded broadcast channel). The state interference is assumed to be available noncausally at the transmitters. Deterministic coding schemes for these two channels were suggested by Ozarow when there is no state present. Recently, Merhav and Weissman derived an optimal feedback coding scheme for the single-user Gaussian channel with additive state interference. Combining ideas from these two schemes, we extend Ozarow's coding algorithms to the state-dependent case, showing that the capacity regions of the MAC and the ABC are not affected, even though not all parts of the system have knowledge of the state. The proposed schemes attain a better error performance and reduce the coding complexity with respect to the standard random binning coding technique. [ABSTRACT FROM AUTHOR]

In this correspondence, we show that solutions to the multiple description coding problem and the broadcast channel coding problem share a common encoding procedure: successive source encoding. We use this connection as the basis for establishing connections between the achievable multiple description rate region and Marton's region for broadcast channels. Specifically, we show that Marton's encoding scheme can be viewed as a multiple description coding procedure. We also explore the dual problem, namely, the relationship between successive channel decoding in multiple access communication and distributed source coding. By illuminating these connections to multiple description, we hope to motivate a solution to what remains a mostly unsolved problem. [ABSTRACT FROM AUTHOR]

Owning the merits of flexible networking, rapid deployment, strong line-of-sight communications and so on, Unmanned Aerial Vehicle (UAV) has been regarded as a promising technology for the Fifth-Generation (5G) wireless network to realise its ambition of ubiquitous connectivity to support the various applications, e.g., broadcasting/multicasting services. However, the unique features of the UAV systems, e.g., highly agile mobility in the three-dimensional space, and the significant size, weight and power constraints, pose new challenges for 5G broadcasting communications. In order to fully harvest the benefits of UAV-aided 5G communications for broadcasting services, a new position based lightweight beamforming technology is proposed in this paper to enhance the capability of signal reception in 5G UAV broadcasting communications. Instead of relying on the channel estimation to form beams, which would cause significant broadband consumption, the position and mobility information of UAV system is exploited to predict UAV movement and form narrow beams to track UAV for signal enhancement and interference cancellation. To flight against the inherent position error, a new position correction method is designed to jointly utilise the DoA information of 5G system and the position information of the UAV system. Comprehensive simulation experiments are conducted based on 3GPP 5G specifications and the results show that the proposed algorithm outperforms the benchmark Zero-Forcing (ZF) without position prediction and position-based beamforming without position correction. [ABSTRACT FROM AUTHOR]