Cooperative Diversity with Multiple-Antenna Nodes in Fading Relay Channels
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
In this paper, we investigate the performance of a single-relay cooperative scenario where the source, relay and destination terminals are equipped with multiple transmit/receive antennas. We assume that conventional space-time block codes are employed in the underlying source-to-destination (SrarrD), source-to-relay (S rarr R) and relay-to-destination (R rarr D) links, and consider both decode-and-forward (DaF) and amplify - and-forward (AaF) relaying techniques. For the latter one, we consider two variants based on the availability of channel state information (CSI); namely, blind AaF and CSI-assisted AaF. Through the derivation of pairwise error probability, we quantify analytically the impact of multiple antenna deployment for each relaying technique under various scenarios which involve relay location and power control assumptions imposed on cooperating nodes. Our transmission model assumes that the source and destination terminals are equipped with M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> transmit and N receive antennas, respectively, and the relay terminal is equipped with M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> receive and M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> transmit antennas. For a scenario where R rarr D and S rarr D links are balanced and S rarr R link experiences sufficiently large SNR, our performance analysis demonstrates that the maximum achievable diversity order is M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> min(M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> , N)+M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> N for blind AaF scheme and N(M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> +M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> ) for both CSI-assisted AaF and DaF schemes. For another scenario where R rarr D link has a sufficiently large SNR and S rarr R and S rarr D links are balanced, CSI-assisted AaF, blind AaF and DaF schemes achieve diversity orders of M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> (N + M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> ), M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> (N + M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> ), and M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> N, respectively. Other scenarios involving the availability of non-fading R rarr D link and poor inter-user channel quality are further investigated. An extensive Monte Carlo simulation study is also presented to corroborate the analytical results and to provide detailed performance comparisons among the three relaying techniques under consideration.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.003 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.003 | 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