Rate Maximization in Coupled MIMO Systems: A Generic Algorithm For Designing Single-Port Matching Networks
AuthorsYahia Hassan and Armin Wittneben
ReferenceIEEE Wireless Communications and Networking Conference (WCNC), Istanbul, Apr. 2014.
AbstractCompact arrays are known to be associated with antenna coupling and noise correlation. The noise can be either antenna noise, LNA noise or downstream noise. Due to these effects, it was shown that the matching network affects the performance of MIMO systems with coupled receiver antennas. Since the optimal multiport matching network is of very high complexity as well as very narrow operation bandwidth, development of single-port (SP) matching networks that boost the performance became inevitable. In this paper we develop a gradient-search algorithm to design the matching network for achievable rate maximization of multi user MIMO systems. For any combination of noise sources, we rigorously derive the exact gradient of the achievable rate with respect to the components of the matching network. We assume either full knowledge of the spatial channel or knowing its statistical properties. In the later case we optimize the matching network to maximize the Jensen’s bound. Substantial performance enhancement is shown when our algorithms are used. Significant reduction in the array area is gained in comparison to the often used lambda/2 antenna spacing without taking coupling into account. This can be vital for future wireless systems adopting massive MIMO arrays. Via eigenvalues distribution simulations at different SNR regimes, we show an intuitive link to the communication theory.
Download this document:
Copyright Notice: © 2014 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
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.