Prerequisites & Notation
Prerequisites for Chapter 12
MIMO detection sits at the intersection of linear algebra (Chapter 1), hypothesis testing and ML estimation (Chapters 3-5), and lattice geometry. The reader should be fluent with the first; comfortable with the second; and willing to pick up lattice theory on the fly.
- Gram matrices, QR decomposition, and least squares projection(Review ch01)
Self-check: Given with full column rank, can you write the projector onto the column space of and compute its complement?
- Complex Gaussian random vectors and their covariance structure(Review ch02)
Self-check: If , what is the distribution of ?
- Maximum likelihood detection for discrete hypotheses(Review ch05)
Self-check: For with white Gaussian, why does ML reduce to minimum distance?
- Linear MMSE estimation under a linear Gaussian model(Review ch06)
Self-check: Can you write the LMMSE estimator for from ?
- MIMO capacity and channel chain rule (background)
Self-check: Can you state the mutual information for a Gaussian MIMO channel with ?
Notation for This Chapter
We use for the MIMO channel matrix throughout. The transmitted vector is drawn from a discrete constellation alphabet (QPSK, 16-QAM, etc.); the noise is circularly symmetric complex Gaussian.
| Symbol | Meaning | Introduced |
|---|---|---|
| MIMO channel matrix; receive antennas, transmit antennas | s01 | |
| Constellation alphabet (e.g., QPSK: ) | s01 | |
| Transmitted symbol vector | s01 | |
| Circularly symmetric complex Gaussian noise | s01 | |
| Maximum-likelihood estimate of | s01 | |
| Linear detector filters (zero-forcing, MMSE) | s02 | |
| Post-detection SINR on the -th stream | s02 | |
| Lattice generated by basis | s04 | |
| Search radius in sphere decoding | s04 | |
| LLL reduction parameter, | s05 |