TY - GEN

T1 - Large system performance of interference alignment in single-beam MIMO networks

AU - Schmidt, David A.

AU - Utschick, Wolfgang

AU - Honig, Michael L.

PY - 2010

Y1 - 2010

N2 - We consider a network of K interfering transmitter-receiver pairs, where each node has N antennas and at most one beam is transmitted per user. We investigate the asymptotic performance of different beamforming strategies, as characterized by the slope and y-axis intercept (or offset) of the high signal-to-noise-ratio (SNR) sum rate asymptote. It is known that a slope (or multiplexing gain) of 2N - 1 is achievable with interference alignment. On the other hand, a strategy achieving a slope of only N might allow for a significantly higher offset. Assuming that the number of fully aligned beamformer sets that achieve a slope of 2N - 1 is finite for a given channel realization, we approximate the average offset when the best out of a large number L of these sets is selected. We also derive a simple large system approximation for the sum rate of a successive beam allocation scheme when K = N. We show that both approximations accurately predict simulated results for moderate system dimensions and characterize the large-system asymptotes for different relationships between L and N.

AB - We consider a network of K interfering transmitter-receiver pairs, where each node has N antennas and at most one beam is transmitted per user. We investigate the asymptotic performance of different beamforming strategies, as characterized by the slope and y-axis intercept (or offset) of the high signal-to-noise-ratio (SNR) sum rate asymptote. It is known that a slope (or multiplexing gain) of 2N - 1 is achievable with interference alignment. On the other hand, a strategy achieving a slope of only N might allow for a significantly higher offset. Assuming that the number of fully aligned beamformer sets that achieve a slope of 2N - 1 is finite for a given channel realization, we approximate the average offset when the best out of a large number L of these sets is selected. We also derive a simple large system approximation for the sum rate of a successive beam allocation scheme when K = N. We show that both approximations accurately predict simulated results for moderate system dimensions and characterize the large-system asymptotes for different relationships between L and N.

UR - http://www.scopus.com/inward/record.url?scp=79551653375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551653375&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2010.5684032

DO - 10.1109/GLOCOM.2010.5684032

M3 - Conference contribution

AN - SCOPUS:79551653375

SN - 9781424456383

T3 - GLOBECOM - IEEE Global Telecommunications Conference

BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010

T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010

Y2 - 6 December 2010 through 10 December 2010

ER -