2007-10-312007-10-312000-05-202001-10-18"Joint Source Channel Coding for Discrete Memoryless Channels," <i>Masters Thesis,</i> 2000.https://hdl.handle.net/1911/19731Masters ThesisThe design of optimal joint source/channel coding and decoding is examined for dis­ crete memoryless channels with end­to­end distortion as the criterion for reliable com­ munication. Joint source/channel encoders which map sequences of source symbols directly to sequences of channel symbols without any intermediate "bit" representa­ tion of source are considered. Optimum joint source/channel decoder that minimizes end­to­end distortion for a given encoder mapping is derived. The encoder mapping can be many to one, in the sense that many source sequences can be mapped to one sequence of channel symbols. To begin with, as an exercise, random coding bound on end­to­end distortion is derived for a general Maximum A Posteriori (MAP) decoder which has some estimate on the apriori probabilities of source symbols. It is shown that, the KL distance of the actual apriori probabilities with the estimated ones plays an important role. Then, a random coding bound on end­to­end distortion is derived with our optimal minimum distortion decoder mentioned above for the case when all source symbols are equally likely. It is shown that the performance increase with min­ imum distortion decoding as opposed to MAP (same as Maximum Likelihood (ML) decoding in this case when all source symbols are equally likely) is characterized by the faster decay of end­to­end distortion with respect to channel use.engjoint source/channelMaximum A Posteriori (MAP)Maximum Likelihood (ML)decodingThesisjoint source/channelMaximum A Posteriori (MAP)Maximum Likelihood (ML)decoding