Random matrix analysis of large relay networks


Veniamin I. Morgenshtern and Helmut Bölcskei


Allerton Conference on Communication, Control, and Computing, Monticello, IL, pp. 106-112, Sept. 2006, (invited paper).

[BibTeX, LaTeX, and HTML Reference]


We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K single-antenna relays using half-duplex two-hop relaying. The relays do not have channel state information, perform amplify-and-forward (AF) relaying, and the destination terminals can cooperate and perform joint decoding. Our main results are as follows: 1) We compute the per source-destination terminal pair capacity for M and K both going to infinity with the ratio K/M=beta fixed, using tools from random matrix theory. 2) We show that for beta going to infinity, the AF relay network is turned into a point-to-point multiple-input multiple-output link and thus extend the result found previously for the finite M and K going to infinity case in [1] to the case where both M and K go to infinity.


Relay network, large random matrix theory, capacity scaling

Download this document:


Copyright Notice: © 2006 V. I. Morgenshtern and H. Bölcskei.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.