Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1605.01184

Optimal DoF Region for the Asymmetric Two-Pair MIMO Two-Way Relay Channel

Kangqi Liu·Meixia Tao·Xiaojun Yuan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the optimal degrees of freedom (DoF) region for the two-pair MIMO two-way relay channel (TWRC) with asymmetric antenna setting, where two pairs of users exchange information with the help of a common relay. Each user $i$ is equipped with $M_i$ antennas, for $i=1,2,3,4$, and the relay is equipped with $N$ antennas. First, we derive an outer bound of the DoF region by using the cut-set theorem and the genie-message approach. Then, we propose a new transmission scheme to achieve the outer bound of the DoF region. Due to the asymmetric data exchange, where the two users in each pair can communicate a different number of data streams, we not only need to form the network-coded symbols but also need to process the additional asymmetric data streams at the relay. This is realized through the joint design of relay compression matrix and source precoding matrices. After obtaining the optimal DoF region, we study the optimal sum DoF by solving a linear programming problem. From the optimal DoF region of this channel, we show that in the asymmetric antenna setting, some antennas at certain source nodes are redundant and cannot contribute to enlarge the DoF region. We also show that there is no loss of optimality in terms of the sum DoF by enforcing symmetric data exchange, where the two users in each pair are restricted to communicate the same number of data streams.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kangqi Liu, Meixia Tao, Xiaojun Yuan. 2016-05-04. Optimal DoF Region for the Asymmetric Two-Pair MIMO Two-Way Relay Channel. https://doi.org/10.1109/tsp.2016.2639458

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