In a previous post we had discussed MIMO capacity in a fading environment and compared it to AWGN capacity. It sometimes feels unintuitive that fading capacity can be higher than AWGN capacity. If a signal is continuously fluctuating how is it possible that we are able to have reliable communication. But this is the remarkable feature of MIMO systems that they are able to achieve blazing speeds over an unreliable channel, at least theoretically. It has been shown mathematically that an NxN MIMO channel is equivalent to N SISO channels in parallel.

Continue reading MIMO, SIMO and MISO Capacity in AWGN and Fading Environment# Tag Archives: MIMO

# 5G Data Rates and Shannon Capacity

Recently I came across a **post from T-Mobile** in which they claim to have achieved a download speed of 5.6 Gbps over a 100 MHz channel resulting in a Spectral Efficiency of more than 50 bps/Hz. This was achieved in an MU-MIMO configuration with eight connected devices having an aggregate of 16 parallel streams i.e. two parallel streams per device. The channel used for this experiment was the mid-band frequency of 2.5 GHz.

# My Top 12 Marconi Award Winners

While reading an article on social media I came to know that Siavash M. Alamouti has been awarded the Marconi Award for the year 2022. It came as no surprise as his work on MIMO technology has been ground breaking and has influenced the work of thousands of researchers. If there is a moot point it is that this award must have been given earlier. Just look up his 1998 paper on Google Scholar and you will find that the number of citations has reached a staggering figure of 18,756. On a personal front, I must admit that when I started my research on MIMO I was having difficulty grasping the concepts and it was Alamouti’s paper that set my direction of research.

Continue reading My Top 12 Marconi Award Winners# Index Modulation Explained

Wireless researchers are continuously exploring ways to increase the spectral efficiency (bits/sec/Hz) and energy efficiency (bits/Joule) of wireless communication systems [1]. Spectral efficiency can generally be improved by using larger constellations or by using multiple antennas at the transmitter and receiver, better known as MIMO. But increasing energy efficiency is not that straightforward. Let’s consider this in bit more detail.

Continue reading Index Modulation Explained# Massive MIMO Fundamentals and Code

###### Background

Just like different frequency bands and time slots can be used to multiplex users, spatial domain can also be exploited to achieve the same result. It is well known that if there are 4 transmit antennas and 4 receive antennas then four simultaneous data streams can be transmitted over the air. This can be scaled up to 8 x 8 or in the extreme case to 128 x 128. When the number of transmit or receive antennas is greater than 100 we typically call it a Massive MIMO scenario and we need specialized signal processing techniques to handle this case. Computationally complex techniques like Maximum Likelihood (ML) become quite difficult to implement in real-time and we have to resort to some simplified linear array processing techniques. This is the topic of this blog post.

###### Description of the Scenario

To understand the scenario that we will discuss here, please look at our previous post. Also note that when we talk about nT x nR case we do not necessarily mean nT transmit antennas and nR receive antennas, it could also mean nT users with 1 antenna each and co-located nR receive antennas, such as at a base station. We typically assume that the number of receive antennas is greater than the number of users. When the number of users is greater than the number of receive antennas we call it overloaded case and this is not discussed here. Here the number of users is fixed at 16 (randomly distributed between 0 and 360 degrees within the cell) and the number of receive antennas is varied from 20 to 100.

###### Linear Signal Processing Techniques for Massive MIMO

The four signal processing techniques that are applied at the receive array are:

- Matched Filtering (MF)
- Moore Penrose Pseudo-Inverse without controlling the threshold (PINV)
- Moore Penrose Pseudo-Inverse with a specified threshold (PINV with tol)
- Minimum Mean Squared Error (MMSE)

###### Simulation Results

