1. 1 WELCOME Chen

2. 2 Simulation of MIMO Capacity Limits Professor: Patric Ö sterg å rd Supervisor: Kalle Ruttik Communications Labortory

3. 3 Agenda 1. Introduction to Multiple-In Multiple-Out(MIMO) 2. MIMO Multiple Access Channel(MAC) 3. Water-filling algorithm(WF) 4. MIMO Broadcast Channel(BC) 5. Zero-forcing method(ZF) 6. Simulation results 7. Conclusion

4. 4 What is MIMO H ij is the channel gain from Tx i to Rx j with Input vector: Output vector: Noise vector :

5. 5 MIMO MAC (uplink) MAC is a channel which two (or more) senders send information to a common receiver

6. 6 Water-filling algorithm The optimal strategy is to ‘ pour energy ’ (allocate energy on each channel). In channels with lower effective noise level, more energy will be allocated.

7. 7 Iterative water filling algorithm Initialize Q i = 0, i = 1 …K. repeat; for j = 1 to K; end; until the desired accuracy is reached

8. 8 MIMO MAC capacity Single-user water filling When we apply the water filling Q i =Q. K-user Water-filling

9. 9 MIMO MAC capacity region The capacity region of the MAC is the closure of the set of achievable rate pairs (R1, R2).

10. 10 MAC sum capacity region (WF) The sum rate converges to the sum capacity. (Q 1 ……. Q k ) converges to an optimal set of input covariance matrices.

11. 11 MIMO BC (downlink) Single transmitter for all users

12. 12 Zero-forcing method To find out the optimal transmit vector, such that all multi-user interference is zero, the optimal solution is to force H j M j = 0, for i≠ j, so that user j does not interfere with any other users.

13. 13 BC capacity region for 2 users The capacity region of a BC depends only on the Conditional distributions of

14. 14 BC sum capacity 1. Use water filling on the diagonal elements of to determine the optimal power loading matrix under power constraint P. 2. Use water-filling on the diagonal elements of to calculate the power loading matrix that satisfies the power constraint P j corresponding to rate R j. (power control) 3. Let m j be the number of spatial dimensions used to transmit to user j, The number of sub-channels allocated to each user must be a constant when K = N t / m j, (known sub-channel)

15. 15 Examples of simulation results Ergodic capacity with different correlations (single user)

16. 16 Ergodic capacity (single user) Ergodic capacityTx = Rx = 3 Correlation(0, 0)(0, 0.2)(0.2, 0.95)(0.95, 0.95) Max (SNR=20) 16.3716.2611.688.07 4 different set correlations magnitude coefficient

17. 17 MIMO MAC sum capacity (2 users)

18. 18 1 2 3 MIMO MAC sum capacity (2 users)

19. 19 MIMO MAC sum capacity (2 users) Ergodic capacityTx = Rx = 3 sum capacityuser 1user2 Max(SNR=20)21.3216.3116.34

20. 20 MIMO MAC sum capacity (3 users) Tx = Rx= 5 SNR=20

21. 21 MIMO MAC capacity (3 users) Ergodic capacityTx = Rx = 3 sum capacityuser 1user2user3 Max(SNR=20)23.4516.6016.1916.16

22. 22 MIMO MAC capacity (WF)(2 users)

23. 23 MIMO MAC capacity (WF) (2 users) Ergodic capacityTx = Rx = 3 With water fillingsum capacityuser 1user2 Max(SNR=20)21.9616.3616.45

24. 24 MIMO MAC capacity (WF) (3 users) Tx= Rx =4 SNR=20

25. 25 MIMO MAC capacity (WF) (3 users) Ergodic capacity4Tx X 4Rx, SNR=20 sum capacityuser 1user2user3 Max39.6027.5727.5827.78

26. 26 BC sum capacity Tx=4; Rx=2; SNR=20;

27. 27 BC sum capacity: with Power Control Tx=4; Rx=2; SNR=20;

28. 28 BC sum capacity: Coordinated Tx-Rx Tx=4; Rx=2; SNR=20; m j =2

29. 29 BC sum capacity Tx=4, Rx=2, m j= 2 sum capacityuser 1user2 Max (SNR=20) 27.0315.6714.81 With Power Control Max (SNR=20) 28.1816.6817.03 Known sub-channel Max (SNR=20) 31.7916.6118.43

30. 30 Conclusion MIMO capacity: 1. It depends on H, the larger rank and eigen values of H, the more MIMO capacity will be. 2. If we understood better the knowledge of Tx and Rx, we can get higher channel capacity. With power control, the capacity will also be increased. 3. When water-filling is applied: the capacity will be incresaing significantly.

31. 31 Main references 1. T. M. Cover, “ Elements if information theory ”, 1991. 2. W. Yu, “ Iterative water-filling for Gaussian vector multiple access channels ”, 2004. 3. Quentin H.Spencer, “ Zero-forcing methods for downlink spatial multiplexing ”, 2004.

32. 32 THANK YOU! Any questions?