Source-Channel Coding Theorems for the Multiple-Access Relay Channel

Murin, Yonathan; Dabora, Ron; Gündüz, Deniz

doi:10.1109/tit.2013.2260592

Cited by 22 publications

(52 citation statements)

References 45 publications

(86 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We conclude that the MSE decreases with γ, for all values of k. Hence, the optimal γ is determined by the per-symbol average power constraint, and is given by ν σ 2 s , where ν is specified in (33).…”

Section: ) Optimal Estimator and Resulting Msementioning

confidence: 84%

“…Remark 1. Note that in (5) we use a per-symbol average power constraint, similarly to [33,Eq. (22)] and [34, Sec.…”

Section: B System Modelmentioning

confidence: 99%

“…Finally, Fig. 4b illustrates ν, computed using (33), as a function of ρ s . Following the result of Prop.…”

Section: This Implies Thatmentioning

confidence: 99%

“…3 also minimizes the distance D(Q u , Q u,1 ) among all scaling coefficients which satisfy (5). , where ν is given in (33). Moreover, the scaling which minimizes D(Q u , γQ s ), regardless of (5), is given by:…”

Section: This Implies Thatmentioning

confidence: 99%

See 3 more Smart Citations

Finite-Length Linear Schemes for Joint Source-Channel Coding over Gaussian Broadcast Channels with Feedback

Murin

Kaspi

Dabora

et al. 2017

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Abstract-We study linear encoding for a pair of correlated Gaussian sources transmitted over a two-user Gaussian broadcast channel in the presence of unit-delay noiseless feedback, abbreviated as the GBCF. Each pair of source samples is transmitted using a linear transmission scheme in a finite number of channel uses. We investigate three linear transmission schemes: A scheme based on the Ozarow-Leung (OL) code, a scheme based on the linear quadratic Gaussian (LQG) code of Ardestanizadeh et al., and a novel scheme derived in this work using a dynamic programming (DP) approach. For the OL and LQG schemes we present lower and upper bounds on the minimal number of channel uses needed to achieve a target mean-square error (MSE) pair. For the LQG scheme in the symmetric setting, we identify the optimal scaling of the sources, which results in a significant improvement of its finite horizon performance, and, in addition, characterize the (exact) minimal number of channel uses required to achieve a target MSE. Finally, for the symmetric setting, we show that for any fixed and finite number of channel uses, the DP scheme achieves an MSE lower than the MSE achieved by either the LQG or the OL schemes.

show abstract

Section: ) Optimal Estimator and Resulting Msementioning

confidence: 84%

“…Remark 1. Note that in (5) we use a per-symbol average power constraint, similarly to [33,Eq. (22)] and [34, Sec.…”

Section: B System Modelmentioning

confidence: 99%

“…Finally, Fig. 4b illustrates ν, computed using (33), as a function of ρ s . Following the result of Prop.…”

Section: This Implies Thatmentioning

confidence: 99%

Section: This Implies Thatmentioning

confidence: 99%

See 2 more Smart Citations

Finite-Length Linear Schemes for Joint Source-Channel Coding over Gaussian Broadcast Channels with Feedback

Murin

Kaspi

Dabora

et al. 2017

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…The joint source-channel coding proposed by Han and Costa includes Marton's coding for the DM-BC with independent messages [4] as a special case. More recently, the joint-source channel coding problem has been studied for transmitting arbitrarily correlated sources over some other multiuser channels and necessary and sufficient conditions have been provided for them ( [5]- [8]). It is worth noting that, in general, for multiuser channels with distributed transmitters such as the MAC, joint source-channel coding causes a cooperation between the transmitters through generating correlation-preserving codebook and thereby, helps communication.…”

Section: Introductionmentioning

confidence: 99%

Joint source-channel coding for broadcast channel with cooperating receivers

Bahrami¹,

Razeghi²,

Monemizadeh³

et al. 2015

2015 IEEE Information Theory Workshop - Fall (ITW)

View full text Add to dashboard Cite

It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for some certain multiuser channels, e.g., multiple access channel (MAC) and broadcast channel (BC). In this paper, we obtain a sufficient condition for transmitting arbitrarily correlated sources over a discrete memoryless BC with cooperating receivers, where the receivers are allowed to exchange messages via a pair of noisy cooperative links. It is seen that our result is a general form of previous ones and includes them as its special cases.

show abstract

Partial feedback impact on achievable rate region in multiple‐access relay channels

Taghavi

Hodtani

2018

Int J Communication

View full text Add to dashboard Cite

Summary For discrete memoryless Slepian‐Wolf multiple‐access relay channel with relay‐sources feedback (SW‐MARC‐RSF), an achievable rate region via partial decode and forward strategy at the relay is proposed, and by extending the results to the continuous alphabet version, the corresponding achievable rate region of the Gaussian SW‐MARC‐RSF is obtained. It is shown that our results include the important previous works on multiple‐access channel (MAC) with feedback (Cover‐Leung rate region) and without feedback (Slepian‐Wolf [SW] rate region, etc) as special cases. Finally, through comparison of the achievable rate regions, with and without feedback, the impact of feedback on achievability is analyzed. The derived achievable rate region is shown to resolve the residual uncertainty at the receiver in an efficient way and demonstrates that in the partial decode and forward strategy, relay‐sources feedback increases the achievable rate region in both discrete memoryless and Gaussian multiple‐access relay channels.

show abstract

Source-Channel Coding Theorems for the Multiple-Access Relay Channel

Cited by 22 publications

References 45 publications

Finite-Length Linear Schemes for Joint Source-Channel Coding over Gaussian Broadcast Channels with Feedback

Finite-Length Linear Schemes for Joint Source-Channel Coding over Gaussian Broadcast Channels with Feedback

Joint source-channel coding for broadcast channel with cooperating receivers

Partial feedback impact on achievable rate region in multiple‐access relay channels

Contact Info

Product

Resources

About