<?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-21T04:25:22Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/24119" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/24119</identifier><datestamp>2026-09-24T06:34:38Z</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">Chen, Jun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Zhao, Xiaoyu</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">2019-03-21T20:23:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2019-03-21T20:23:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/24119</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/15774</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The Karhunen–Loève  Transform (KLT) is prevalent nowadays in communication and&#xd;
signal processing. This thesis aims at attaining the KLT in the encoders and achieving&#xd;
the minimum sum rate in the case of Gaussian multiterminal source coding.&#xd;
In the general multiterminal source coding case, the data collected at the terminals&#xd;
will be compressed in a distributed manner, then communicated the fusion center&#xd;
for reconstruction. The data source is assumed to be a Gaussian random vector in&#xd;
this thesis. We introduce the rate-distortion function to formulate the optimization&#xd;
problem. The rate-distortion function focuses on achieving the minimum encoding&#xd;
sum rate, subject to a given distortion. The main purpose in the thesis is to propose a&#xd;
distributed KLT for encoders to deal with the sampled data and produce the minimum&#xd;
sum rate.&#xd;
To determine the distributed Karhunen–Loève  transform, we propose three kinds&#xd;
of algorithms. The  rst iterative algorithm is derived directly from the saddle point&#xd;
analysis of the optimization problem. Then we come up with another algorithm by&#xd;
combining the original rate-distortion function with Wyner's common information,&#xd;
and this algorithm still has to be solved in an iterative way. Moreover, we also propose&#xd;
algorithms without iterations. This kind of algorithms will generate the unknown&#xd;
variables from the existing variables and calculate the result directly.All those algorithms can make the lower-bound and upper-bound of the minimum&#xd;
sum rate converge, for the gap can be reduced to a relatively small range comparing&#xd;
to the value of the upper-bound and lower-bound.</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">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">multiterminal source coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Karhunen–Loève transform</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">rate–distortion function</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Determining the Distributed Karhunen-Loève Transform via Convex Semidefinite Relaxation</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>