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]

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 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]

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]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

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.

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [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]

An introduction is presented in which the editor discusses articles in the issue on topics including self-plagiarism.

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

Recent research has shown that frequency domain pre-equalization (FDPE) can provide broadcast transmissions over multi-input multi-output (MIMO) frequency selective channels, where the multiple receivers need limited processing. In this paper, we consider the combination of FDPE with parallel and successive Tomlinson-Harashima Precoding (THP) and propose two novel FDPE MIMO schemes, which are referred to as FDPE-P-THP and FDPE-S-THP, respectively, based on the minimum mean square error (MMSE) criterion. The ordering algorithm in the FDPE-S-THP scheme is considered and it is shown that the system with even a randomly selected order can perform almost as well as that with the optimal one. This paper further develops an accurate theoretical performance analysis methodology for the proposed FDPE-THP schemes. Numerical results along with analytical results demonstrate the significant performance improvement of our proposed schemes compared to the conventional FDPE MIMO schemes. The channel estimation errors and channel variation effects on the proposed system are also investigated. It is shown that the performance degradation due to channel variation can be efficiently reduced by applying channel prediction. [ABSTRACT FROM AUTHOR]

Provides instructions and guidelines to prospective authors who wish to submit manuscripts. [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]

The article offers information on Institute of Electrical and Electronics Engineers (IEEE) Transactions on Broadcasting information for authors. Topics include the multiple submissions to different journals are unacceptable and are subject to disciplinary actions, and the IEEE electronic publishing format process enables authors to submit their initial manuscripts.

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 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]

Considers a multiuser multiple-input multiple-output (MIMO) Gaussian broadcast channel, where the transmitter and receivers have multiple antennas. MIMO capacity region; Computational complexity required for obtaining the dirty paper achievable region.

Cooperative vehicle safety (CVS) systems have been receiving significant attention as key enablers of important intelligent transportation system (ITS) applications, such as cooperative collision warning, emergency braking, and auto driving. In CVS systems, vehicles periodically broadcast short packets that include various types of vehicular information, e.g., position and speed. In this paper, we propose an optimization method for the broadcast rate in vehicle-to-vehicle (V2V) broadcast communications at an intersection based on theoretical analysis. We consider a model in which the locations of vehicles are modeled separately as queuing, and running segments and derive key performance metrics of V2V broadcast communications through a stochastic geometry approach. We develop closed-form approximate formulas for the theoretical expressions because they are mathematically intractable. Based on approximate analysis, we optimize the broadcast rate such that the interference at an intersection is mitigated and the overall performance of V2V communications is maximized. Because of the closed-form approximation, the optimal rate can be used as a guideline for a real-time control-method, which cannot be achieved through time-consuming simulations. We evaluate our method through numerical examples and demonstrate its effectiveness. [ABSTRACT FROM AUTHOR]

The article offers information on the call for paper for the 11th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (TELSIKS) 2013 to be held at the Faculty of Electronic Engineering of the University of Niš in Serbia on October 16-19, 2013.

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]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

Sending broadcast messages is an efficient means of communicating in emergency situations, especially during serious disasters. This paper focuses on the digital audio broadcast (DAB) system. First, several new techniques are reported to enhance the emergency warning message (EWM) receiving and display functionalities for both personal and public DAB terminals. Then, a novel bidirectional communication method between two DAB transmitters is proposed, to enable the communication to and from the disaster area and the outside. Experiments show that the EWM can be correctly sent to the intended DAB terminals within 0.2–3 s, and the existing public light emitting diode screens can be expanded as DAB EWM terminals without affecting their normal functions. The bidirectional multimedia communication between two DAB transmitters is also successfully demonstrated. The proposed techniques expand upon the DAB’s existing functionality, and can benefit more people during emergencies. [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]

This paper presents a novel bluetooth low energy (BLE) protocol enabling a BLE node to perform RF fingerprint acquisition by measuring the received signal strength (RSS) from its neighboring nodes and simultaneously broadcast the acquired fingerprint via its advertising packet. However, the fingerprint acquisition and broadcast process in a dense BLE network is very challenging owing to: 1) the likelihood of packet collision; and 2) the length-constrained packet. To this end, we exploit a compressive sensing (CS) framework allowing each node to acquire no more than $M$ M measurements from a very dense network, in which the number of nodes $N$ N is far greater than $M$ M . By aggregating the $M$ M -dimensional compressed fingerprint vector from $s

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 Fifth generation of mobile broadband (BB) networks, popularly known as 5G, aims to revolutionize different vertical industries, including media broadcasting. Although it remains to be seen the real impact and timescale of the 5G revolution, 5G may represent an opportunity rather than a threat for broadcast (BC), especially when considering new approaches for BC and BB evolving into new converged platforms inter-connecting terrestrial BC and cellular/wired BB systems together [item 1) in the Appendix]. Hybrid BC-BB platforms are already a success in several countries, based, e.g., on HbbTV in EU, hybridcast in Japan and Ginga in Brazil. But the increasing importance of fixed and mobile BB IP delivery for television services, well-illustrated by the new IP-based ATSC 3.0 standard [item 2) in the Appendix] and the on-going DVB-I (Internet) specification, and the fact that the 5G system will support and be interoperable with non-3GPP access technologies, potentially allowing multiple access technologies to be used simultaneously for one or more services, opens the door to new convergence scenarios. [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]

