Pith. sign in

REVIEW 1 cited by

The Filtered Gaussian Primitive Diamond Channel

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.09564 v2 pith:6D7BRKUV submitted 2021-01-23 cs.IT math.IT

classification cs.ITmath.IT
keywords ratechanneldestinationdiamondforwardfrequencygaussianoptimal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor

    cs.IT 2025-07 accept novelty 6.0 of 10

    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.

Pith tools