On the performance of MIMO RFID backscattering channels
Bibliographic record
Abstract
In order to increase the reliability of data transmission, using multiple antennas in radio frequency identification (RFID) systems has been investigated by researchers, mainly through measurements and simulations. The multiple-input multiple-output (MIMO) RFID backscattering channel exhibits a special type of cascaded structure rather than that of other better-studied cascaded channels such as the keyhole fading and the double scattering fading. In this article, we analytically study the bit error rate performances of the MIMO RFID channel under two transmission schemes, the identical signaling transmission scheme and the orthogonal space-time coding scheme (OSTBC). We show that the diversity order of the MIMO RFID channel is min(N, L) under the identical transmission scheme, and the diversity order is L under the OSTBC scheme, where L is the number of tag antennas and N is the number of reader receiving antennas. A performance bottleneck is also observed in the MIMO RFID channel. Our results can provide useful guidance on designing an RFID system with multiple antennas.
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.002 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".