Capacity scaling laws in MIMO wireless networks
AuthorsRohit U. Nabar, Özgür Oyman, Helmut Bölcskei, and Arogyaswami J. Paulraj
ReferenceAllerton Conference on Communication, Control, and Computing, Monticello, IL, pp. 378-389, Oct. 2003, (invited paper).
AbstractThe use of multiple antennas at both ends of a wireless link, popularly known as multiple-input multiple-output (MIMO) wireless, has been shown to offer significant improvements in spectral efficiency and link reliability through spatial multiplexing and space-time coding, respectively. This paper demonstrates that similar performance gains can be obtained in wireless relay and adhoc networks employing terminals with MIMO capability. In the relay case a source terminal communicates with a destination terminal assisted by multiple relay terminals. For this scenario, assuming that transmitter and receiver employ M antennas and operate in spatial multiplexing mode, we show that the network capacity scales as C = (M/2)log(KN)+O(1) for a large number of relay terminals K and large number of antennas N>=M at each of the relay terminals. For finite N>=M, we find that capacity scales as C = (M/2)log(K) + O(1). Furthermore, we propose an asymptotically optimal architecture which requires that each of the relay terminals knows its backward and forward channels. Our results are extended to the adhoc case where L source-destination pairs communicate concurrently in spatial multiplexing mode through the same set of relay terminals and sum-capacity is shown to scale as C = (LM/2)log(KN) + O(1) for large K and N and C = (LM/2)log(K) + O(1) for finite N>=LM. Finally, we establish the importance of stream separation and coherent combining at the relay terminals, in the absence of which we show that for any N, asymptotically in K, C = (M/2)log(SNR) + O(1), demonstrating that the number of relays does not enter the scaling law.
KeywordsWireless networks, MIMO, relay channels, capacity, protocols
Download this document:
Copyright Notice: © 2003 R. U. Nabar, Ö. Oyman, H. Bölcskei, and A. J. Paulraj.
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.