There are some other techniques that we experimented with but are omitted here for the sake of brevity. The MATLAB code and simulation results showing bit error rate as a function of receive array size (nR) are given below. It is seen that simple Matched Filter works quite well when the receive array size is small but with increasing nR the performance improvement is not that great. Least Squares (LS) technique using Moore-Penrose Pseudo Inverse shows improved performance with increasing nR and this can be further improved by controlling the threshold (tol). We found that a threshold of 0.1 gave significantly improved results as compared to no threshold case. Lastly we implemented MMSE and found that it gave us the best results. It must be noted that we also implemented ML for a limited size of receive array and found that its BER performance was far superior than any other technique.

###### MATLAB Code for Massive MIMO Scenario

```
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% MASSIVE MIMO BEAMFORMING
% COPYRIGHT RAYMAPS (C) 2018
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
clear all
close all
% SETTING THE PARAMETERS FOR THE SIMULATION
f=1e9; %Carrier frequency
c=3e8; %Speed of light
l=c/f; %Wavelength
d=l/2; %Rx array spacing
N=20; %Receive array size
M=16; %Transmit array size (users)
theta=2*pi*(rand(1,M)); %Angular separation of users
EbNo=10; %Energy per bit to noise PSD
sigma=1/sqrt(2*EbNo); %Standard deviation of noise
n=1:N; %Rx array number
n=transpose(n); %Row vector to column vector
% RECEIVE SIGNAL MODEL (LINEAR)
s=2*(round(rand(M,1))-0.5); %BPSK signal of length M
H=exp(-i*(n-1)*2*pi*d*cos(theta)/l); %Channel matrix of size NxM
wn=sigma*(randn(N,1)+i*randn(N,1)); %AWGN noise of length N
x=H*s+wn; %Receive vector of length N
% LINEAR ARRAY PROCESSING - METHODS
% 1-MATCHED FILTER
y=H'*x;
% 2-PINV without tol
% y=pinv(H)*x;
% 3-PINV with tol
% y=pinv(H,0.1)*x;
% 4-Minimum Mean Square Error (MMMSE)
% y=(H'*H+(2*sigma^2)*eye([M,M]))^(-1)*(H')*x;
% DEMODULATION AND BER CALCULATION
s_est=sign(real(y)); %Demodulation
ber=sum(s!=s_est)/length(s); %BER calculation
%Note: Please select the array processing technique
%you want to implement (1-MF, 2-LS1, 3-LS2, 4-MMSE)
```

**Note:**

- In the code above, N=nR and M=nT
- What is labelled here as Matched Filter (MF) is strictly speaking Maximal Ratio Combining (MRC)
- The case we discuss above is categorized as Multiuser MIMO (MU-MIMO) for the uplink
- MU-MIMO for the downlink is not that straight forward and will be the subject of some future post
- We have considered a deterministic channel model as opposed to a probabilistic channel model
- Probabilistic channel model can be easily implemented by assuming that channel coefficients are independent and identically distributed (IID) complex Gaussian random variables with mean zero and variance of 0.5 per dimension
- The initial results we have obtained using this probabilistic channel model are much better than the results shown above, but the question remains which is the more accurate representation of a real channel

###### Update: Simulation Using a Probabilistic Channel

Since most of the literature in Massive MIMO uses a probabilistic channel instead of a deterministic channel, we decided to investigate this further. To implement such a channel model we simply need to change one line of the MATLAB code shown above. Instead of defining H as:

H=exp(-i*(n-1)*2*pi*d*cos(theta)/l);

We define H as:

H=(1/sqrt(2))*randn(N,M)+i*(1/sqrt(2))*randn(N,M);

The results are shown below. It is seen that the BER performance is orders of magnitude better. We would next investigate the performance degradation if the channel coefficients are not independent and identically distributed (IID) but have some correlation. This is closely tied to inter-element separation of the antenna array.

###### Concluding Remarks

The fundamental question that needs to be asked is why the performance in the NLOS scenario (probabilistic) is better than LOS scenario (deterministic). This has to do with the Signal to Noise Ratio [1]. In the above we have assumed the Signal to Noise Ratio (SNR) for the two scenarios to be the same. But realistically speaking this is never the case. Although the NLOS case assumes a rich scattering environment providing a high multiplexing gain (dependent on the rank of the channel matrix H) its SNR would always be lower due to reflection, diffraction and scattering loss. So a fair comparison between the LOS and NLOS case is only possible if we downward adjust the SNR for the NLOS case. Simulation results have shown that the SNR for the NLOS case needs to be downgraded by about 25 dB to have similar BER performance as the LOS case. Lastly it must be noted that the BER performance of the NLOS case would deteriorate once the channel coefficients are not IID and there is some correlation between them.

