Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1102.5643

Joint Beamforming and Power Allocation for MIMO Relay Broadcast Channel with Individual SINR Constraints

Chun-Che Chien·Hsuan-Jung Su·Hsueh-Jyh Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, system design for the multi-input multi-output (MIMO) relay broadcast channel with individual signal-to-interference-plus-noise ratio (SINR) constraints at the mobile stations (MS) is considered. By exploring the structure of downlink (DL) uplink (UL) duality at either the base station (BS) or the relay station (RS), we propose two schemes of joint power allocation and beamforming design at the BS and the RS. The problem of existence of feasible solutions under practical power constraints at the BS and the RS with given SINR targets is considered first. Then the problem of sum power minimization is considered. Each design problem can be solved efficiently using optimal joint power allocation and beamforming under the framework of convex optimization. We also show that with subchannel pairing at the RS, the transmission power can be reduced by channel compensation at either hop. Finally, an extension to more general multi-hop applications is provided to further improve the power efficiency.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chun-Che Chien, Hsuan-Jung Su, Hsueh-Jyh Li. 2011-02-28. Joint Beamforming and Power Allocation for MIMO Relay Broadcast Channel with Individual SINR Constraints. https://arxiv.org/abs/1102.5643

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↗