Some users are experiencing upload errors at the moment. If you receive a "UWSpace is down for maintenance" error, please email jordan.hale@uwaterloo.ca as soon as possible. We are very sorry for the inconvenience.

Show simple item record

dc.contributor.authorChaudhari, Pragaten
dc.date.accessioned2006-08-22 14:01:33 (GMT)
dc.date.available2006-08-22 14:01:33 (GMT)
dc.date.issued2000en
dc.date.submitted2000en
dc.identifier.urihttp://hdl.handle.net/10012/904
dc.description.abstractThe modeling of the soft-output decoding of a binary linear block code using a Binary Phase Shift Keying (BPSK) modulation system (with reduced noise power) is the main focus of this work. With this model, it is possible to provide bit error performance approximations to help in the evaluation of the performance of binary linear block codes. As well, the model can be used in the design of communications systems which require knowledge of the characteristics of the channel, such as combined source-channel coding. Assuming an Additive White Gaussian Noise channel model, soft-output Log Likelihood Ratio (LLR) values are modeled to be Gaussian distributed. The bit error performance for a binary linear code over an AWGN channel can then be approximated using the Q-function that is used for BPSK systems. Simulation results are presented which show that the actual bit error performance of the code is very well approximated by the LLR approximation, especially for low signal-to-noise ratios (SNR). A new measure of the coding gain achievable through the use of a code is introduced by comparing the LLR variance to that of an equivalently scaled BPSK system. Furthermore, arguments are presented which show that the approximation requires fewer samples than conventional simulation methods to obtain the same confidence in the bit error probability value. This translates into fewer computations and therefore, less time is needed to obtain performance results. Other work was completed that uses a discrete Fourier Transform technique to calculate the weight distribution of a linear code. The weight distribution of a code is defined by the number of codewords which have a certain number of ones in the codewords. For codeword lengths of small to moderate size, this method is faster and provides an easily implementable and methodical approach over other methods. This technique has the added advantage over other techniques of being able to methodically calculate the number of codewords of a particular Hamming weight instead of calculating the entire weight distribution of the code.en
dc.formatapplication/pdfen
dc.format.extent801263 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.rightsCopyright: 2000, Chaudhari, Pragat. All rights reserved.en
dc.subjectElectrical & Computer Engineeringen
dc.subjectsoft-output decodingen
dc.subjecterror performanceen
dc.subjectbinary linear block codesen
dc.subjectlog-likelihood ratioen
dc.subjectweight distributionen
dc.titleAnalytical Methods for the Performance Evaluation of Binary Linear Block Codesen
dc.typeMaster Thesisen
dc.pendingfalseen
uws-etd.degree.departmentElectrical and Computer Engineeringen
uws-etd.degreeMaster of Applied Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages