RIS Codebook Index Assignment under Imperfect Control Links Using TSP-Inspired Optimization
Liangshun Wu, Wen Chen, Qingqing Wu, Xudong Bai, Kunlun Wang

TL;DR
This paper introduces a TSP-inspired heuristic algorithm for robust RIS codebook index assignment, improving performance under feedback errors in wireless communication systems.
Contribution
It formulates the index assignment as a TSP-like problem and proposes a novel three-phase heuristic to enhance robustness and scalability.
Findings
Outperforms conventional indexing strategies in simulations.
Achieves near-optimal robustness to index errors.
Scalable and hardware-agnostic for real-time deployment.
Abstract
Reconfigurable Intelligent Surfaces (RIS) promise transformative gains in wireless communications by enabling programmable control of the propagation environment through discrete phase configurations. In practical deployments, the control of RIS phase states is typically managed using finite codebooks, with configuration indices transmitted over low latency, yet imperfect, wireless feedback channels. Even rare feedback bit errors can lead to significant mismatches between intended and applied RIS states, degrading system performance. This paper addresses the challenge of robust RIS codebook index assignment by formulating it as a combinatorial optimization problem, equivalent to the Traveling Salesman Problem (TSP), where codewords are "cities" and edge weights reflect SNR degradation under codeword confusion. A novel three-phase heuristic algorithm is proposed to solve this, consisting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Technologies · Advanced Wireless Communication Techniques · Advanced MIMO Systems Optimization
