Unitary Query for the <inline-formula> <tex-math notation="TeX">$M\times L\times N$</tex-math></inline-formula> MIMO Backscatter RFID Channel
Bibliographic record
Abstract
A multiple-input multiple-output backscatter radio frequency identification (RFID) system consists of three operational ends: the query end (with$M$reader transmitting antennas), the tag end (with$L$tag antennas), and the receiving end (with$N$reader receiving antennas). Such an$M\times L\times N$setting in RFID can bring spatial diversity and has been studied with the use of space-time code (STC) at the tag end. Current research generally has ignored query signaling as a means to improve performance. Here we propose a novelunitary queryscheme, which creates time diversitywithin the channel coherent timeand can yield significant performance improvements. To overcome the difficulty of evaluating the performance when unitary query is employed at the query end and STC is employed at the tag end, we derive a new measure based on the ranks of certain carefully constructed matrices to show that unitary query has superior performance. Simulations show that unitary query can bring 5–10 dB gain in mid signal-to-noise ratio regimes. In addition, different from the conventional uniform query case, unitary query can also improve the performance of single-antenna tags significantly, enabling single-antenna tags with low complexity and small size to be used for high performance.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.224 | 0.105 |
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".