I-Talk: Reliable and Practical Superimposed Signal Decoding Without Power Control
Bibliographic record
Abstract
Internet-of-Things (IoT) is emerging, while the spectrum is at a premium. To enhance spectrum efficiency, a promising solution is Non-Orthogonal Multiple Access (NOMA) that enables users to communicate with the same resource at the same time, while decoding the superimposed signal at the receiver. Existing NOMA technologies, however, rely on strict power control to decode the superimposed signal, infeasible for heterogeneous and low-cost IoT devices. In contrast, we propose I-Talk, a new NOMA scheme that is designed for IoT and can decode the superimposed signals from two transmitters without power control. Importantly, considering the IoT systems in the wild, both the hardware imperfections and mobility are unavoidable, which can cause severe signal variations, resulting in an unreliable decoding performance. To solve this problem, we design a synthesis channel coefficient to track all signal offsets caused by the hardware imperfection. Meanwhile, we propose a diversity transmission and smart combining scheme to achieve high reliable decoding performance. To demonstrate the feasibility of this new NOMA approach in practical systems, we implement I-Talk with USRP devices and the experimental results illustrate that I-Talk achieves a one-order lower bit-error-rate and a 1.47× higher throughput gain than the state-of-the-art superimposed signal decoding scheme.
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.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| 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".