Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1201.0148

An Upper Bound to the Marginal PDF of the Ordered Eigenvalues of Wishart Matrices

Hong Ju Park·Ender Ayanoglu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Diversity analysis of a number of Multiple-Input Multiple-Output (MIMO) applications requires the calculation of the expectation of a function whose variables are the ordered multiple eigenvalues of a Wishart matrix. In order to carry out this calculation, we need the marginal pdf of an arbitrary subset of the ordered eigenvalues. In this letter, we derive an upper bound to the marginal pdf of the eigenvalues. The derivation is based on the multiple integration of the well-known joint pdf, which is very complicated due to the exponential factors of the joint pdf. We suggest an alternative function that provides simpler calculation of the multiple integration. As a result, the marginal pdf is shown to be bounded by a multivariate polynomial with a given degree. After a standard bounding procedure in a Pairwise Error Probability (PEP) analysis, by applying the marginal pdf to the calculation of the expectation, the diversity order for a number of MIMO systems can be obtained in a simple manner. Simulation results that support the analysis are presented.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Ju Park, Ender Ayanoglu. 2011-12-30. An Upper Bound to the Marginal PDF of the Ordered Eigenvalues of Wishart Matrices. https://arxiv.org/abs/1201.0148

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↗