On Total Transmission Power Minimization Approach to Decentralized Beamforming in Single-Carrier Asynchronous Bidirectional Relay-Assisted Communication Networks
Bibliographic record
Abstract
Considered in this paper is a single-carrier asynchronous bidirectional cooperative network with amplify-and-forward relays helping two transceivers to exchange information. The network is asynchronous in the sense that the delays of propagation along different relaying paths are significantly different from each other. As a result, the channel between the two transceivers is best modeled with a multi-tap impulse response, which can cause interference between adjacent symbols at the end nodes. In a block-wise communication scheme, a cyclic prefix can be appended to each transmitted block of information symbols to avoid interference between adjacent blocks. To suppress interference within each block, however, the network parameters, namely, the relay complex weights and the transceivers' transmit powers should be judiciously chosen. To do so, we herein minimize, over these parameters, the total transmission power consumption throughout the network, under two constraints which ensure that the transceivers' data rates are above two given thresholds. It is herein proved that solving this total transmission power minimization problem leads to the impulse response of end-to-end channel having only a single non-zero tap. Indeed, our analysis shows that only the relays associated with this non-zero tap have to be selected to participate in the information exchange between the two transceivers. We present a simple 1-D integer search algorithm for optimally determining the index of the non-zero tap of the channel impulse response of the end-to-end channel. We also present computationally simple semi-closed-form expressions for the optimal values of the design parameters. Our numerical results show that under identical rate thresholds, in our power allocation scheme, for any channel realization, half of the power budget is allocated to the two transceivers and the remaining half is shared among all the relay nodes.
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.001 |
| Open science | 0.001 | 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".