Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1205.0927

An Energy-Efficient MIMO Algorithm with Receive Power Constraint

Andrés Alayón Glazunov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the energy-efficiency of Multiple-Input Multiple-Output (MIMO) systems with constrained received power rather than constrained transmit power. A Energy-Efficient Water-Filling (EEWF) algorithm that maximizes the ratio of the transmission rate to the total transmit power has been derived. The EEWF power allocation policy establishes a trade-off between the transmission rate and the total transmit power under the total receive power constraint. The static and the uncorrelated fast fading Rayleigh channels have been considered, where the maximization is performed on the instantaneous realization of the channel assuming perfect information at both the transmitter and the receiver with equal number of antennas. We show, based on Monte Carlo simulations that the energy-efficiency provided by the EEWF algorithm can be more than an order of magnitude greater than the energy-efficiency corresponding to capacity achieving Water-Filling (WF) algorithm. We also show that the energy-efficiency increases with both the number of antennas and the signal-to-noise ratio. The corresponding transmission rate also increases but at a slower rate than the Shannon capacity, while the corresponding total transmit power decreases with the number of antennas.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrés Alayón Glazunov. 2012-05-04. An Energy-Efficient MIMO Algorithm with Receive Power Constraint. https://arxiv.org/abs/1205.0927

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↗