The capacity of the semideterministic relay channel (Corresp.)

Abstract-A new coding scheme for multicasting a message over a general relay network is presented that extends both network coding for graphical networks by Ahlswede, Cai, Li, and Yeung, and partial decode-forward for relay channels by Cover and El Gamal. For the N -node Gaussian multicast network, the scheme achieves within 0.5N bits from the capacity, improving upon the best known capacity gap results. The key idea is to use multicoding at the source as in Marton coding for broadcast channels. Instead of recovering a specific part of the message as in the original partial decode-forward scheme, a relay in the proposed distributed decode-forward scheme recovers an auxiliary index that implicitly carries some information about the message and forwards it in block Markov coding. This scheme can be adapted to broadcasting multiple messages over a general relay network, extending and refining a recent result by Kannan, Raja, and Viswanath.

show abstract

“…which coincides with the partial decode-forward lower bound [2,Theorem 7]; see also the standalone version in [3] and [17,Theorem 16.3].…”

Section: Theorem 1 the Capacity Of The Dm-mn P(y N |X N ) With A Setsupporting

confidence: 73%

“…In the decode-forward coding scheme, originally proposed by Cover and El Gamal [2], the relay recovers, reencodes, and forwards the transmitted message. This digital-to-digital interface can be further combined with direct transmission via superposition coding, leading to the partial decode-forward coding scheme [2], [3].…”

Section: Introductionmentioning

confidence: 99%

Distributed decode-forward for multicast

Lim

Kim

2014

2014 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…For example, while the general noisy broadcast channel problem is open, the deterministic broadcast channel is solved (independently by Pinsker [79] and Marton [61]); while the general lossy distributed source coding problem is open (even for two users), the lossless distributed source coding problem is solved (the celebrated Slepian-Wolf Theorem [104]). Perhaps with the intuition that studying deterministic networks can provide important insights, there were some efforts devoted to this approach in the early 1980s (see deterministic relay channel [6,31], deterministic interference channel [32] among others). However, these vanguard approaches did not explicitly translate the implications of these results on deterministic networks to the noisy problems of interest.…”

Section: Introductionmentioning

confidence: 99%

An Approximation Approach to Network Information Theory

Avestimehr

Diggavi

Tian

et al. 2015

FNT in Communications and Information Theory

View full text Add to dashboard Cite

“…These have included the work on capacity theorem (e.g., [2]- [3]), relaying or cooperation protocols (e.g., [4]- [5]), diversity and multiplexing gain (e.g., [6]- [7]), etc. Recently, European Commission has been considering to apply the cooperative relay concept in the future high-data-rate wireless services.…”

Section: Introductionmentioning

confidence: 99%

Bit and power loading for OFDM with an amplify-and-forward cooperative relay

Tafazolli

2008

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Abstract-In this paper, we propose a rate-adaptive bit and power loading approach for the OFDM-based relaying communications. The cooperative relay operates in the half-duplex amplify-and-forward mode. The source and the relay has the separate power constraints. The maximum-ratio combining is employed at the destination for maximizing the received SNR. Assuming the perfect channel knowledge available at all nodes, the proposed approach is to maximize the throughput (the number of bits/symbol) at the given power constraint and the target link performance. Unlike the water-filling method, the proposed approach does not need the iterative loading process, and can offer the sub-optimum performance. Computer simulations are used to test the proposed approach for various scenarios with respect to the relay location or the distributed power allocation.

show abstract

The capacity of the semideterministic relay channel (Corresp.)

Cited by 201 publications

References 2 publications

Distributed decode-forward for multicast

Distributed decode-forward for multicast

An Approximation Approach to Network Information Theory

Bit and power loading for OFDM with an amplify-and-forward cooperative relay

Contact Info

Product

Resources

About