Presents the table of contents for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

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

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

This page or pages intentionally left blank.

Presents the table of contents for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

This page or pages intentionally left blank.

An $m\times (k+r)$ binary maximum distance separable (MDS) array code contains $k$ information columns and $r$ parity columns with each entry being a bit, where any $k$ out of $k+r$ columns can recover the $k$ information columns. When there is a failed column, it is critical to minimize the repair bandwidth that is the total number of bits downloaded from $d$ out of $k+r-1$ surviving columns in repairing

The traffic in wireless networks has become diverse and fluctuating both spatially and temporally due to the emergence of new wireless applications and the complexity of scenarios. The purpose of this paper is to quantitatively analyze the impact of the wireless traffic, which fluctuates both spatially and temporally, on the performance of the wireless networks. Specially, we propose to combine the

A method for construction of polar subcodes with reduced error coefficient is presented. The proposed approach relies on explicit enumeration of low-weight non-zero codewords in a polar code, and construction of dynamic freezing constraints which define a subcode not containing most of these codewords. The obtained codes provide a large performance gain in the high-SNR region compared to non-optimized

Reconfigurable intelligent surface (RIS) technique stands as a promising signal enhancement or signal cancellation technique for next generation networks. We design a novel passive beamforming weight at RISs in a multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) network for simultaneously serving paired users, where a signal cancellation based (SCB) design is employed. In

Multi-user spatial modulation (SM) assisted by sparse code multiple access (SCMA) has been recently proposed to provide uplink high spectral efficiency transmission. The message passing algorithm (MPA) is employed to detect the transmitted signals, which suffers from high complexity. This paper proposes three low-complexity algorithms for the first time to the SM-SCMA. The first algorithm is referred

This article considers the resource allocation algorithm design for downlink multiple-input single-output (MISO) orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) systems. To meet the stringent delay requirements of URLLC, short packet transmission is adopted and taken into account for resource allocation algorithm design. The resource allocation

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

Since the inherent serial nature of successive cancellation list (SCL) decoding results in a long latency, belief propagation (BP) decoding for polar codes has drawn attention for high-throughput applications. However, its error correction performance is inferior to that of SCL decoding. Therefore, the bit-flipping strategy has been recently applied to BP decoding, which can approach the SCL decoding

Massive multiple-input multiple-output (mMIMO) based grant-free random access (RA) (mGFRA) has been studied for massive machine-type communication (mMTC). In the existing works of mGFRA, it is implicitly assumed that each RA user equipment (UE) in mMTC has the same data-packet size. However, this may not be the case in practice as RA UEs in different applications can have different numbers of bits

We develop a comprehensive framework to characterize and optimize the performance of a unmanned aerial vehicle (UAV)-assisted D2D network, where D2D transmissions underlay cellular transmissions. Different from conventional non-line-of-sight (NLoS) terrestrial transmissions, aerial transmissions are highly likely to experience line-of-sight (LoS). As such, characterizing the performance of mixed aerial-terrestrial

In this article, we propose a downlink non-orthogonal multiple access (NOMA) based coordinated direct and relay system with one cell-center user and multiple cell-edge users, where a decode-and-forward (DF) relay bridges the connection between the base station and the cell-edge users. Both full-duplex (FD) and half-duplex (HD) protocols are considered for the relay. We assume that the performance of

The explosion of the number of low-power devices in the next decades calls for a re-thinking of wireless network design, namely, unifying wireless transmission of information and power so as to make the best use of the RF spectrum, radiation, and infrastructure for the dual purpose of communicating and energizing. This article provides a novel learning-based approach towards such wireless network design

This paper investigates the control of a massive population of UAVs such as drones. The straightforward method of control of UAVs by considering the interactions among them to make a flock requires a huge inter-UAV communication which is impossible to implement in real-time applications. One method of control is to apply the mean field game (MFG) framework which substantially reduces communications

