Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1712.03756

Low-Latency Multiuser Two-Way Wireless Relaying for Spectral and Energy Efficiencies

Zhichao Sheng·Hoang Duong Tuan·Trung Q. Duong·H. Vincent Poor·Yong Fang
View original source ↗Read source document ↗Export metadata ↓

Abstract

The paper considers two possible approaches, which enable multiple pairs of users to exchange information via multiple multi-antenna relays within one time-slot to save the communication bandwidth in low-latency communications. The first approach is to deploy full-duplexes for both users and relays to make their simultaneous signal transmission and reception possible. In the second approach the users use a fraction of a time slot to send their information to the relays and the relays use the remaining complementary fraction of the time slot to send the beamformed signals to the users. The inherent loop self-interference in the duplexes and inter-full-duplexing-user interference in the first approach are absent in the second approach. Under both these approaches, the joint users' power allocation and relays' beamformers to either optimize the users' exchange of information or maximize the energy-efficiency subject to user quality-of-service (QoS) in terms of the exchanging information throughput thresholds lead to complex nonconvex optimization problems. Path-following algorithms are developed for their computational solutions. The provided numerical examples show the advantages of the second approach over the first approach.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhichao Sheng, Hoang Duong Tuan, Trung Q. Duong, H. Vincent Poor, Yong Fang. 2017-12-11. Low-Latency Multiuser Two-Way Wireless Relaying for Spectral and Energy Efficiencies. https://doi.org/10.1109/tsp.2018.2847626

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↗