Asymptotic CRB Analysis of Random RIS-Assisted Large-Scale Localization Systems

November 20, 2023 Β· Declared Dead Β· πŸ› 2024 IEEE/CIC International Conference on Communications in China (ICCC)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zhengyu Wang, Hongzheng Liu, Rujing Xiong, Fuhai Wang, Robert Caiming Qiu arXiv ID 2311.11582 Category cs.IT: Information Theory Cross-listed eess.SP Citations 0 Venue 2024 IEEE/CIC International Conference on Communications in China (ICCC) Last Checked 4 months ago
Abstract
This paper studies the performance of a randomly RIS-assisted multi-target localization system, in which the configurations of the RIS are randomly set to avoid high-complexity optimization. We first focus on the scenario where the number of RIS elements is significantly large, and then obtain the scaling law of CramΓ©r-Rao bound (CRB) under certain conditions, which shows that CRB decreases in the third or fourth order as the RIS dimension increases. Second, we extend our analysis to large systems where both the number of targets and sensors is substantial. Under this setting, we explore two common RIS models: the constant module model and the discrete amplitude model, and illustrate how the random RIS configuration impacts the value of CRB. Numerical results demonstrate that asymptotic formulas provide a good approximation to the exact CRB in the proposed randomly configured RIS systems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted