| R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002. |
....explicit expression for its moments. Additionally, almost all eigenvalues are shown to converge towards zero as the number of factors grows over all bounds. This effect cumulates the total energy in a vanishing number of dimensions. The channel model addressed generalizes the model introduced in [1] for communication via large antennas arrays to N fold scattering per propagation path. As a byproduct, the multiplicative free convolution is shown to extend to a certain class of asymptotically large non Gaussian random covariance matrices. Index terms random matrices, Stieltjes ....
....independently report results for the asymptotic case with independent entries for N = 1. The case where the channel matrix is composed by [A 1 M ; A 2 M ; ANM ] with entries of M i.i.d. random and A i denoting i.i.d. random diagonal matrices was solved by Hanly and Tse [9] Finally, Muller [1] solved the case for N = 2 where H N is a product of two independent i.i.d. random matrices. The present paper will give results for products of N independent i.i.d. random matrices, cf. 1) that do not need to have the same dimensions. 2 Asymptotic Eigenvalue Distribution The performance of ....
[Article contains additional citation context not shown here]
Ralf R. Muller. A random matrix model of communication via antenna arrays. Submitted to IEEE Transactions on Information Theory, August
.... detectors introduced in [1] combined with recent results in random matrix theory were found to be powerful low complexity tools to mitigate interference on multiple input multiple output (MIMO) communication channels [2] The random matrix model of communication via antenna arrays proposed in [3] characterizes the channel in terms of its asymptotic eigenvalue distribution by a single parameter. Reference [4] generalises the polynomial expansion in [2] to multiple input multiple output(MIMO) communication channels promising very good performance at complexity per bit that grows only ....
....as shown in [1] the problem of efficient detection simplifies for larger arrays. This has been demonstrated successfully for interference mitigation in the context of CDMA systems [2] In [4] the previous result is extended for communication via antenna arrays making use of the results in [3]. Telecommunications Research Centre Vienna (ftw. Tech Gate Vienna, Donau City Str. 1 III A 1220 Vienna, Austria cottatellucci ftw.at This paper analyses the performance of the MS receiver proposed in [4] and compares it with the LMMSE receiver and the receiver proposed in [1] in real ....
[Article contains additional citation context not shown here]
R.R. Muller, "A random matrix model of communication via antenna arrays," Submitted to IEEE Transactions on Information Theory.
No context found.
R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002.
No context found.
R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002.
No context found.
R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002.
No context found.
Ralf R. Muller, \A random matrix model for communication via antenna arrays," IEEE Transactions on Information Theory, vol. 48, no. 9, pp. 2495-2506, Sept. 2002.
No context found.
R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002.
....Stack the symbol vectors x[k] and y[k] transmitted and received at subsequent time instances k one below each other into a single vector of transmitted and received data, respectively. This gives the space time description of the channel shown at the top of the next page. It is shown in [18] and omitted in this conference version due to space limitation that the singular value distributions of the block circulant space time channel matrix in (16) and P L =1 H are identical as the number of antennas grows asymptotically large. The summation over the channel matrices ....
Ralf R. Muller, "A random matrix model of communication via antenna arrays," Submitted to IEEE Transactions on Information Theory, Aug. 2000.
No context found.
R. Muller, "A Random Matrix Model of Communication via Antenna Arrays," IEEE Trans. on Information Theory, pp. 2495--2506, Sep 2002.
No context found.
R. R. Muller, "A random matrix model for communication via antenna arrays," IEEE Trans. Inform. Theory, vol. 48, no. 9, pp. 2495--2506, Sept. 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC