Tensor Signal Modeling and Channel Estimation for Reconfigurable Intelligent Surface-Assisted Full-Duplex MIMO
Bibliographic record
Abstract
Channel estimation is one of the main challenges for reconfigurable intelligent surface (RIS) assisted communication systems with passive reflective elements due to the high number of parameters to estimate. In this paper, we consider channel estimation for a MIMO FD RIS-assisted wireless communication system and use tensor (multidimensional array) signal modelling techniques to estimate all channel state information (CSI) involving the self-interference, direct-path, and the RIS assisted channel links. We model the received signal as a tensor composed of two CANDECOMP/PARAFAC (CP) decomposition terms for the non-RIS and the RIS assisted links. Based on this model we extend the alternating least squares algorithm to jointly estimate all channels, then derive the corresponding Cramér-Rao Bounds (CRB). Numerical results show that compared to recent previous works which estimate the non-RIS and RIS links during separate training stages, our method provides a more accurate estimate by efficiently using all pilots transmitted throughout the full training duration without turning the RIS off when comparing the same number of total pilots transmitted. For a sufficient number of transmitted pilots, the proposed method’s accuracy comes close to the CRB for the RIS channels and attains the CRB for the direct-path and self-interference channels.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".