<?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-21T23:02:21Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/883" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/883</identifier><datestamp>2017-03-21T19:47:03Z</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" lang="en" authority="d4cdb63f-0160-4412-bf70-bee25c775aa2" confidence="600">Baligh, Mohammadhadi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:00:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:00:36Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/883</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Battail [1989] shows that an appropriate criterion for the design of long block codes is the  closeness of the normalized weight distribution to a Gaussian distribution.   A subsequent work shows  that iterated product of single parity check codes satisfy this criterion [1994].   Motivated by  these earlier works, in this thesis, we study the effect of the interleaver on the performance of  turbo codes for large block lengths, $N\rightarrow\infty$.   A parallel concatenated turbo code that  consists of two or more component codes is considered.   We demonstrate that for  $N\rightarrow\infty$, the normalized weight of the systematic  $\widehat{w_1}=\displaystyle\frac{w_1}{\sqrt{N}}$, and the parity check sequences  $\widehat{w_2}=\displaystyle\frac{w_2}{\sqrt{N}}$ and  $\widehat{w_3}=\displaystyle\frac{w_3}{\sqrt{N}}$ become a set of jointly Gaussian distributions  for the typical values of $\widehat{w_i},i=1,2,3$, where the typical values of $\widehat{w_i}$ are  defined as $\displaystyle\lim_{N\rightarrow\infty}\frac{\widehat{w_i}}{\sqrt{N}}\neq 0,1$ for  $i=1,2,3$.   To optimize the turbo code performance in the waterfall region which is dominated by  high-weight codewords, it is desirable to reduce $\rho_{ij}$, $i,j=1,2,3$ as much as possible,  where $\rho_{ij}$ is the correlation coefficient between $\widehat{w_i}$ and $\widehat{w_j}$.   It is  shown that: (i)~$\rho_{ij}&amp;gt;0$, $i,j=1,2,3$, (ii)~$\rho_{12},\rho_{13}\rightarrow 0$ as  $N\rightarrow\infty$, and (iii)~$\rho_{23}\rightarrow 0$ as $N\rightarrow\infty$ for &amp;quot;almost&amp;quot; any  random interleaver.   This indicates that for $N\rightarrow\infty$, the optimization of the  interleaver has a diminishing effect on the distribution of high-weight error events, and  consequently, on the error performance in the waterfall region.   We show that for the typical  weights, this weight distribution approaches the average spectrum defined by Poltyrev [1994].   We  also apply the tangential sphere bound (TSB) on the Gaussian distribution in AWGN channel with BPSK  signalling and show that it performs very close to the capacity for code rates of interest.   We also  study the statistical properties of the low-weight codeword structures.   We prove that for large  block lengths, the number of low-weight codewords of these structures are some Poisson random  variables.   These random variables can be used to evaluate the asymptotic probability mass function  of the minimum distance of the turbo code among all the possible interleavers.   We show that the  number of indecomposable low-weight codewords of different types tend to a set of independent  Poisson random variables.   We find the mean and the variance of the union bound in the error floor  region and study the effect of expurgating low-weight codewords on the performance.   We show that  the weight distribution in the transition region between Poisson and Gaussian follows a negative  binomial distribution.   We also calculate the interleaver gain for multi-component turbo codes based  on these Poisson random variables.   We show that the asymptotic error performance for  multi-component codes in different weight regions converges to zero either exponentially (in the  Gaussian region) or polynomially (in the Poisson and negative binomial regions) with respect to the  block length, with the code-rate and energy values close to the channel capacity.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">499971 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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="rights" lang="en">Copyright: 2006, 
  Baligh, Mohammadhadi. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Electrical &amp;amp; Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Turbo codes</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Asymptotic performance</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Weight distribution</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Gaussian distribution</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Analysis of the Asymptotic Performance of Turbo 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>