Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.7412

Power Allocation for Precoding in Large-Scale MIMO Systems with Per-Antenna Constraint

Dengkui Zhu·Boyu Li·Ping Liang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Large-scale MIMO systems have been considered as one of the possible candidates for the next-generation wireless communication technique, due to their potential to provide significant higher throughput than conventional wireless systems. For such systems, Zero-Forcing (ZF) and Conjugate Beamforming (CB) precoding have been considered as two possible practical spatial multiplexing techniques, and their average achievable sum rates have been derived on the sum power constraint. However, in practice, the transmitting power at a base station is constrained under each antenna. In this case, the optimal power allocation is a very difficult problem. In this paper, the suboptimal power allocation methods for both ZF-based and CB-based precoding in large-scale MIMO systems under per-antenna constraint are investigated, which could provide useful references for practice.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dengkui Zhu, Boyu Li, Ping Liang. 2014-10-03. Power Allocation for Precoding in Large-Scale MIMO Systems with Per-Antenna Constraint. https://arxiv.org/abs/1405.7412

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↗