Wavy Signals and Striped Constellations for Backscatter Communications: Origins and Solutions
Bibliographic record
Abstract
Backscatter communications (BCs), allowing passive devices to transmit information by reflecting incident RF signals, have emerged as an attractive solution for the green Internet of Things (IoT). In the practical implementation of BC systems, we observe two common and interesting phenomena: wavy backscatter signals and striped-shape constellation clusters. These phenomena differ significantly from the traditional point-to-point communication and the theoretical BC systems, substantially degrading the system performance. Unfortunately, their causes and potential solutions remain unexplored. Motivated by this, this paper investigates the origins and designs of the corresponding solving methods. Specifically, we first reveal the causes of these phenomena: the time-varying interference stemming from the phase-locked loop (PLL) non-ideality. Then, we introduce our solutions: the dynamic self-interference cancellation (DSIC) and the data-aided decision boundary (DDB) algorithms. Finally, we implement and evaluate our solutions on a practical BC platform. Experimental results show that our solutions can reduce the bit error rate (BER) by up to two orders of magnitude, extend the communication range by over three times, and maintain linear runtime complexity, demonstrating their effectiveness and applicability in practical BC systems.
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 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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".