In this article, we propose a limited feedback-based space-shift keying (SSK) modulation scheme where transmitter (Tx) obtains partial channel state information (CSI) via a feedback link from receiver (Rx). More specifically, the Tx does not receive perfect information of channel gain, but is aware only of channel gain ordering. Based on the received partial CSI, the Tx adapts the spatial constellation

Device-to-device (D2D) communication is a promising solution to meet rapidly growing demands for data services via spectrum reuse. This paper studies the physical layer security in a D2D underlay cellular network from a network-wide perspective, where the locations of D2D and cellular users are modeled as Poisson cluster processes (PCPs) to characterize the clustering feature of D2D users, the locations

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound

In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even a single helper node can significantly increase the processing time. Therefore, coded distributed computing has been the subject of many recent studies. A problem that arises in some setups is that the master’s decoding complexity may exceed

This article investigates the downlink communications of intelligent reflecting surface (IRS) assisted non-orthogonal multiple access (NOMA) systems. To maximize the system throughput, we formulate a joint optimization problem over the channel assignment, decoding order of NOMA users, power allocation, and reflection coefficients. The formulated problem is proved to be NP-hard. To tackle this problem

We investigate error propagation in sliding window decoding of braided convolutional codes (BCCs). Previous studies of BCCs have focused on iterative decoding thresholds, minimum distance properties, and their bit error rate (BER) performance at small to moderate frame length. Here, we consider a sliding window decoder in the context of large frame length or one that continuously outputs blocks in

Semi-blind (SB) channel estimation is conceived for millimeter wave (mmWave) analog-beamforming (AB) and hybrid-beamforming (HB)-based multiple-input multiple-output (MIMO) systems, which also exploits the data symbols for improving the estimation accuracy. A novel aspect of the proposed framework is that it directly estimates the analog beamformer/ combiner weights without necessitating the estimation

Herein, we focus on an end-to-end design of a proactive cooperative caching strategy for a multi-cell network. The design is challenging as it involves two interrelated problems: the ability to predict future content popularity and to meet network operation characteristics. To this end, we first formulate a cooperative content caching in order to optimize the aggregated network cost for delivering

A common technique for the partial encryption of compressed images and videos encrypts only the sign bits of some syntax elements such as the quantized transform coefficients or the motion vector differences. The sign bit can be interpreted as the most significant bit (MSB) in the binary representation of the syntax element. Our work is motivated by the key observation that the binary code used for

We propose a two-dimensional modified min-sum algorithm for the LDPC codes in the fifth generation (5G) networks standard to approach the error performance of the sum-product algorithm (SPA). In the proposed decoding algorithm, we adopt a partial self-correction method followed by message amplification to improve the reliability of the variable-to-check (V2C) messages. To further approach the performance

The problem of designing polar-like codes for successive cancellation list (SCL) decoding algorithm is considered. A novel code design algorithm aimed to minimize both successive cancellation (SC) and maximum-likelihood (ML) decoding error probabilities is introduced. The algorithm performs optimization of a precoding matrix for the polarization transformation matrix to guarantee preselected minimum

Internet-of-things (IoT) applications continue to drive advancements in serving as many heterogeneous low-latency downlinks and uplinks as possible within a constrained communication bandwidth. Full-duplexing (FD) transceivers have been introduced to implement simultaneous signal transmission and reception (STR) over the entire available frequency band. However, both inter-link interference and FD

This article proposes an optimization framework for power and time resource allocation during time sharing non-orthogonal multiple access (TS-NOMA) transmissions performed by an unmanned aerial vehicle (UAV) in the context of a large-scale scenario. The objective of the proposed UAV-TS-NOMA system and optimization framework is to jointly maximize the energy efficiency (EE) and the downlink throughput

In this article, we propose and investigate hybrid active and passive antenna selection for backscatter-assisted multiple input and single output (MISO) systems. Specifically, each transmit antenna is allowed to work on either the active radio (AR) mode or the passive radio (PR) mode, which are respectively powered by the battery as in traditional communication and the external power source as in the

