ML-Based Channel Estimations for Non-Regenerative Relay Networks with Multiple Transmit and Receive Antennas
Bibliographic record
Abstract
This paper investigates the channel estimations in a relay network with multiple transmit and receive antennas, including the estimation of the end-to-end channel matrix and the individual estimation of the transmitter-relay channels and the relay-receiver channels. For the end-to-end channel estimation, instead of directly estimating entries of the channel matrix, we use singular value decomposition (SVD) and estimate its largest singular value and singular vectors, which are then combined to form an estimation of the channel matrix. An approximate maximum-likelihood (ML) estimation is proposed, which is shown to become the exact ML estimation when the time duration of each training step equals the number of antennas at the transmitter. Simulation on the mean square error (MSE) shows that the SVD-based approximate ML estimation performs about the same as the exact ML estimation and is superior to entry-based estimations. For the individual channel estimation, we decompose each channel vector into the product of its length and direction, and find the ML estimation of each. By using an approximation on the probability density function (PDF) of the observations during training, an analytical ML estimation is derived. The ML estimation with the exact PDF is also investigated and a solution is obtained numerically. Simulation on the MSE shows that the two have similar performance. Compared with cascade channel estimations, its performance is superior for the relay-receiver channel estimation and comparable for the transmitter-relay channel estimation. Extension to the general multiple-antenna multiple-relay network is also provided.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".