English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the Gaussian interference channel with an intermediate relay as amain building block for cooperative interference networks. On the achievabilityside, we consider compress-and-forward based strategies. Specifically, ageneralized compress-and-forward strategy, where the destinations jointlydecode the compression indices and the source messages, is shown to improveupon the compress-and-forward strategy which sequentially decodes thecompression indices and source messages, and the recently proposed generalizedhash-and-forward strategy. We also construct a nested lattice code basedcompute-and-forward relaying scheme, which outperforms other relaying schemeswhen the direct link is weak. In this case, it is shown that, with a relay, theinterference link can be useful for decoding the source messages. Noting theneed for upperbounding the capacity for this channel, we propose a newtechnique with which the sum rate can be bounded. In particular, the sumcapacity is upperbounded by considering the channel when the relay node hasabundant power and is named potent for that reason. For the Gaussianinterference relay channel with potent relay, we study the strong and the weakinterference regimes and establish the sum capacity, which, in turn, serve asupperbounds for the sum capacity of the GIFRC with finite relay power.Numerical results demonstrate that upperbounds are tighter than the cut-setbound, and coincide with known achievable sum rates for many scenarios ofinterest. Additionally, the degrees of freedom of the GIFRC are shown to be 2when the relay has large power, achievable using compress-and-forward.

The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay