Search arXivSearch

arXiv · 1705.05500

Maximum Signal Minus Interference to Noise Ratio Multiuser Receive Beamforming

Abstract

Motivated by massive deployment of low data rate Internet of things (IoT) and ehealth devices with requirement for highly reliable communications, this paper proposes receive beamforming techniques for the uplink of a single-input multiple-output (SIMO) multiple access channel (MAC), based on a per-user probability of error metric and one-dimensional signalling. Although beamforming by directly minimizing probability of error (MPE) has potential advantages over classical beamforming methods such as zero-forcing and minimum mean square error beamforming, MPE beamforming results in a non-convex and a highly nonlinear optimization problem. In this paper, by adding a set of modulation-based constraints, the MPE beamforming problem is transformed into a convex programming problem. Then, a simplified version of the MPE beamforming is proposed which reduces the exponential number of constraints in the MPE beamforming problem. The simplified problem is also shown to be a convex programming problem. The complexity of the simplified problem is further reduced by minimizing a convex function which serves as an upper bound on the error probability. Minimization of this upper bound results in the introduction of a new metric, which is termed signal minus interference to noise ratio (SMINR). It is shown that maximizing SMINR leads to a closed-form expression for beamforming vectors as well as improved performance over existing beamforming methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Majid Bavand, Steven D. Blostein. 2017-05-16. Maximum Signal Minus Interference to Noise Ratio Multiuser Receive Beamforming. https://arxiv.org/abs/1705.05500

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