2011/04/30 by Romain Couillet, Mérouane Debbah, Couillet, Romain +1 · 2 citations
Mathematics · #Advanced Combinatorial Mathematics #FOS: Computer and information sciences #Information Theory (cs.IT) #Random Matrices and Applications #Stochastic processes and statistical mechanics
paper · doi:10.48550/arxiv.1105.0060
openalex publication_date 2011/04/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For a long time, detection and parameter estimation methods for signal processing have relied on asymptotic statistics as the number n of observations of a population grows large comparatively to the population size N, i.e. n/N→ ∞. Modern technological and societal advances now demand the study of sometimes extremely large populations and simultaneously require fast signal processing due to accelerated system dynamics. This results in not-so-large practical ratios n/N, sometimes even smaller than one. A disruptive change in classical signal processing methods has therefore been initiated in the past ten years, mostly spurred by the field of large dimensional random matrix theory. The early works in random matrix theory for signal processing applications are however scarce and highly technical. This tutorial provides an accessible methodological introduction to the modern tools of random matrix theory and to the signal processing methods derived from them, with an emphasis on simple illustrative examples.