Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Filtered Gaussian Primitive Diamond Channel

Published 23 Jan 2021 in cs.IT and math.IT | (2101.09564v2)

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.

Citations (4)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.