Pilot contamination is a limiting factor in multicell massive multiple-input multiple-output (MIMO) systems because it can severely impair channel estimation. Prior works have suggested coordinating pilot design across cells in order to reduce the channel estimation error caused by pilot contamination. In this paper, we propose a method for coordinated pilot design using fractional programming to minimize

Device-to-device (D2D) based packet caching technologies recently attract increasing attention, thanks to their great potentials to facilitate network traffic offloading. Despite the many popular issues arising in the D2D caching area, one of the new perspectives, namely the competition due to the packet request diversity originating from various D2D user equipment (UE) groups is not sufficiently investigated

Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of multi-antenna (Gaussian) BC with perfect CSIT is known and achieved by Dirty Paper Coding (DPC), the capacity and the capacity-achieving strategy of multi-antenna BC with imperfect

Thanks to the standards being developed by IEEE Time-Sensitive Networking (TSN) Task Group, the classical IEEE 802.1 Ethernet architecture is now enhanced to accommodate real-time and safety-critical requirements emerging in various cyber-physical systems. The deterministic nature of the communication is achieved through the time-triggered traffic, which requires introducing strict scheduling constraints

In this paper, fast fading Gaussian multiuser channels are considered. If the channel state information (CSI) is perfectly known to the transmitter, capacities have been derived for many cases in which the channels satisfy certain information-theoretic orders such as degradedness, or strong/very strong interference. We study the case when only the statistics of the CSI are known at the transmitter

Due to the advantages of flexible deployment and extensive coverage, unmanned aerial vehicles (UAVs) have significant potential for sensing applications in the next generation of cellular networks, which will give rise to a cellular Internet of UAVs. In this article, we consider a cellular Internet of UAVs, where the UAVs execute sensing tasks through cooperative sensing and transmission to minimize

With the rapid explosion of data volume from mobile networks, edge caching has received significant attentions as an efficient approach to boost content delivery efficiency by bringing contents near users. In this article, cache-enabled heterogeneous networks (HetNets) considering the limited backhaul are analyzed with the aid of the stochastic geometry approach. A hybrid caching policy, in which the

In this article, we investigate the dual-ascent inspired transmit precoding (TPC) for multiple-access spatial modulation (MASM) in multiple-input multiple-output (MIMO) systems. Note that several novel TPC techniques have been developed in earlier works, to provide a solution for either the maximal-minimum Euclidean distance, or the quadratically constrained quadratic program problems. However, numerical

A probabilistically robust transmit beamforming problem is referred, when the wireless downlink (DL) communication is supported by a robust non-orthogonal transmission (NOT)-aided design. Realistic imperfect channel state information (CSI) is considered in the face of rapidly fluctuating vehicular wireless channels, when the road side unit (RSU) communicates with multiple vehicles. Our design objective

Intelligent surfaces exert deterministic control over the wireless propagation phenomenon, enabling novel capabilities in performance, security and wireless power transfer. Such surfaces come in the form of rectangular tiles that cascade to cover large surfaces such as walls, ceilings or building facades. Each tile is addressable and can receive software commands from a controller, manipulating an

In this paper, we propose a generalized space-time block coded spatial modulation (GSTBC-SM) scheme for open-loop massive multiple-input and multiple-output (MIMO) downlink communication systems. Specifically, we firstly partition the information bits into multiple groups with each group modulated by the spatial modulation (SM), where the SM symbols are invoked for orthogonal STBC (OSTBC) and quasi-orthogonal

Recent Brain-Machine Interfaces have moved towards miniature devices that can be seamlessly integrated into the cortex. In this paper, we propose communication between miniature devices using light. A number of challenges exist using nanoscale light-based communication and this includes diffraction, scattering, and absorption, where these properties result from the tissue medium as well as the cell’s

