Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1004.5181

Analysis of Feedback Overhead for MIMO Beamforming over Time-Varying Channels

Jaewon Kim·Jonghyun Park
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, the required amount of feedback overhead for multiple-input multiple-output (MIMO) beamforming over time-varying channels is presented in terms of the entropy of the feedback messages. In the case that each transmit antenna has its own power amplifier which has individual power limit, it has been known that only phase steering information is necessary to form the optimal transmit beamforming vector. Since temporal correlation exists for wireless fading channels, one can utilize the previous reported feedback messages as prior information to efficiently encode the current feedback message. Thus, phase tracking information, difference between two phase steering information in adjacent feedback slots, is sufficient as a feedback message. We show that while the entropy of the phase steering information is a constant, the entropy of the phase tracking information is a function of the temporal correlation parameter. For the phase tracking information, upperbounds on the entropy are presented in the Gaussian entropy and the von-Mises entropy by using the theory on the maximum entropy distributions. Derived results can quantify the amount of reduction in feedback overhead of the phase tracking information over the phase steering information. For application perspective, the signal-to-noise ratio (SNR) gain of phase tracking beamforming over phase steering beamforming is evaluated by using Monte-Carlo simulation. Also we show that the derived entropies can determine the appropriate duration of the feedback reports with respect to the degree of the channel variation rates.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaewon Kim, Jonghyun Park. 2010-04-29. Analysis of Feedback Overhead for MIMO Beamforming over Time-Varying Channels. https://arxiv.org/abs/1004.5181

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↗