Search arXivSearch

arXiv · 1511.00207

Harvesting Full-Duplex Rate Gains in Cellular Networks with Half-Duplex User Terminals

Abstract

Full-Duplex (FD) transceivers may be expensive in terms of complexity, power consumption, and price to be implemented in all user terminals. Therefore, techniques to exploit in-band full-duplex communication with FD base stations (BSs) and half-duplex (HD) users' equipment (UEs) are required. In this context, 3-node topology (3NT) has been recently proposed for FD BSs to reuse the uplink (UL) and downlink (DL) channels with HD terminals within the same cell. In this paper, we present a tractable mathematical framework, based on stochastic geometry, for 3NT in cellular networks. To this end, we propose a design paradigm via pulse-shaping and partial overlap between UL and DL channels to maximize the harvested rate gains in 3NT. The results show that 3NT achieves a close performance to networks with FD BSs and FD UEs, denoted by 2-node topology (2NT) networks. A maximum of 5$\%$ rate loss is reported when 3NT is compared to 2NT with efficient self-interference cancellation (SIC). If the SIC in 2NT is not efficient, 3NT highly outperforms 2NT. Consequently, we conclude that, irrespective to the UE duplexing scheme, it is sufficient to have FD BSs to harvest FD rate gains.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmad AlAmmouri, Hesham ElSawy, Mohamed-Slim Alouini. 2016-02-28. Harvesting Full-Duplex Rate Gains in Cellular Networks with Half-Duplex User Terminals. https://doi.org/10.1109/icc.2016.7510864

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