Low-complexity approaches to slepian-wolf near-lossless distributed data compression

IEEE Transactions on Information Theory

Volumn 52, Issue 8, 2006, Pages 3546-3561

  Coleman, Todd P ^a   Lee, Anna H ^b   Medard, Médard ^b   Effros, Michelle ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b USA   (United States)

^c California Institute of Technology   (United States)

Author keywords

Block codes; Communication systems; Data compression; Decoding; Iterative methods

Indexed keywords

ALGORITHMS; BLOCK CODES; CORRELATION THEORY; DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; LINEAR PROGRAMMING; RANDOM PROCESSES;

DISTRIBUTED DATA COMPRESSION; FRACTIONAL VERTICES; LOW-DENSITY PARITY CHECK CODES (LDPCS); SLEPIAN-WOLF PROBLEM;

DATA COMMUNICATION SYSTEMS;

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

References (37)

1. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. 19, pp. 471-480, 1973.
2. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inf. Theory, vol. 21, pp. 226-228, 1975.
3. I. Csiszár, "Linear codes for sources and source networks: Error exponents, universal coding," IEEE Trans. Inf. Theory, vol. 28, pp. 585-592, 1982.
4. T. M. Cover and J. Thomas, Elements of Information Theory. New York, NY: Wiley, 1991.
5. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting codes and decoding: Turbo codes," in Proc. IEEE Int. Commun. Conf., 1993.
6. J. Garcia-Frias and Y. Zhao, "Compression of correlated binary sources using turbo codes," IEEE Commun. Lett., vol. 5, pp. 417-419, Oct. 2001.
7. A. Aaron and B. Girod, "Compression with side information using turbo codes," in Proc. IEEE Data Compress. Conf., Apr. 2002, pp. 252-261.
8. J. Bajcsy and P. Mitran, "Coding for the Slepian-Wolf problem with turbo codes," in IEEE Proc. GLOBECOM, Nov. 2001, pp. 1400-1404.
9. A. Liveris, Z. Xiong, and C. Georghiades, "Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes," in Proc. IEEE DCC, Brest, France, Mar. 2003, pp. 193-202.
10. R. Gallagher, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, pp. 21-28, Jan. 1962.
11. T. Tian, J. Garcia-Frias, and W. Zhong, "Compression of correlated sources using LDPC codes," in Proc. IEEE Data Compress. Conf., 2003.
12. D. Schonberg, S. S. Pradhan, and K. Ramchandran, "LDPC codes can approach the Slepian-Wolf bound for general binary sources," in Proc. 40th Allerton Conf. Commun., Contr. Comput., Oct. 2002.
13. A. D. Liveris, Z. Xiong, and C. Georghiades, "Compression of binary sources with side information at the decoder using LDPC codes," IEEE Commun. Lett., vol. 6, pp. 440-442, Oct. 2003.
14. J. Garcia-Frias and W. Zhong, "LDPC codes for compression of multi-terminal sources with hidden Markov correlation," IEEE Commun. Lett., vol. 7, pp. 115-117, Mar. 2003.
15. A. Liveris, C. Lan, K. Narayanan, Z. Xiong, and C. Georghiades, "Slepian-Wolf coding of three binary sources using LDPC codes," in Proc. Int. Symp. Turbo Codes Rel. Topics, Brest, France, Sep. 2003.
16. B. Rimoldi and R. Urbanke, "A rate-splitting approach to the Gaussian multiple access channel," IEEE Trans. Inf. Theory, vol. 42, pp. 364-375, 1996.
17. A. Grant, B. Rimoldi, R. Urbanke, and P. A. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. Inf. Theory, vol. 47, pp. 873-890, 2001.
18. B. Rimoldi and R. Urbanke, "Asynchronous Slepian-Wolf coding via source-splitting," in Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, Jun.-Jul. 29-4, 1997, p. 271.
19. F. M. J. Willems, "Totally asynchronous Slepian-Wolf data compression," IEEE Trans. Inf. Theory, vol. 34, pp. 35-44, 1988.
20. I. Csiszár, "The method of types," IEEE Trans. Inf. Theory, vol. 44, pp. 2205-2523, 1998.
21. B. Rimoldi, "Generalized time sharing: A low-complexity capacity-achieving multiple-access technique," IEEE Trans. Inf. Theory, vol. 47, pp. 2432-2442, 2001.
22. G. Forney, R. Koetter, J. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," Codes, Syst. Graph. Models, pp. 101-112, 2001.
23. B. J. Frey, R. Koetter, and A. Vardy, "Signal space characterization of iterative decoding," IEEE trans. Inf. Theory, vol. 47, pp. 766-781, 2001.
24. R. Koetter and P. O. Vontobel, "Graph-cover and iterative decoding of finite length codes," in Proc. Turbo Codes Conf., Brest, 2003.
25. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 2004.
26. J. Feldman, T. Malkin, C. Stein, R. A. Servedio, and M. J. Wainright, "LP decoding corrects a constant fraction of errors," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, III, Jun.-Jul. 27-2, 2004.
27. J. Feldman, M. Wainright, and D. R. Karger, "Using linear programming to decode linear codes," in Proc. Conf. Inf. Sci. Syst., The John Hopkins University, Baltimore, MD, Mar. 2003.
28. J. Feldman, "Decoding Error-Correcting Codes via Linear Programming," Ph.D., Department of Electrical Engineering and Computer Science, Massachussetts Institute of Technology, Cambridge, MA, 2003.
29. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, pp. 1710-1722, 1996.
30. A. Barg and G. Zémor, "Error exponent of expander codes," IEEE Trans. Inf. Theory, vol. 48, pp. 1725-1729, 2002.
31. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, "Randomness conductors and constant-degree expansion beyond the degree/2 barrier," in Proc. 34th ACM Symp. Theory Comput., 2002, pp. 659-668.
32. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, 2001.
33. G. D. Forney, "Codes on graphs: Normal realizations," IEEE Trans. Inf. Theory, pp. 101-112, 2001.
34. A. Amarou and R. Urbanke, Ldpcopt [Online]. Available: http:// lthcwww.epfl.ch/research/ldpcopt/
35. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena Scientific, 1997.
36. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, "On the intractability of certain coding problems," IEEE Trans. Inf. Theory, vol. 24, pp. 384-386, 1978.
37. T. P. Coleman, A. H. Lee, M. Médard, and M. Effros, "On some new approaches to practical Slepian-Wolf compression inspired by channel coding," in Proc. IEEE Data Compress. Conf., Snowbird, Utah, Mar. 23-25, 2004.