Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.00277

Joint Antenna Selection and Spatial Switching for Energy Efficient MIMO SWIPT System

Jie Tang·Daniel K. C. So·Arman Shojaeifard·Kai-Kit Wong·Jinming Wen
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate joint antenna selection and spatial switching (SS) for quality-of-service (QoS)-constrained energy efficiency (EE) optimization in a multiple-input multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system. A practical linear power model taking into account the entire transmit-receive chain is accordingly utilized. The corresponding fractional-combinatorial and non-convex EE problem, involving joint optimization of eigen-channel assignment, power allocation, and active receive antenna set selection, subject to satisfying minimum sum-rate and power transfer constraints, is extremely difficult to solve directly. In order to tackle this, we separate the eigen-channel assignment and power allocation procedure with the antenna selection functionality. In particular, we first tackle the EE maximization problem under fixed receive antenna set using Dinkelbach-based convex programming, iterative joint eigen-channel assignment and power allocation, and low-complexity multi-objective optimization (MOO)-based approach. On the other hand, the number of active receive antennas induces a trade-off in the achievable sum-rate and power transfer versus the transmit-independent power consumption. We provide a fundamental study of the achievable EE with antenna selection and accordingly develop dynamic optimal exhaustive search and Frobenius-norm-based schemes. Simulation results confirm the theoretical findings and demonstrate that the proposed resource allocation algorithms can efficiently approach the optimal EE.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jie Tang, Daniel K. C. So, Arman Shojaeifard, Kai-Kit Wong, Jinming Wen. 2016-11-01. Joint Antenna Selection and Spatial Switching for Energy Efficient MIMO SWIPT System. https://arxiv.org/abs/1611.00277

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↗