Successive coding in multiuser information theory

IEEE Transactions on Information Theory

Volumn 53, Issue 6, 2007, Pages 2246-2254

  Zhang, Xin ^a,b   Chen, Jun ^a,c   Wicker, Stephen B ^a   Berger, Toby ^a,d  

^a Cornell University   (United States)

^b QUALCOMM INC   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d University of Virginia   (United States)

Author keywords

Broadcast channel; Dirty paper coding; Distributed source coding; Gram Schmidt orthogonalization; Multiple access; Multiple descriptions; Successive coding

Indexed keywords

CHANNEL CODING; MULTIPLE ACCESS INTERFERENCE; MULTIUSER DETECTION; RADIO STATIONS;

DIRTY PAPER CODING; DISTRIBUTED SOUCE CODING; GRAM-SCHMIDT ORTHOGONALIZATION; MULTIPLE DESCRIPTIONS;

INFORMATION THEORY;

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

References (38)

1. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," in Proc. IRE Nat. Conv. Rec., Mar. 1959, pp. 142-163.
2. J. K. Su, J. J. Eggers, and B. Girod, "Illustration of the duality between channel coding and rate distortion with side information," in Proc. Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2000.
3. T. M. Cover and M. Chiang, "Duality between channel capacity and rate distortion with two-sided state information," IEEE Trans. Inf. Theory, vol 48, pp. 1629-1638, Jun. 2002.
4. B. Chen and G. Wornell, "The duality between information embedding and source coding with side information and some applications," IEEE Trans. Inf. Theory, vol 49, pp. 1159-1180, May 2003.
5. S. S. Pradhan, J. Chou, and K. Ramchandran, "Duality between source coding and channel coding and its extension to the side information case," IEEE Trans. Inf. Theory, vol. 49, pp. 1181-1203, May 2003.
6. H. Wang and P. Viswanath, "Fixed binning schemes for channel and source coding problems: An operational duality," IEEE Trans. Inf. Theory submitted for publication.
7. A. D. Wyner and J. Ziv, "The rate distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. 22, pp. 1-10, Jan. 1976.
8. S. I. Gel'fand and M. S. Pinsker, "Coding for channel with random parameters," Probl. Contr. Inf. Theory, vol 9, no. 1, pp. 19-31, 1980.
9. P. Viswanath and D. N. C. Tse, "Sum capacity of the vector Gaussian broadcast channel and uplink downlink duality," IEEE Trans. Inf. Theory, vol. 49, pp. 1912-1921, Aug. 2003.
10. S. Vishwanath, N. Jindal, and A. Goldsmith, "Duality, achievable rates and sum-rate capacity of Gaussian MIMO broadcast channels," IEEE Trans. Inf. Theory, vol 49, no. 10, pp. 2658-2668, Oct. 2003.
11. W. Yu and J. M. Cioffi, "Sum capacity of Gaussian vector broadcast channels," IEEE Trans. Inf. Theory, vol. 50, pp. 1875-1892, Sep. 2004.
12. P. Viswanath, "Sum rate of a class of Gaussian multiterminal source coding problems," in Advances in Network Information Theory, P. Gupta, G. Kramer, and A. Wijngaarden Eds. Providence, RI: DIMACS, American Mathematical Society, 2004, pp. 43-60.
13. W. Yu, "Duality and the value of cooperation in distributive source and channel coding problems," in Proc. 41st Annu. Allerton Conf. Commun., Contr., Comput., Monticello, IL, Oct. 2003.
14. A. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
15. L. Ozarow, "On a source coding problems with two channels and three receivers," Bell Syst. Tech. J., vol. 59, no. 10, pp. 1909-1921, Dec. 1980.
16. R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE Trans. Inf. Theory, vol. IT-31, pp. 721-726, Nov. 1985.
17. Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-33, pp. 502-521, Jul. 1987.
18. R. Venkataramani, G. Kramer, and V. K. Goyal, "Multiple description coding with many channels," IEEE Trans. Inf. Theory, vol. IT-49, pp. 2106-2114, Sep. 2003.
19. S. S. Pradhan, R. Puri, and K. Ramchandran, "n-channel symmetric multiple descriptions-part I: (n.k) source-channel erasure codes," IEEE Trans. Inf. Theory, vol. 50, pp. 47-61, Jan. 2004.
20. J. Edmonds, "Submodular functions, matroids and certain polyhedra," in Combinatorial Structures and their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schonheim, Eds. New York: Gordon and Breach, 1970, pp. 69-87.
21. D. N. C. Tse and S. V. Hanly, "Multiaccess fading channels-part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. Inf. Theory, vol. 44, pp 2796-2815, Nov. 1998.
22. T. Berger, "Multiterminal source coding," in The Information Theory Approach to Communications, G. Longo, Ed. New York: Springer-Verlag, 1978, vol. 229, CISM Courses and Lectures, pp. 171-231.
23. J. Chen, C. Tian, T. Berger, and S. S. Hemami, "Multiple description quantization via Gram-Schmidt orthogonalization," IEEE Trans. Inf. Theory, vol. 52, pp. 5197-5217, Dec. 2006.
24. A. J. Grant, B. Rimoldi, R. L. Urbanke, and P. A. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. Inf. Theory, vol. 47, pp. 873-890, Mar. 2001.
25. R. Zamir, S. Shamai, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, pp. 1250-1276, Jun. 2002.
26. K. Marton, "A coding theorem for the discrete memoryless broadcast channels," IEEE Trans. Inf. Theory, vol. 25, no. 3, pp. 306-311, May 1979.
27. G. Caire and S. Shamai, "On the achievable throughput in multantenna Gaussian broadcast channel," IEEE Trans. Inf. Theory, vol. 49, pp. 1691-1706, Jul. 2003.
28. M. Costa, "Writing on dirty paper," IEEE Trans. Inf. Theory, vol. IT-29, pp. 439-441, May 1983.
29. P. P. Bergmans, "A simple converse for broadcast channels with additive white Gaussian noise," IEEE Trans. Inf. Theory, pp. 279-280, Mar. 1974.
30. B. Rimoldi and R. Urbanke, "On the structure of the dominant face of multiple access channels," in Proc. Inf. Theory Commun. Workshop, South Africa, Jun. 20-25, 1999, pp. 12-14.
31. A. B. Carleial, "On the Capacity of Multiple-Terminal Communication Networks," Ph.D., Stanford Univ., Stanford, CA, 1975.
32. B. Rimoldi and R. Urbanke, "A rate splitting approach to the Gaussian multiple-access channel," IEEE Trans. Inf. Theory, vol. 42, pp. 364-375, Mar. 1996.
33. B. Rimoldi, "Generalized time sharing: A low-complexity capacity-achieving multiple-access technique," IEEE Trans. Inf. Theory, vol. 47, pp. 2432-2442, Sep. 2001.
34. S. Y. Tung, "Multiterminal Source Coding," Ph.D., Cornell Univ., School of Electrical Engineering, Ithaca, NY, 1978.
35. J. Chen, X. Zhang, T. Berger, and S. B. Wicker, "An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem," IEEE J. Sel. Areas Commun., vol. 22, pp. 977-987, Aug. 2004.
36. 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.
37. T. P. Coleman A. H. Lee, M. Médard, and M. Effros, "Low-complexity approaches to Slepian-Wolf near-lossless distributed date compression," IEEE Trans. Inf. Theory, vol. 52, pp. 3546-3561, Aug. 2006.
38. J. Chen and T. Berger, "Successive Wyner-Ziv coding scheme and its application to the quadratic Gaussian CEO problem," IEEE Trans. Inf. Theory, submitted for publication.