Circular RIS-Enabled Channel Estimation and Localization for Multi-User ISAC Systems
Bibliographic record
Abstract
Integrated sensing and communication (ISAC) is emerging as a key enabler to address the increasing demands of spectrum and throughput for ubiquitous sensing and communication. Hereafter, we consider the channel estimation and localization for multi-user ISAC systems assisted by the reconfigurable intelligent surface (RIS) technology. In order to acquire precise environmental information, we propose a novel circular RIS architecture with circularly arranged reflecting unit cells. By modeling the training signal as a low-rank third-order canonical polyadic tensor, we transform the channel estimation problem into a tensor deconstruction task. By leveraging the phase mode excitation principle, we develop a customized RIS training pattern, and retrieve the equivalent channel parameters by subspace estimation algorithms. By exploring the characteristics of RIS array manifolds and free-space propagation, we implement a unique decoupling of channel parameters for user localization, which cannot be supported by traditional linear RIS topologies. Moreover, the design degrees of freedom in the spatial and frequency dimensions are also exploited to further enhance the proposed algorithms. Simulation results indicate that the circular RIS-enabled channel estimation schemes can recover the propagation information with remarkable accuracy, thereby offering a high-level resolution of localization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".