Bounds on rate distortion with feed forward for stationary and ergodic sources

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 385-389

  Naiss, Iddo ^a   Permuter, Haim H ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Alternating minimization procedure; Blahut Arimoto algorithm; Causal conditioning; Concatenating code trees; Directed information; Ergodic and stationary sources; Ergodic modes; Geometric programming; Rate distortion with feed forward

Indexed keywords

ALTERNATING MINIMIZATION; BLAHUT-ARIMOTO ALGORITHM; CAUSAL CONDITIONING; CONCATENATING CODE TREES; DIRECTED INFORMATION; ERGODICS; GEOMETRIC PROGRAMMING; RATE DISTORTIONS;

ALGORITHMS; INFORMATION THEORY; SIGNAL DISTORTION;

ELECTRIC DISTORTION;

EID: 80054794664     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034152     Document Type: Conference Paper

References (14)

1. C. E. Shannon. A mathematical theory of communication. Bell Syst. Tech. J., 27:379-423 and 623-656, 1948.
2. R. G. Gallager. Information theory and reliable communication. Wiley, New York, 1968.
3. T. Weissman and N. Merhav. On competitive prediction and its relation to rate-distortion theory. IEEE Trans. Inf. Theory, 49(12):3185-3194, 2003.
4. R. Venkataramanan and S. Sandeep Pradhan. Source coding with feedforward: Rate-distortion theorems and error exponents for a general source. IEEE Trans. Inf. Theory, 53(6):2154-2179, 2007.
5. R. Venkataramanan and S. Sandeep Pradhan. On computing the feedback capacity of channels and the feed-forward rate-distortion function of sources. IEEE Trans. on Communications, 58(7):1889-1896, 2010.
6. J. Massey. Causality, feedback and directed information. Proc. Int. Symp. Inf. Theory Applic. (ISITA-90), pages 303-305, Nov. 1990.
7. G. Kramer. Capacity results for the discrete memoryless network. IEEE Trans. Inf. Theory, 49(1):4-21, 2003.
8. H. Marko. The bidirectional communication theory-a generalization of information theory. IEEE Trans. on communications, COM-21:1335-1351, 1973.
9. S. Tatikonda and S. Mitter. The capacity of channels with feedback. IEEE Trans. Inf. Theory, 55:323-349, 2009.
10. H. H. Permuter, T. Weissman, and A. J. Goldsmith. Finite state channels with time-invariant deterministic feedback. IEEE Trans. Inf. Theory, 55(2):644-662, 2009.
11. Y. H. Kim. Feedback capacity of stationary gaussian channels. IEEE Trans. Inf. Theory, 56(1), January 2010.
12. I. Naiss and H. H. Permuter. Extension of the blahut-arimoto algorithm for maximizing directed information. CoRR, abs/1012.5071, submitted to IEEE Trans. Inf. Theory, 2010.
13. R. Blahut. An algorithm for computing the capacity of arbitrary discrete memoryless channels. IEEE Trans. Inf. Theory, pages 14-20, 1972.
14. S. Arimoto. Computation of channel capacity and rate-distortion functions. IEEE Trans. Inf. Theory, pages 160-473, 1972.