<?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-22T14:07:00Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3440" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3440</identifier><datestamp>2017-03-21T20:06:47Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="01c8f7f7-8f3a-430a-8576-66c7ad36a80b" confidence="600">Ma, Xudong</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-12-13T19:33:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-12-13T19:33:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-12-13T19:33:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3440</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis focuses on designing Low-Density Parity-Check (LDPC)&#xd;
codes for forward-error-correction. The target application is&#xd;
real-time multimedia communications over packet networks.  We&#xd;
investigate two code design issues, which are important in the&#xd;
target application scenarios,  designing LDPC codes with low&#xd;
decoding latency, and constructing capacity-approaching LDPC codes&#xd;
with very low error probabilities.&#xd;
&#xd;
&#xd;
On designing LDPC codes with low decoding latency, we present a&#xd;
framework for optimizing the code parameters so that the decoding&#xd;
can be fulfilled after only a small number of iterative decoding&#xd;
iterations. The brute force approach for such optimization is&#xd;
numerical intractable, because it involves a difficult discrete&#xd;
optimization programming. In this thesis, we show an asymptotic&#xd;
approximation to the number of decoding iterations. Based on this&#xd;
asymptotic approximation, we propose an approximate optimization&#xd;
framework for finding near-optimal code parameters, so that the&#xd;
number of decoding iterations is minimized. The approximate&#xd;
optimization approach is numerically tractable. Numerical results&#xd;
confirm that the proposed optimization approach has excellent&#xd;
numerical properties, and codes with excellent performance in terms&#xd;
of number of decoding iterations can be obtained. Our results show&#xd;
that the numbers of decoding iterations of the codes by the proposed&#xd;
design approach can be as small as one-fifth of the numbers of&#xd;
decoding iterations of some previously well-known codes. The&#xd;
numerical results also show that the proposed asymptotic&#xd;
approximation is generally tight for even non-extremely limiting&#xd;
cases.&#xd;
&#xd;
&#xd;
On constructing capacity-approaching LDPC codes with very low error&#xd;
probabilities, we propose a new LDPC code construction scheme based&#xd;
on $2$-lifts. Based on stopping set distribution analysis, we&#xd;
propose design criteria for the resulting codes to have very low&#xd;
error floors. High error floors are the main problems of previously&#xd;
constructed capacity-approaching codes, which prevent them from&#xd;
achieving very low error probabilities. Numerical results confirm&#xd;
that codes with very low error floors can be obtained by the&#xd;
proposed code construction scheme and the design criteria. Compared&#xd;
with the codes by the previous standard construction schemes, which&#xd;
have error floors at the levels of $10^{-3}$ to $10^{-4}$, the codes&#xd;
by the proposed approach do not have observable error floors at the&#xd;
levels higher than $10^{-7}$. The error floors of the codes by the&#xd;
proposed approach are also significantly lower compared with the&#xd;
codes by the previous approaches to constructing codes with low&#xd;
error floors.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Error-correction</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Low-Density Parity-Check Codes</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">On Constructing Low-Density Parity-Check Codes</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>