In this paper, we propose a new construction of generalized root protograph (GRP) low-density parity-check (LDPC) codes which has a guaranteed diversity order. New hybrid-automatic request with incremental redundancy (H-ARQ-IR) is also proposed to ensure high diversity and rate-compatibility in wireless communication systems, where the GRP LDPC codes are employed along with a method called feedback

This article considers a wireless powered multiuser mobile edge computing (MEC) system, in which a multi-antenna hybrid access point (AP) wirelessly charges multiple users, and each user relies on the harvested energy to execute computation tasks. We jointly optimize the energy beamforming and remote task execution at the AP, as well as the local computing and task offloading, aiming to minimize the

The interpolation based algebraic soft decoding yields a high decoding performance for Reed-Solomon (RS) codes with a polynomial-time complexity. Its computationally expensive interpolation can be facilitated using the module structure. The desired Gröbner basis can be achieved by reducing the basis of a module. This paper proposes the low-complexity Chase (LCC) decoding algorithm using this module

In this article, we propose a three-dimensional (3D) multi-input multi-output (MIMO) channel model for air-to-ground (A2G) communications in unmanned aerial vehicles (UAV) environments, where the UAV transmitter and ground receiver are in motion in the air and on the ground, respectively. A novel angular estimation algorithm is proposed to estimate the real-time azimuth angle of departure (AAoD), elevation

Zigzag-decodable codes have been proposed for distributed storage systems to achieve fast decoding of uncoded data packets through the iterative decoding of data bits from coded packets. To maintain high data availability, it is critical to minimize the repair bandwidth by downloading the least amount of bits for repairing any lost packet. In this work, we propose zigzag-decodable reconstruction (ZDR)

The observed coherence times associated with different wireless transmitters at any given user may vary at different rates. We demonstrate how these variations can be exploited for interference management. More precisely, we propose a new opportunistic blind interference alignment (BIA) strategy in the context of $K$ -user interference channels that exploits these variations in coherence times and

Enhanced unipolar orthogonal frequency division multiplexing (eU-OFDM) and layered asymmetrically clipped optical OFDM (LACO-OFDM) are spectrally efficient modulation techniques for intensity modulated systems which layer multiple non-negative signals. In this paper, we propose absolute value layered asymmetrically clipped optical OFDM (ALACO-OFDM), which further improves the spectral efficiency while

This paper investigates the diversity gain of a distributed cyclic delay diversity (dCDD) scheme for cyclic-prefixed single carrier systems in non-identical fading channels. Non-identical small-scale fading is assumed in the environment, in which non-identical line-of-sight and non-line-of-sight fading coexist. A condition for dCDD resulting in intersymbol interference free reception at the receiver

We analyze the finite-length performance of spatially coupled low-density parity-check (SC-LDPC) codes under window decoding over the binary erasure channel. In particular, we propose a refinement of the scaling law by Olmos and Urbanke for the frame error rate (FER) of terminated SC-LDPC ensembles under full belief propagation (BP) decoding. The refined scaling law models the decoding process as two

We propose capacity-achieving schemes for private information retrieval (PIR) from uncoded databases (DBs) with both homogeneous and heterogeneous storage constraints. In the PIR setting, a user queries a set of DBs to privately download a message, where privacy implies that no one DB can infer which message the user desires. In general, a PIR scheme is comprised of storage placement and delivery designs

This paper presents a novel model-driven deep learning (DL) architecture, called TurboNet, for turbo decoding that integrates DL into the traditional max-log-maximum a posteriori (MAP) algorithm. The TurboNet inherits the superiority of the max-log-MAP algorithm and DL tools and thus presents excellent error-correction capability with low training cost. To design the TurboNet, the original iterative

We construct a bio-inspired nanomachine network via the quorum sensing (QS) mechanism and analyze that nanonetwork from the perspective of global synchronization time and channel capacity. We propose a realistic (stochastic) approach using birth-death-process-based bacterial growth model and compare it to a conventional ideal (deterministic) approach using exponentially-increased bacterial growth model