Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources

Naiss, Iddo; Permuter, Haim H.

doi:10.48550/arxiv.1106.0895

Cited by 2 publications

(8 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a specific instance of the setting with action-independent side information, we consider here the block-feedforward model in which we have Y i = X i−1 for all i not multiple of L and Y i equal to a fixed symbol in Y i otherwise. This model is related to the feedforward set-up studied in [7], [8], [9] with the difference that here feedforward is limited to within the Lblocks. In other words, the side information is Y i = X i−1 only if X i−1 is in the same L-block as Y i and is not informative otherwise.…”

Section: Block-feedforward Modelmentioning

confidence: 99%

“…Remark 6. In the feedforward model studied in [7], [8], [9], feedforward of the source X n is not restricted to take place only within the L-blocks, namely we have…”

Section: Corollarymentioning

confidence: 99%

“…As a result, the rate-distortion function is proved in [8], [9] to be given by the limit of (26) over L.…”

Section: Corollarymentioning

confidence: 99%

“…Proof: The achievability is obtained by using concatenated codetrees of length L similar to Proposition 1. However, unlike Proposition 1, the codetrees are generated according to the distribution p(x L ||0x L−1 ) as done in [8], [9]. The proof of achievability is completed as in [8], [9].…”

Section: Corollarymentioning

confidence: 99%

“…However, unlike Proposition 1, the codetrees are generated according to the distribution p(x L ||0x L−1 ) as done in [8], [9]. The proof of achievability is completed as in [8], [9]. As for the converse, starting from (24), we write…”

Section: Corollarymentioning

confidence: 99%

See 4 more Smart Citations

Source coding with in-block memory and controllable causal side information

Simeone

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

The recently proposed set-up of source coding with a side information "vending machine" allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the encoder and on the previously measured samples of the side information, and are cost constrained. Moreover, the final estimate of the source by the decoder is a function of the encoder's message and depends causally on the side information sequence. Previous work by Permuter and Weissman has characterized the rate-distortioncost function in the special case in which the source and the "vending machine" are memoryless. In this work, motivated by the related channel coding model introduced by Kramer, the ratedistortion-cost function characterization is extended to a model with in-block memory. Various special cases are studied including block-feedforward and side information repeat request models.

show abstract

Section: Block-feedforward Modelmentioning

confidence: 99%

“…Remark 6. In the feedforward model studied in [7], [8], [9], feedforward of the source X n is not restricted to take place only within the L-blocks, namely we have…”

Section: Corollarymentioning

confidence: 99%

“…As a result, the rate-distortion function is proved in [8], [9] to be given by the limit of (26) over L.…”

Section: Corollarymentioning

confidence: 99%

Section: Corollarymentioning

confidence: 99%

Section: Corollarymentioning

confidence: 99%

See 3 more Smart Citations

Source coding with in-block memory and controllable causal side information

Simeone

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

Source Coding When the Side Information May Be Delayed

Simeone

Permuter

2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

For memoryless sources, delayed side information at the decoder does not improve the rate-distortion function. However, this is not the case for sources with memory, as demonstrated by a number of works focusing on the special case of (delayed) feedforward. In this paper, a setting is studied in which the encoder is potentially uncertain about the delay with which measurements of the side information, which is available at the encoder, are acquired at the decoder. Assuming a hidden Markov model for the source sequences, at first, a single-letter characterization is given for the set-up where the side information delay is arbitrary and known at the encoder, and the reconstruction at the destination is required to be asymptotically lossless. Then, with delay equal to zero or one source symbol, a singleletter characterization of the rate-distortion region is given for the case where, unbeknownst to the encoder, the side information may be delayed or not, and additional information can be received by the decoder when the side information is not delayed. Finally, examples for binary and Gaussian sources are provided. Index TermsRate-distortion function, Hidden Markov Model, Markov Gaussian process, multiplexing, strictly causal side information, causal conditioning.O. Simeone is with

show abstract

Computable Bounds for Rate Distortion with Feed-Forward for Stationary and Ergodic Sources

Cited by 2 publications

References 0 publications

Source coding with in-block memory and controllable causal side information

Source coding with in-block memory and controllable causal side information

Source Coding When the Side Information May Be Delayed

Contact Info

Product

Resources

About