Resolving Persistent Packet Collisions through Broadcast Feedback in Cellular V2X Communication

The Third Generation Partnership Project (3GPP) Release 16 defines the sensing-based semi-persistent scheduling (SPS) as the resource allocation scheme for Sidelink Mode 2 in New Radio (NR)-based vehicle-to-everything (V2X) communication. A well-known issue in Mode 2 is the persistent packet collision that results from two or more vehicles repeatedly using the same resource for transmission. It may create serious safety problems when the vehicles are in a situation where only the broadcast safety beacons can assist in driving. To resolve this issue, a solution that relies on the feedback from neighboring vehicles is proposed, through which the vehicles suffering from persistent packet collisions can quickly part and select other resources. Extensive simulations show that the proposed broadcast feedback scheme reduces persistent packet collisions by an order of magnitude compared to SPS, and it is achieved without sacrificing the average packet reception ratio (PRR). Namely, it is the quality aspect (i.e., burstiness) of the packet collisions that the proposed scheme addresses rather than the quantity (i.e., total number of collision losses). By preventing extended packet loss events, the proposed scheme is expected to serve NR V2X better, which requires stringent QoS in terms of the information update delay thereby helping to reduce the chances of vehicle crashes.

Efficient Channel Feedback Scheme for Multi-User MIMO Hybrid Beamforming Systems

This paper proposes an efficient channel information feedback scheme to reduce the feedback overhead of multi-user multiple-input multiple-output (MU-MIMO) hybrid beamforming systems. As massive machine type communication (mMTC) was considered in the deployments of 5G, a transmitter of the hybrid beamforming system should communicate with multiple devices at the same time. To communicate with multiple devices in the same time and frequency slot, high-dimensional channel information should be used to control interferences between the receivers. Therefore, the feedback overhead for the channels of the devices is impractically high. To reduce the overhead, this paper uses common sparsity of channel and nonlinear quantization. To find a common sparse part of a wide frequency band, the proposed system uses minimum mean squared error orthogonal matching pursuit (MMSE-OMP). After the search of the common sparse basis, sparse vectors of subcarriers are searched by using the basis. The sparse vectors are quantized by a nonlinear codebook that is generated by conditional random vector quantization (RVQ). For the conditional RVQ, the Linde–Buzo–Gray (LBG) algorithm is used in conditional vector space. Typically, elements of sparse vectors are sorted according to magnitude by the OMP algorithm. The proposed quantization scheme considers the property for the conditional RVQ. For feedback, indices of the common sparse basis and the quantized sparse vectors are delivered and the channel is recovered at a transmitter for precoding of MU-MIMO. The simulation results show that the proposed scheme achieves lower MMSE for the recovered channel than that of the linear quantization scheme. Furthermore, the transmitter can adopt analog and digital precoding matrix freely by the recovered channel and achieve higher sum rate than that of conventional codebook-based MU-MIMO precoding schemes.

New Result on the Feedback Capacity of the Action-Dependent Dirty Paper Wiretap Channel

The Gaussian wiretap channel with noncausal state interference available at the transmitter, which is also called the dirty paper wiretap channel (DP-WTC), has been extensively studied in the literature. Recently, it has been shown that taking actions on the corrupted state interference of the DP-WTC (also called the action-dependent DP-WTC) helps to increase the secrecy capacity of the DP-WTC. Subsequently, it has been shown that channel feedback further increases the secrecy capacity of the action-dependent DP-WTC (AD-DP-WTC), and a sub-optimal feedback scheme is proposed for this feedback model. In this paper, a two-step hybrid scheme and a corresponding new lower bound on the secrecy capacity of the AD-DP-WTC with noiseless feedback are proposed. The proposed new lower bound is shown to be optimal (achieving the secrecy capacity) and tighter than the existing one in the literature for some cases, and the results of this paper are further explained via numerical examples.

Signaling receptor localization maximizes cellular information acquisition in spatially-structured, natural environments

Cells in natural environments like tissue or soil sense and respond to extracellular ligands with intricately structured and non-monotonic spatial distributions that are sculpted by processes such as fluid flow and substrate adhesion. Nevertheless, traditional approaches to studying cell sensing assume signals are either uniform or monotonic, neglecting spatial structures of natural environments. In this work, we show that spatial sensing and navigation can be optimized by adapting the spatial organization of signaling pathways to the spatial structure of the environment. By viewing cell surface receptors as a sensor network, we develop an information theoretic framework for computing the optimal spatial organization of a sensing system for a given spatial signaling environment. Applying the framework to simulated environments, we find that spatial receptor localization maximizes information acquisition in many natural contexts, including tissue and soil. Receptor localization extends naturally to produce a dynamic protocol for redistributing signaling receptors during cell navigation and can be implemented in a cell using a feedback scheme. In a simulated tissue environment, dynamic receptor localization boosts navigation efficiency by 30-fold. Broadly, our framework readily adapts to studying how the spatial organization of signaling components other than receptors can be modulated to improve cellular information processing.

A Capacity-Achieving Feedback Scheme of the Gaussian Multiple-Access Channel with Degraded Message Sets

The classical Schalkwijk–Kailath (SK) scheme for the point-to-point white Gaussian channel with noiseless feedback plays an important role in information theory due to the fact that it is capacity-achieving and the complexity of its encoding–decoding procedure is extremely low. In recent years, it has been shown that an extended SK feedback scheme also achieves the capacity region of the two-user Gaussian multiple-access channel with noiseless feedback (GMAC-NF), where two independent messages are, respectively, encoded by two intended transmitters. However, for the two-user GMAC-NF with degraded message sets (one common message for both users and one private message for an intended user), the capacity-achieving feedback scheme remains open. In this paper, we propose a novel two-step SK-type feedback scheme for the two-user GMAC-NF with degraded message sets and show that this scheme is capacity-achieving.