Search arXivSearch

arXiv · 0810.0882

Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without Ergodicity in One Channel Realization

Abstract

Consider a random matrix whose variance profile is random. This random matrix is ergodic in one channel realization if, for each column and row, the empirical distribution of the squared magnitudes of elements therein converges to a nonrandom distribution. In this paper, noncrossing partition theory is employed to derive expressions for several asymptotic eigenvalue moments (AEM) related quantities of a large Wishart-type random matrix $\bb H\bb H^†$ when $\bb H$ has a random variance profile and is nonergodic in one channel realization. It is known the empirical eigenvalue moments of $\bb H\bb H^†$ are dependent (or independent) on realizations of the variance profile of $\bb H$ when $\bb H$ is nonergodic (or ergodic) in one channel realization. For nonergodic $\bb H$, the AEM can be obtained by i) deriving the expression of AEM in terms of the variance profile of $\bb H$, and then ii) averaging the derived quantity over the ensemble of variance profiles. Since the AEM are independent of the variance profile if $\bb H$ is ergodic, the expression obtained in i) can also serve as the AEM formula for ergodic $\bb H$ when any realization of variance profile is available.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chien-Hwa Hwang. 2008-10-06. Asymptotic Eigenvalue Moments of Wishart-Type Random Matrix Without Ergodicity in One Channel Realization. https://arxiv.org/abs/0810.0882

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

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

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

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