Prerequisites & Notation
Before You Begin
Real RIS hardware supports only a finite set of phase states — typically levels for -bit control. The continuous-phase algorithms of Chapters 5–7 need a quantization layer before deployment. This chapter formalizes discrete-phase optimization and quantifies its loss.
- Continuous-phase AO and passive algorithms (Chapters 5–6)(Review ch05)
Self-check: Write the continuous-phase passive subproblem and state how element-wise BCD solves it.
- Hardware phase quantization (Chapter 2)(Review ch02)
Self-check: Recall the coherent SNR loss for -bit quantization.
- Projection onto discrete sets, rounding
Self-check: For a set , write the projection .
- Combinatorial optimization: greedy algorithms, exhaustive search complexity
Self-check: For RIS elements and phase levels per element, what is the brute-force search space?
- SDR relaxation (Chapter 6)(Review ch06)
Self-check: Recall the lifted PSD variable and the relaxation of the rank-1 constraint.
Notation for This Chapter
Discrete-phase notation. We introduce the level count , bit depth , and projection operators; the basic RIS symbols carry over from Chapters 1–6.
| Symbol | Meaning | Introduced |
|---|---|---|
| Bits of phase resolution per RIS element | s01 | |
| Number of phase levels per element | s01 | |
| Phase step size | s01 | |
| Set of admissible phase values | s01 | |
| Discrete feasible set for (a finite discrete torus of points) | s01 | |
| Nearest-level projection of onto | s02 | |
| Discrete-phase efficiency factor: for coherent case | s04 | |
| Best achievable objectives with -bit and continuous phases | s04 |