Index coding studies multiterminal source-coding problems where a set of receivers are required to decode multiple (possibly different) messages from a common broadcast, and they each know some messages a priori. In this paper, at the receiver end, we consider a special setting where each receiver knows only one message a priori, and each message is known to only one receiver. At the broadcasting end, we consider a generalized setting where there could be multiple senders, and each sender knows a subset of the messages. The senders collaborate to transmit an index code. This paper looks at minimizing the number of total coded bits the senders are required to transmit. When there is only one sender, we propose a pruning algorithm to find a lower bound on the optimal (i.e., the shortest) index codelength, and show that it is achievable by linear index codes. When there are two or more senders, we propose an appending technique to be used in conjunction with the pruning technique to give a lower bound on the optimal index codelength; we also derive an upper bound based on cyclic codes. While the two bounds do not match in general, for the special case where no two distinct senders know any message in common, the bounds match, giving the optimal index codelength. The results are expressed in terms of strongly connected components in directed graphs that represent the index-coding problems. [ABSTRACT FROM AUTHOR]

This paper presents a cache-based popular services pushing solution on high-speed train (HST) by using converged wireless broadcasting and cellular networks. Pushing and caching popular services on the HST to improve the capacity of the network is a very efficient way; and it can also bring a better user experience. The most popular services are transmitted and cached on the vehicle relay station of the train ahead the departure time in the proposed model. Then, the most popular services are broadcasted and cached on the User Equipment after all the passengers are on the train; the less popular services are delivered to the passengers by P2P mode through the relayed cellular network on the train. Specifically, we firstly use the dynamic programming algorithm to maximize the network capacity in limited pushing time, which can be converted to the 0–1 Knapsack problem. Furthermore, we propose three greedy algorithms to approximate the optimal solution on account of the high time complexity of dynamic programming when the input scale gets bigger. And simulation results show that the proposed popularity-based greedy algorithm performs well. Moreover, as the passengers may get on and off the HST when arriving at an intermediate station, a services rebroadcast algorithm is employed when more intermediate stations are considered. U-shaped distribution is adopted to indicate the number of passengers getting on and off the train. Simulations also show that the proposed rebroadcast algorithm can efficiently improve the capacity of the converged networks. [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]

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]

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]

In this paper, we study linear encoding for a pair of correlated Gaussian sources transmitted over a two-user Gaussian broadcast channel in the presence of unit-delay noiseless feedback, abbreviated as the GBCF. Each pair of source samples is transmitted using a linear transmission scheme in a finite number of channel uses. We investigate three linear transmission schemes: A scheme based on the Ozarow–Leung (OL) code, a scheme based on the linear quadratic Gaussian (LQG) code of Ardestanizadeh et al., and a novel scheme derived in this paper using a dynamic programming (DP) approach. For the OL and LQG schemes we present lower and upper bounds on the minimal number of channel uses needed to achieve a target mean-square error (MSE) pair. For the LQG scheme in the symmetric setting, we identify the optimal scaling of the sources, which results in a significant improvement of its finite horizon performance, and, in addition, characterize the (exact) minimal number of channel uses required to achieve a target MSE. Finally, for the symmetric setting, we show that for any fixed and finite number of channel uses, the DP scheme achieves an MSE lower than the MSE achieved by either the LQG or the OL schemes. [ABSTRACT FROM AUTHOR]

This paper focuses on the problem of broadcasting information in the most efficient manner in a large 2-D ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed, where source nodes first broadcast their data to the entire network, despite the lack of sufficient available power. The signal’s power is then reinforced via successive back-and-forth beamforming transmissions between different groups of nodes in the network, so that all nodes are able to decode the transmitted information at the end. This scheme is shown to achieve asymptotically the broadcast capacity of the network, which is expressed in terms of the largest singular value of the matrix of fading coefficients between the nodes in the network. A detailed mathematical analysis is then presented to evaluate the asymptotic behavior of this largest singular value. [ABSTRACT FROM PUBLISHER]

Broadcasting is an essential operation in wireless networks for disseminating the message from the source node to all other nodes. Unfortunately, the problem of Minimum Latency Broadcast Scheduling (MLBS) in duty-cycled wireless sensor networks is not well studied. In existing works, the construction of broadcast tree and the scheduling of transmissions are conducted separately, where a tree-based structure is used as the input of the scheduling algorithm. Relying on a pre-determined tree may result in a much large latency even using the optimal scheduling method. Thus, the MLBS problem in duty-cycled WSNs without the above limitation is investigated in this paper. First, to avoid relying on a pre-determined structure, a two-step scheduling algorithm is proposed to construct the broadcast tree and compute a collision-free schedule simultaneously. To the best of our knowledge, this is the first work that can integrate these two kinds of operations together. Second, a novel transmission mode, i.e., concurrent broadcasting, is first introduced for wireless networks and several techniques are designed to further improve the broadcast latency. Third, the multiple messages broadcasting and all-to-all broadcasting algorithms, which can generate a series of broadcast schedules independently without a pre-determined tree, are also proposed by taking care of the collisions in both the current and the previous broadcast schedules. Finally, the theoretical analysis and experimental results demonstrate the efficiency of the proposed algorithms in terms of latency. [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]

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]

STiMi is a mobile multimedia broadcasting trade standard that was released by the Chinese State Administration of Radio Film and Television in 2006. This paper details the algorithm research and development work on the acquisition for STiMi. First, the STiMi physical layer is briefly reviewed. secondly, individual algorithms, including time slot detection, fractional frequency offset estimation, integer frequency offset estimation and fine timing synchronization are discussed with simulation results presented. An implemented STiMi receiver prototype is also introduced with a focus on the acquisition algorithms implementation. Finally, the whole acquisition procedure is summarized. Acquisition algorithms and structures presented in this paper are adopted for prototyping and perform well. [ABSTRACT FROM AUTHOR]

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 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]

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]