Distributed concatenated Alamouti code designs for one-way relay networks using uniquely-factorable PSK constellation
Bibliographic record
Abstract
This paper develops a novel uniquely-factorable constellation pair (UFCP) by carefully factorizing phase-shift keying (PSK) constellation. With this unique factorization, a new distributed concatenated Alamouti code is proposed for a one-way relaying network consisting of two single-antenna terminals and one relay having two antennas. This design allows the relay to transmit its own information while forwarding the source information which it has received to the destination. By making use of the Alamouti coding scheme twice and jointly processing the signals from the two antennas at the relay node, such a code design also renders the equivalent channel between source and destination be a product of the two Alamouti channels and therefore, is called distributed concatenated Alamouti space-time block code (STBC). In addition, the asymptotic symbol error probability (SEP) formula is derived with the maximum likelihood (ML) detector, showing that the optimal diversity gain function is achieved and proportional to ln SNR/SNR2.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".