Cascade and Triangular Source Coding With Side Information at the First Two Nodes

Permuter, Haim H.; Weissman, Tsachy

doi:10.1109/tit.2012.2188273

Cited by 13 publications

(5 citation statements)

References 34 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…since Y is a function of (X, Z). Thus, the sum-rate constraints in ( 20) and ( 21) become redundant, and (20) reduces to (21).…”

Section: Acknowledgementmentioning

confidence: 99%

“…both receivers desire the same data, and they have additional side-information. Permuter and Weissman [21] also explore the role of side-information at the initial nodes and provide an explicit solution for Gaussian random variables. Cuff, Su and El Gamal [22] study a variant where X and Y are provided at the first and second nodes of the cascade, while the receiving node seeks a function f (X, Y ).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secure cascade channel synthesis

Satpathy

Cuff

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

We consider the problem of generating correlated random variables in a distributed fashion, where communication is constrained to a cascade network. The first node in the cascade observes an i.i.d. sequence X n locally before initiating communication along the cascade. All nodes share bits of common randomness that are independent of X n . We consider secure synthesis -random variables produced by the system appear to be appropriately correlated and i.i.d. even to an eavesdropper who is cognizant of the communication transmissions. We characterize the optimal tradeoff between the amount of common randomness used and the required rates of communication. We find that not only does common randomness help, its usage exceeds the communication rate requirements. The most efficient scheme is based on a superposition codebook, with the first node selecting messages for all downstream nodes. We also provide a fleeting view of related problems, demonstrating how the optimal rate region may shrink or expand.

show abstract

“…since Y is a function of (X, Z). Thus, the sum-rate constraints in ( 20) and ( 21) become redundant, and (20) reduces to (21).…”

Section: Acknowledgementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Secure cascade channel synthesis

Satpathy

Cuff

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…For some special cases, inner and outer bounds on the rate-distortion region, that do not agree in general, are known, e.g., in [2] for the case L = 2. A related work for the case L = 2 has also appeared in [3]. For the general case with L ≥ 2, although a single-letter characterization of the rate-distortion region seems to be out of reach, one can distinguish essentially two different transmission approaches or modes.…”

Section: Introductionmentioning

confidence: 99%

In-network compression for multiterminal cascade MIMO systems

Aguerri

Zaidi

2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

We study the problem of receive beamforming in uplink cascade multiple-input multiple-output (MIMO) systems as an instance of that of cascade multiterminal source coding for lossy function computation. Using this connection, we develop two coding schemes for the second and show that their application leads to beamforming schemes for the first. In the first coding scheme, each terminal in the cascade sends a description of the source that it observes; the decoder reconstructs all sources, lossily, and then computes an estimate of the desired function. This scheme improves upon standard routing in that every terminal only compresses the innovation of its source w.r.t. the descriptions that are sent by the previous terminals in the cascade. In the second scheme, the desired function is computed gradually in the cascade network, and each terminal sends a finer description of it. In the context of uplink cascade MIMO systems, the application of these two schemes leads to centralized receive-beamforming and distributed receive-beamforming, respectively. Numerical results illustrate the performance of the proposed methods and show that they outperform standard routing.

show abstract

“…the relay terminal and the transmitter intend to reconstruct two distorted sequences of the source sequence. Permuter and Weissman established the rate distortion capacity region of the cascade and triangular networks where side information is available at the transmitter and the relay terminal [7]. Chia et al extended the Permuter's model to a network in which a degraded side information is also available at the receiver [8].…”

Section: Introductionmentioning

confidence: 99%

Empirical coordination in a triangular multiterminal network

Bereyhi

Bahrami

Mirmohseni

et al. 2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

In this paper, we investigate the problem of the empirical coordination in a triangular multiterminal network. A triangular multiterminal network consists of three terminals where two terminals observe two external i.i.d correlated sequences. The third terminal wishes to generate a sequence with desired empirical joint distribution. For this problem, we derive inner and outer bounds on the empirical coordination capacity region. It is shown that the capacity region of the degraded source network and the inner and outer bounds on the capacity region of the cascade multiterminal network can be directly obtained from our inner and outer bounds. For a cipher system, we establish key distribution over a network with a reliable terminal, using the results of the empirical coordination. As another example, the problem of rate distortion in the triangular multiterminal network is investigated in which a distributed doubly symmetric binary source is available.

show abstract

Cascade and Triangular Source Coding With Side Information at the First Two Nodes

Cited by 13 publications

References 34 publications

Secure cascade channel synthesis

Secure cascade channel synthesis

In-network compression for multiterminal cascade MIMO systems

Empirical coordination in a triangular multiterminal network

Contact Info

Product

Resources

About