SER of Orthogonal Space–Time Block Codes Over Rician and Nakagami- $m$ RF Backscattering Channels
Bibliographic record
Abstract
The multiple-input–multiple-output (MIMO) radio-frequency (RF) identification system applies the RF backscattering principle, and its physical channel exhibits a special kind of cascaded structure different from conventional wireless channels and other cascaded channels (e.g., the keyhole MIMO channel). In this paper, we provide a general formulation to study orthogonal space–time block codes (OSTBCs) for RF backscattering with different fading assumptions and then analytically study the symbol-error-rate (SER) performances for this channel under Rician fading and Nakagami-$m$fading. We find that the diversity order achieves$L$for Rician fading and achieves$L\min(m_{f}, Nm_{b})$for Nakagami-$m$fading. Two receiving antennas$(N = \hbox{2})$can capture most of the receiving side gain regardless of the number of tag antennas$L$for Rician fading, and this is also applicable to Nakagami-$m$fading if the two links of the cascaded structure have similar channel conditions. More interestingly, we show that the performance of the this channel is more sensitive to the channel condition (the$K$factor or the$m$parameter) of the forward link than that of the backscattering link.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.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".