Universal zero-delay joint source-channel coding

IEEE Transactions on Information Theory

Volumn 52, Issue 12, 2006, Pages 5240-5250

  Matloub, Shahriyar ^a,b   Weissman, Tsachy ^a,b  

^a IEEE   (United States)

^b Stanford University   (United States)

Author keywords

Discrete memoryless channel (DMC); Finite state encoder decoder; Individual sequences; Joint source channel coding; Markov encoder decoder; Zero delay schemes

Indexed keywords

DISCRETE MEMORYLESS CHANNEL (DMC); FINITE-STATE ENCODER/DECODER; INDIVIDUAL SEQUENCES; JOINT SOURCE-CHANNEL CODING; MARKOV ENCODER/DECODER; ZERO-DELAY SCHEMES;

ASYMPTOTIC ANALYSIS; DECODING; FINITE AUTOMATA; MARKOV PROCESSES; SET THEORY;

CHANNEL CODING;

EID: 33947433947     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.885537     Document Type: Article

References (26)

1. J. C. Walrand and P. Varaiya, "Optimal causal coding-decoding problems," IEEE Trans. Inf. Theory, vol. IT-29, no. 6, pp. 814-820, Nov. 1983.
2. T. Ericson, "A result on delay-less information transmission," in Proc. IEEE Int. Symp. Information Theory, Grignano, Italy, Jun. 1979.
3. N. T. Gaarder and D. Slepian, "On optimal finite-state digital transmission systems," in P roc. IEEE Int. Symp. Information Theory, Grignano, Italy, Jun. 1979.
4. _, "On optimal finite-state digital transmission systems," IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 167-186, Mar. 1982.
5. H. S. Witsenhausen, "On the structure of real-time source coders," Bell Syst. Tech. J., vol. 58, no. 6, pp. 1437-1451, Jul./Aug. 1979.
6. D. Teneketzis, "On the structure of optimal real-time encoders and decoders in noisy communication," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4017-4035, Sep. 2006.
7. V. S. Borkar, S. K. Mitter, and S. Tatikonda, "Optimal sequential vector quantization of Markov sources," SIAM J. Contr. Optimiz., vol. 40, no. 1, pp. 135-148, 2001.
8. D. L. Neuhoff and R. K. Gilbert, "Causal source codes," IEEE Trans. Inf. Theory, vol. IT-28, no. 5, pp. 701-713, Sep. 1982.
9. S. P. Lloyd, "Rate vs. fidelity for the binary source," Bell Syst. Tech. J., vol. 56, no. 3, pp. 427-437, Mar. 1977.
10. P. Piret, "Causal sliding block encoders with feedback," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 237-240, Mar. 1979.
11. T. Linder and R. Zamir, "Causal source coding of stationary sources with high resolution," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 28.
12. R. K. Gilbert and D. L. Neuhoff, "Bounds to the performance of causal codes for Markov sources," in Proc. Allerton Conf. Communication, Contril and Computing, Monticello, IL, 1979, pp. 284-292.
13. J. Devore, "A note on the observation of a Markov source through a noisy channel," IEEE Trans. Inf. Theory, vol. IT-20, no. 6, pp. 762-764, Nov. 1974.
14. E. Ordentlich and T. Weissman, "On the optimality of symbol-by-symbol filtering and denoising," IEEE Trans. Inf. Theory, vol. 52, no. I, pp. 19-40, Jan. 2006.
15. N. Merhav and I. Kontoyiannis, "Source coding exponents for zero-delay coding with finite memory," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 609-625, Mar. 2003.
16. T. Weissman, E. Ordentlich, G. Seroussi, S. Verdú, and M. Weinberger, "Universal discrete denoising: Known channel," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 5-28, Jan. 2005.
17. J. Ziv, "Distortion-rate theory for individual sequences," IEEE Trans. Inf. Theory, vol. IT-26, no. 2, pp. 137-143, Mar. 1980.
18. T. Linder and G. Lugosi, "A zero-delay sequential scheme for lossy coding of individual sequences," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2533-2538, Sep. 2001.
19. T. Weissman and N. Merhav, "Limited-delay lossy coding and filtering of individual sequences," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 721-733, Mar. 2002.
20. A. Gyórgy, T. Linder, and G. Lugosi, "A 'follow the perturbed leader'-type algorithm for zero-delay quantization of individual sequences," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2004, pp. 342-351.
21. _, "Efficient algorithms and minimax bounds for zero-delay lossy source coding," IEEE Trans. Signal Process., vol. 52, no. 8, pp. 2337-2347, Aug. 2004.
22. L. Devroye, L. Györfi, and G. Lugosi, A Probabilistic Theory of Pattern Recognition. New York: Springer-Verlag, 1996.
23. J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inf. Theory, vol. IR-24, no. 5, pp. 530-536, Sep. 1978.
24. M. Feder, N. Merhav, and M. Gutman, "Universal prediction of individual sequences," IEEE Trans. Inf. Theory, vol. 38, no. 4, pp. 1258-1270, Jul. 1992.
25. E. Ordentlich, T. Weissman, M. J. Weinberger, A. Somekh Baruch, and N. Merhav, "Discrete universal filtering through incremental parsing," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2004, pp. 352-361.
26. J. Hannan, "Approximation to Bayes risk in repeated plays," in Contributions to the Theory of Games, M. Dresher, A. Tucker, and P. Wolfe, Eds. Princeton, NJ: Princeton Univ. Press, 1957, vol. 3, pp. 97-139.