Tensor-Based Algebraic Channel Estimation for Hybrid IRS-Assisted MIMO-OFDM
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider the channel estimation problem in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems assisted by intelligent reconfigurable surfaces (IRSs). To avoid the inherent estimation ambiguities of the two-hop channels from mobile stations (MS) to the base station (BS), we adopt a hybrid IRS architecture composed of passive reflectors and active sensors, and establish two independent subproblems of estimating the MS-to-IRS and BS-to-IRS channels. By leveraging the sparse characteristics of high-frequency propagation, we model the training signals as multi-dimensional canonical polyadic decomposition (CPD) tensors with missing fibers or slices. We develop algebraic algorithms to solve the tensor completion problems and recover channel multipath parameters, i.e., angles of arrival, time delays and path gains. Our methods require neither random initialization nor iterative operations, and for these reasons they can perform robustly with a low computational complexity. Moreover, we investigate the uniqueness condition of CPD tensor completion, which can be utilized to inform both the physical design of hybrid IRSs and the time-frequency resource allocation of training strategies. Simulation results indicate that the proposed schemes outperform the traditional counterparts in terms of accuracy, robustness and complexity, especially for the case of low-complexity IRSs with limited number of active sensing elements.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it