Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas
Bibliographic record
Abstract
This paper investigates the channel training and estimation problems for distributed space-time coding (DSTC). To use DSTC in multi-antenna relay networks, the receiver needs to know the channels between the relays and the receiver (Relay-R channels) and also the equivalent channels between the transmitter and the receiver (Equ-T-R channels). By sending pilot signals from the relays, the training of the Relay-R channels is equivalent to that of a multi-input-multi-output (MIMO) system. The training of the Equ-T-R channels can be conducted directly using DSTC; but it requires a long training period. Thus, a separate-training method is proposed, in which an estimation on the Equ-T-R channels is obtained from estimations on the channels from the transmitter to the relays (T-Relay channels) and the Relay-R channels. The pilot code designs that minimize the trace of the error covariance matrix are investigated. The requirements on the training period are also derived, from which an adaptive training-period design is proposed. Simulation shows that in some networks, even with shorter training period, the separate-training scheme can achieve better performance than the direct-training 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 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".