<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T06:22:13Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/17393" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/17393</identifier><datestamp>2026-09-24T03:31:56Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Wu, Xiaolin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Dumitrescu, Sorina</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Wang, Xiaohan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-05-28T13:19:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-05-28T13:19:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-01</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/17393</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/7976</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p> This thesis launches some new inquires and makes significant progress in the active&#xd;
research areas of joint source-channel coding and multiple description coding. Two&#xd;
interesting but previously untreated problems are investigated and partially settled:&#xd;
1) can index assignment of source codewords be optimized with respect to a given&#xd;
joint source-channel decoding scheme, and if so, how? 2) can joint source-channel&#xd;
coding be optimized with respect to a given multiple description code, and if so,&#xd;
how?&lt;/p> &lt;p> The first problem is formulated as one of quadratic assignment. Although quadratic assignment is NP-hard in general, we are able to develop a near-optimum index assignment algorithm for joint source-channel (JSC) maximum a posteriori (MAP)&#xd;
decoding, if the input is a Gaussian Markov sequence of high correlation. For general&#xd;
cases, good heuristic solutions are proposed. Convincing empirical evidence is&#xd;
presented to demonstrate the performance improvement of the index assignments&#xd;
optimized for MAP decoding over those designed for hard-decision decoding.&lt;/p> &lt;p> The second problem is motivated by applications of signal communication and estimation in resource-constrained lossy networks. To keep the encoder complexity at a minimum, a signal is coded by a multiple description quantizer (MDQ) without channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to combat transmission errors. A key design objective is resource scalability: powerful nodes in the network can perform JSC-MD estimation under the criteria of maximum a posteriori probability or minimum mean-square error (MMSE), while primitive nodes resort to simpler multiple description (MD) decoding, all working with the same MDQ code. The application of JSC-MD to distributed estimation of hidden Markov models in a sensor network is demonstrated. The proposed JSC-MD MAP estimator is an algorithm of the longest path in a weighted directed acyclic graph, while the JSC-MD MMSE decoder is an extension of the well-known forward-backward algorithm to multiple descriptions. They outperform the existing&#xd;
hard-decision MDQ decoders by large margins.&lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">joint, source-channels, coding, description, signal, networks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">New Advances in Joint Source-Channel and Multiple Description Coding</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>