An Extended Alamouti Code for Four-Antenna Backscatter Tags
Bibliographic record
Abstract
Backscatter communications, an emerging low-cost and low-consumption green communication paradigm, has received significant attention in both industry and academia. In recent years, multiple-input multiple-output (MIMO) technology has also been integrated into backscatter communications to meet the requirements of transmission performance in IoT scenarios. However, due to the hardware limitations of backscatter tags, one of the main challenges for multi-antenna backscatter tags is to reduce the circuit complexity of space-time block codes (STBC) while maintaining transmission performance. Although low-complexity STBC for dual-antenna tags has been explored, to the best of our knowledge, research on high-performance, low-complexity STBC for four-antenna tags remains in its infancy. In this paper, we propose a 2×4 extended Alamouti code (EAC) with full-rate capability for MIMO backscatter communications. The results show that the required impedance of the proposed EAC on the backscatter tag is less than half of that of the conventional orthogonal STBC (OSTBC), which considerably reduces the complexity of the tag circuit. Additionally, we also derive the asymptotic closed form expression of the symbol error rate (SER) of the proposed EAC to obtain the system insights. The derivation results show that the achievable diversity order of the proposed EAC in 1×4×N backscatter channel is 2×min(2,N), which indicates that the proposed EAC can achieve the same diversity performance as the conventional OSTBC by setting an appropriate number of receiver antennas. Finally, numerical simulations are performed to validate the accuracy of our analysis and the superiority of the proposed EAC in SER.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| 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".