Performance Analysis of Full-Duplex Relaying Employing Fiber-Connected Distributed Antennas
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Different from the previous studies on distributed-antenna (DA) systems (DASs) that mostly focused on the enhancement of downlink or uplink performance of cellular systems through cooperation of DAs, this paper proposes and investigates the performance of a novel fiber-connected DA relay system (DARS) that employs radio-over-fiber (RoF) techniques to interconnect a DAS to a central processor, which collectively form a relay node. Under the assumption that self-interference can be perfectly canceled in DARS, full-duplex (FD) operation is possible, by which some antennas receive from the source, whereas other antennas simultaneously transmit to the destination. The numbers of transmit and receive antennas can be controlled to achieve a balance between the transmissions of the source-relay (SR) and relay-destination (RD) links. Consequently, higher spectral efficiency can be achieved compared with half-duplex (HD) relaying systems. For Nakagami fading channels with no direct source-destination (SD) link, we show that DARS can obtain the optimal diversity-multiplexing tradeoff (DMT). Moreover, as the primary purpose of FD relaying is to increase the throughput, we also analyze the throughput performance of DARS. Numerical results show that the FD-DARS with a large number of antennas exhibits a much better throughput performance than HD relaying systems and in regions with high signal-to-noise ratios.
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.
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.001 | 0.000 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| 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 it