Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cs/0603040

On the Information Rate of MIMO Systems with Finite Rate Channel State Feedback Using Beamforming and Power On/Off Strategy

Wei Dai·Youjian Liu·Vincent K. N. Lau·Brian Rider
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well known that Multiple-Input Multiple-Output (MIMO) systems have high spectral efficiency, especially when channel state information at the transmitter (CSIT) is available. When CSIT is obtained by feedback, it is practical to assume that the channel state feedback rate is finite and the CSIT is not perfect. For such a system, we consider beamforming and power on/off strategy for its simplicity and near optimality, where power on/off means that a beamforming vector (beam) is either turned on with a constant power or turned off. The main contribution of this paper is to accurately evaluate the information rate as a function of the channel state feedback rate. Name a beam turned on as an on-beam and the minimum number of the transmit and receive antennas as the dimension of a MIMO system. We prove that the ratio of the optimal number of on-beams and the system dimension converges to a constant for a given signal-to-noise ratio (SNR) when the numbers of transmit and receive antennas approach infinity simultaneously and when beamforming is perfect. Asymptotic formulas are derived to evaluate this ratio and the corresponding information rate per dimension. The asymptotic results can be accurately applied to finite dimensional systems and suggest a power on/off strategy with a constant number of on-beams. For this suboptimal strategy, we take a novel approach to introduce power efficiency factor, which is a function of the feedback rate, to quantify the effect of imperfect beamforming. By combining power efficiency factor and the asymptotic formulas for perfect beamforming case, the information rate of the power on/off strategy with a constant number of on-beams is accurately characterized.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wei Dai, Youjian Liu, Vincent K. N. Lau, Brian Rider. 2006-03-09. On the Information Rate of MIMO Systems with Finite Rate Channel State Feedback Using Beamforming and Power On/Off Strategy. https://arxiv.org/abs/cs/0603040

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↗