Pith. sign in

REVIEW 2 cited by

Spectra of large block matrices

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0610045 v1 pith:KFNVH4CK submitted 2006-10-09 cs.IT math.ITmath.OA

classification cs.ITmath.ITmath.OA
keywords blockmatricesdistributionchanneleigenvaluemethodmimosystem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to infinity. While it considers random matrices, it takes an operator-valued free probability approach to achieve this goal. Using this method, one derives a system of equations, which can be solved numerically to compute the desired eigenvalue distribution. The paper initially tackles the problem for square block matrices, then extends the solution to rectangular block matrices. Finally, it deals with Wishart type block matrices. For two special cases, the results of our approach are compared with results from simulations. The first scenario investigates the limit eigenvalue distribution of block Toeplitz matrices. The second scenario deals with the distribution of Wishart type block matrices for a frequency selective slow-fading channel in a MIMO system for two different cases of $n_R=n_T$ and $n_R=2n_T$. Using this method, one may calculate the capacity and the Signal-to-Interference-and-Noise Ratio in large MIMO systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent

    stat.ML 2026-05 unverdicted novelty 7.0 of 10

    Two steps of gradient descent on first-layer weights in linear-width two-layer networks produce a spiked random matrix with floor(alpha2/(1/2-alpha1)) outliers, each a learned direction, and batch reuse allows capturi...

  2. Variational Formulas for the Spectrum of Block Wishart Matrices

    math.PR 2026-06 unverdicted novelty 5.0 of 10

    Derives variational formulas for the left edge of support and logarithmic potential of the asymptotic spectral density of block-Wishart matrices with fixed k under n/p → α.

Pith tools