Performance Tradeoff Between Overhead and Achievable SNR in RIS Beam Training

Abstract

Efficient beam training is the key challenge in the codebook-based configuration of reconfigurable intelligent surfaces (RISs) because the beam training overhead can have a strong impact on the achievable system performance. In this paper, we study the performance tradeoff between overhead and achievable signal-to-noise ratio (SNR) in RIS beam training while taking into account the size of the targeted coverage area, the RIS response time, and the delay for feedback transmissions. Thereby, we consider three common beam training strategies: full search (FS), hierarchical search (HS), and tracking-based search (TS). Our analysis shows that the codebook-based illumination of a given coverage area can be realized with wide- or narrow-beam designs, which result in two different scaling laws for the achievable SNR. Similarly, there are two regimes for the overhead, where the number of pilot symbols required for reliable beam training is dependent on and independent of the SNR, respectively. Based on these insights, we reveal that the overhead for FS beam training can be significantly reduced by employing large RISs and wide beams. Moreover, we show that, depending on the RIS response time, feedback delay, and codebook size, FS beam training may outperform HS beam training. In addition, we derive an upper bound on the user velocity for which the overhead is generally negligible. Finally, we present numerical simulation results that verify our theoretical analysis. In particular, our results confirm the existence of the proposed SNR scaling laws and overhead regimes, demonstrate the benefits of wide beams and large RISs, reveal that fast RISs can lead to negligible overhead for FS beam training, and show that large feedback delays can significantly reduce the performance for HS beam training.