For a two-relay diamond network with channel state known only at the relays, the paper derives computable upper bounds and simple achievable schemes whose simulated rates nearly match those bounds.
The Filtered Gaussian Primitive Diamond Channel
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We investigate the special case of diamond relay comprising a Gaussian channel with identical frequency response from the user to the relays and fronthaul links with limited rate from the relays to the destination. We use the oblivious compress and forward (CF) with distributed compression and decode and forward (DF) where each relay decodes the whole message and sends half of its bits to the destination. We derive achievable rate by using time-sharing between DF and CF. It is proved that optimal CF-DF time sharing is advantageous over superposition of CF and DF. The optimal time sharing proportion between DF and CF and power and rate allocations are different at each frequency and are fully determined.
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor
For a two-relay diamond network with channel state known only at the relays, the paper derives computable upper bounds and simple achievable schemes whose simulated rates nearly match those bounds.