Capacity of Single-Link MIMO Channels
In this chapter, we will address the following issues.
• We start with a reminder on the concept of capacity in SISO channels, and introduce different scenarios depending on the coherence time of the fading channel.
• We continue by evaluating the capacity of a deterministic channel, and we introduce the popular water-filling algorithm.
• Then, we extend these results to the case of fast-fading channels, and calculate the ergodic capacity for two schemes: when a perfect channel state information is available at the transmitter (CSIT), or when the system has at most a partial (stochastic) knowledge of the channel at the transmitter. In the latter, the transmitter is informed about the channel distribution, ...