Joint Source Channel Coding for Discrete Memoryless Channels

Simple item page
dc.citation.bibtexNamemastersthesisen_US
dc.citation.journalTitleMasters Thesisen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.creatorBharadwaj, Vinayen_US
dc.date.accessioned2007-10-31T00:37:02Zen_US
dc.date.available2007-10-31T00:37:02Zen_US
dc.date.issued2000-05-20en_US
dc.date.modified2003-07-12en_US
dc.date.submitted2001-10-18en_US
dc.descriptionMasters Thesisen_US
dc.description.abstractThe 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.en_US
dc.identifier.citation "Joint Source Channel Coding for Discrete Memoryless Channels," <i>Masters Thesis,</i> 2000.en_US
dc.identifier.urihttps://hdl.handle.net/1911/19731en_US
dc.language.isoengen_US
dc.subjectjoint source/channelen_US
dc.subjectMaximum A Posteriori (MAP)en_US
dc.subjectMaximum Likelihood (ML)en_US
dc.subjectdecodingen_US
dc.subject.keywordjoint source/channelen_US
dc.subject.keywordMaximum A Posteriori (MAP)en_US
dc.subject.keywordMaximum Likelihood (ML)en_US
dc.subject.keyworddecodingen_US
dc.titleJoint Source Channel Coding for Discrete Memoryless Channelsen_US
dc.typeThesisen_US
dc.type.dcmiTexten_US
thesis.degree.levelMastersen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Bha2000May2JointSourc.PS
Size:
597.04 KB
Format:
Postscript Files
Download
Collections
ECE Publications