Free convolution
 | This article may be confusing or unclear to readers. (November 2008) |
| This article provides insufficient context for those unfamiliar with the subject. |
 | Template:Wikify is deprecated. Please use a more specific cleanup template as listed in the documentation. |
Free deconvolution is a recent application of free probability to signal processing. It enables to compute the eigenvalues of involved models of sum or product of random matrices using combinatorial techniques. It has some some strong connections with other works on G-estimation of Girko.
As a straightforward example, suppose that A and B are independent large square Hermitian (or symmetric) random matrices, then under some very general conditions, free deconvolution enables to :
- Deduce the eigenvalue distribution of A from those of A+B and B.
- Deduce the eigenvalue distribution of A from those of AB and B.
The concept is even broader as it provides a method to retrieve the eigenvalue distribution of A from any functional f(A,B) and B (f(A,B) is a function of the two matrices A and B).
The applications in wireless communications, finance and biology have provided a useful framework when the number of observations is of the same order as the dimensions of the system.
References
- "Free Deconvolution for Signal Processing Applications", O. Ryan and M. Debbah, ISIT 2007, pp. 1846–1850