Full-Duplex MIMO-OFDM Communication with Self-Energy Recycling

Ali A. Nasir; H. D. Tuan; T. Q. Duong; H. V. Poor

Home/Archive/arXiv

arXiv · 1903.09931

Full-Duplex MIMO-OFDM Communication with Self-Energy Recycling

Ali A. Nasir·H. D. Tuan·T. Q. Duong·H. V. Poor

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper focuses on energy recycling in full-duplex (FD) relaying multiple-input-multiple-output orthogonal frequency division multiplexing (OFDM) communication. The loop self-interference (SI) due to full-duplexing is seen as an opportunity for the energy-constrained relay node to replenish its energy requirement through wireless power transfer. In forwarding the source information to the destination, the FD relay can simultaneously harvest energy from the source wireless transmission and also through energy recycling from its own transmission. The objective is to maximize the overall spectral efficiency by designing the optimal power allocation over OFDM sub-carriers and transmit antennas. Due to a large number of sub-carriers, this design problem poses a large-scale nonconvex optimization problem involving a few thousand variables of power allocation, which is very computationally challenging. A new path-following algorithm is proposed, which converges to an optimal solution. This algorithm is very efficient since it is based on \textit{closed-form} calculations. Numerical results for a practical simulation setting show promising results by achieving high spectral efficiency.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ali A. Nasir, H. D. Tuan, T. Q. Duong, H. V. Poor. 2019-03-24. Full-Duplex MIMO-OFDM Communication with Self-Energy Recycling. https://arxiv.org/abs/1903.09931

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↗