[1] Zimu Cheng, Binghao Chen, and Zhangdui Zhong “A Tradeoff between Rich Multipath and High Receive Power in MIMO Capacity”, International Journal of Antennas and Propagation, Volume 2013.

# MIMO Capacity in a Fading Environment

The Shannon Capacity of a channel is the data rate that can be achieved over a given bandwidth (BW) and at a particular signal to noise ratio (SNR) with diminishing bit error rate (BER). This has been discussed in an earlier post for the case of SISO channel and additive white Gaussian noise (AWGN). For a MIMO fading channel the capacity with channel not known to the transmitter is given as (both sides have been normalized by the bandwidth [1]):

where N_{T} is the number of transmit antennas, N_{R} is the number of receive antennas, γ is the signal to interference plus noise ratio (SINR), I_{NR} is the N_{R}xN_{R} identity matrix and H is the N_{R}xN_{T} channel matrix. Furthermore, h_{ij}, an element of the matrix H defines the complex channel coefficient between the ith receive antenna and jth transmit antenna. It is quite obvious that the channel capacity (in bits/sec/Hz) is highly dependent on the structure of matrix H. Let us explore the effect of H on the channel capacity.

Let us first consider a 4×4 case (N_{T}=4, N_{R}=4) where the channel is a simple AWGN channel and there is no fading. For this case h_{ij}=1 for all values of i and j. It is found that channel capacity of this simple channel for an SINR of 10 dB is 5.36bits/sec/Hz. It is further observed that the channel capacity does not change with number of transmit antennas and increases logarithmically with increase in number of receive antennas. Thus it can be concluded that in an AWGN channel no multiplexing gain is obtained by increasing the number of transmit antennas.

We next consider a more realistic scenario where the channel coefficients h_{ij} are complex with real and imaginary parts having a Gaussian distribution with zero mean and variance 0.5. Since the channel H is random the capacity is also a random variable with a certain distribution. An important metric to quantify the capacity of such a channel is the Complimentary Cumulative Distribution Function (CCDF). This curve basically gives the probability that the MIMO capacity is above a certain threshold.

It is obvious (see figure above) that there is a very high probability that the capacity obtained for the MIMO channel is significantly higher than that obtained for an AWGN channel e.g. for an SINR of 9 dB there is 90% probability that the capacity is greater than 8 bps/Hz. Similarly for an SINR of 12 dB there is a 90% probability that the capacity is greater than 11 bps/Hz. For a stricter threshold of 99% the above capacities are reduced to 7.2 bps/Hz and 9.6 bps/Hz.

In a practical system the channel coefficients h_{ij} would have some correlation which would depend upon the antenna spacing. Lower the antenna spacing higher would be the antenna correlation and lower would be the MIMO system capacity. This would be discussed in a future post.

The MATLAB code for calculating the CCDF of channel capacity of a MIMO channel is given below.

```
clear all
close all
Nr=4;
Nt=4;
I=eye(Nr);
g=15.8489;
for n=1:10000
H=sqrt(1/2)*randn(Nr,Nt)+j*sqrt(1/2)*randn(Nr,Nt);
C(n)=log2(det(I+(g/Nt)*(H*H')));
end
[a,b]=hist(real(C),100);
a=a/sum(a);
plot(b,1-cumsum(a));
xlabel('Capacity (bps/Hz)')
ylabel('Probability (Capacity > Abcissa)')
grid on
```

[1] G. J. Foschini and M. J. Gans,”On limits of Wireless Communications in a Fading Environment when Using Multiple Antennas”, Wireless Personal Communications 6, pp 311-335, 1998.