Search arXivSearch

arXiv · 1906.07761

Cooperative Rate-Splitting for MISO Broadcast Channel with User Relaying, and Performance Benefits over Cooperative NOMA

Abstract

Due to its promising performance in a wide range of practical scenarios, Rate-Splitting (RS) has recently received significant attention in academia for the downlink of communication systems. In this letter, we propose and analyse a Cooperative Rate-Splitting (CRS) strategy based on the three-node relay channel where the transmitter is equipped with multiple antennas. By splitting user messages and linearly precoding common and private streams at the transmitter, and opportunistically asking the relaying user to forward its decoded common message, CRS can efficiently cope with a wide range of propagation conditions (disparity of user channel strengths and directions) and compensate for the performance degradation due to deep fading. The precoder design and the resource allocation are optimized by solving the Weighted Sum Rate (WSR) maximization problem. Numerical results demonstrate that our proposed CRS scheme can achieve an explicit rate region improvement compared to its non-cooperative counterpart and other cooperative strategies (such as cooperative NOMA).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Zhang, Bruno Clerckx, Jianhua Ge, Yijie Mao. 2019-10-25. Cooperative Rate-Splitting for MISO Broadcast Channel with User Relaying, and Performance Benefits over Cooperative NOMA. https://doi.org/10.1109/lsp.2019.2942994

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT