Holonomic Gradient Method-Based CDF Evaluation for the Largest Eigenvalue of a Complex Noncentral Wishart Matrix
Fadil Habibi Danufane, Katsuyoshi Ohara, Nobuki Takayama, Constantin, Siriteanu

TL;DR
This paper introduces a stable holonomic gradient method (HGM) approach to efficiently and reliably compute the CDF of the largest eigenvalue of a complex noncentral Wishart matrix, crucial for MIMO system outage probability analysis.
Contribution
The paper develops gauge transformations that produce stable differential equations for HGM, enabling accurate CDF evaluation for large antenna arrays and high Rician K-factors.
Findings
HGM with gauge transformations guarantees convergence.
Reliable and fast CDF computation for large MIMO systems.
Accurate outage probability estimates even at high Rician K-factors.
Abstract
The outage probability of maximal-ratio combining (MRC) for a multiple-input multiple-output (MIMO) wireless communications system under Rician fading is given by the cumulative distribution function (CDF) for the largest eigenvalue of a complex noncentral Wishart matrix. This CDF has previously been expressed as a determinant whose elements are integrals of a confluent hypergeometric function. For the determinant elements, conventional evaluation approaches, e.g., truncation of infinite series ensuing from the hypergeometric function or numerical integration, can be unreliable and slow even for moderate antenna numbers and Rician -factor values. Therefore, herein, we derive by hand and by computer algebra also differential equations that are then solved from initial conditions computed by conventional approaches. This is the holonomic gradient method (HGM). Previous HGM-based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Point processes and geometric inequalities
