Optimal mappings for joint source channel coding

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Akyol, Emrah ^a   Rose, Kenneth ^a   Ramstad, Tor ^b  

^a University of California   (United States)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH EXPANSIONS; CHANNEL COMMUNICATION; CHANNEL DISTRIBUTIONS; CHANNEL POWER; CLOSED FORM; DISCRETE TIME; DISTORTION MEASURES; FINITE BLOCK LENGTH; HEURISTIC MAPPING; ITERATIVE ALGORITHM; JOINT SOURCE CHANNEL; JOINT SOURCE-CHANNEL CODING; NOISY CHANNEL; NUMERICAL RESULTS; OPTIMAL MAPPING; OPTIMALITY; OPTIMALITY CONDITIONS; SOURCE SPACE; VECTOR TRANSFORMATION;

ALGORITHMS; BANDWIDTH COMPRESSION; CHANNEL CODING; COMMUNICATION SYSTEMS; DECODING; INFORMATION THEORY; ITERATIVE METHODS; OPTIMIZATION; VECTOR SPACES;

MAPPING;

EID: 77954822723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503179     Document Type: Conference Paper

References (16)

1. T. Goblick Jr, "Theoretical limitations on the transmission of data from analog sources," IEEE Transactions on Information Theory, vol. 11, no. 4, pp. 558-567, 1965.
2. T. Cover and J. Thomas, Elements of Information Theory. J.Wiley New York, 1991.
3. M. Gastpar, B. Rimoldi, and M. Vetterli, "To code, or not to code: lossy source-channel communication revisited," IEEE Transactions on Information Theory,, vol. 49, no. 5, pp. 1147-1158, 2003.
4. C. Shannon, "Communication in the presence of noise," Proceedings of the IRE, vol. 37, no. 1, pp. 10-21, 1949.
5. V. Kotelnikov, The theory of optimum noise immunity. New York: McGraw-Hill, 1959.
6. A. Fuldseth and T. Ramstad, "Bandwidth compression for continuous amplitude channels based onvector approximation to a continuous subset of the source signal space," in IEEE International Conference on Acoustics, Speech, and Signal Processing,, vol. 4, 1997.
7. S. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, Massachusetts Institute of Technology, 2000.
8. T. Ramstad, "Shannon mappings for robust communication," Telektronikk, vol. 98, no. 1, pp. 114-128, 2002.
9. F. Hekland, G. Oien, and T. Ramstad, "Using 2: 1 Shannon mapping for joint source-channel coding," in Data Compression Conference, 2005. Proceedings. DCC 2005, 2005, pp. 223-232.
10. K. Lee and D. Petersen, "Optimal linear coding for vector channels," IEEE Transactions on Communications, vol. 24, no. 12, pp. 1283-1290, 1976.
11. T. Fine, "Properties of an optimum digital system and applications," IEEE Transactions on Information Theory, vol. 10, no. 4, pp. 287-296, 1964.
12. J. Gibson and T. Fischer, "Alphabet-constrained data compression," IEEE Transactions on Information Theory, vol. 28, no. 3, pp. 443-457, 1982.
13. D. Luenberger, Optimization by Vector Space Methods. John Wiley & Sons Inc, 1969.
14. K. Rose, "Deterministic annealing for clustering, compression, classification, regression, and related optimization problems," Proceedings of the IEEE, vol. 86, no. 11, pp. 2210-2239, 1998.
15. T. Fischer and R. Dicharry, "Vector quantizer design for memoryless Gaussian, gamma, and Laplacian sources," IEEE Transactions on Communications,, vol. 32, no. 9, pp. 1065-1069, 1984.
16. T. Lookabaugh and R. Gray, "High-resolution quantization theory and the vector quantizer advantage," IEEE Transactions on Information Theory, vol. 35, no. 5, pp. 1020-1033, 1989.