LTE relay backhaul design for sparsely-populated environments
Bibliographic record
Abstract
In the latest release of the Long Term Evolution (LTE) standards, which will be completed in September 2011, it was decided to standardize relay nodes (RN) for the purpose of improving coverage. This makes RNs very suitable tools for increasing the coverage of low population density areas. The RN is a new type of node that was not previously standardized in 3GPP before and, as such, created new challenges. In particular, for RN, the backhaul link (connecting the enhanced Node B (eNB) and the RN) needs to be defined, and both uplink and downlink grants need to be conveyed to the RNs, either using existing channels (e.g., the Packet Dedicated Control Channel (PDCCH)), or a new channel (commonly referred to as the Relay-PDCCH (R-PDCCH)). In this paper, we discuss both channels for the Frequency Division Duplex (FDD) mode and show that using a R-PDCCH is a more efficient channel. In addition, several features are provided to ensure good performance for the R-PDCCH, such as robust use of frequency diversity by transmitting the R-PDCCH using Distributed Virtual Resource Blocks (DVRBs), or use of rate-matching to ensure optimal usage of the allocated resources for R-PDCCH transmission. This robustness is considered necessary to ensuring good reliability for sparsely populated areas.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".