Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1307.2421

Energy Efficient Coordinated Beamforming for Multi-cell MISO Systems

Yi Huang·Jie Xu·Ling Qiu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the optimal energy efficient coordinated beamforming in multi-cell multiple-input single-output (MISO) systems with $K$ multiple-antenna base stations (BS) and $K$ single-antenna mobile stations (MS), where each BS sends information to its own intended MS with cooperatively designed transmit beamforming. We assume single user detection at the MS by treating the interference as noise. By taking into account a realistic power model at the BS, we characterize the Pareto boundary of the achievable energy efficiency (EE) region of the $K$ links, where the EE of each link is defined as the achievable data rate at the MS divided by the total power consumption at the BS. Since the EE of each link is non-cancave (which is a non-concave function over an affine function), characterizing this boundary is difficult. To meet this challenge, we relate this multi-cell MISO system to cognitive radio (CR) MISO channels by applying the concept of interference temperature (IT), and accordingly transform the EE boundary characterization problem into a set of fractional concave programming problems. Then, we apply the fractional concave programming technique to solve these fractional concave problems, and correspondingly give a parametrization for the EE boundary in terms of IT levels. Based on this characterization, we further present a decentralized algorithm to implement the multi-cell coordinated beamforming, which is shown by simulations to achieve the EE Pareto boundary.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Huang, Jie Xu, Ling Qiu. 2013-07-09. Energy Efficient Coordinated Beamforming for Multi-cell MISO Systems. https://doi.org/10.1109/glocom.2013.6831454

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↗