Show simple item record

dc.contributor.authorShahidi, Shervinen
dc.date2011-09-25 19:43:28.785
dc.date.accessioned2011-09-28T21:57:25Z
dc.date.available2011-09-28T21:57:25Z
dc.date.issued2011-09-28
dc.identifier.urihttp://hdl.handle.net/1974/6772
dc.descriptionThesis (Master, Electrical & Computer Engineering) -- Queen's University, 2011-09-25 19:43:28.785en
dc.description.abstractMost of the conventional communication systems use channel interleaving as well as hard decision decoding in their designs, which lead to discarding channel memory and soft-decision information. This simplification is usually done since the complexity of handling the memory or soft-decision information is rather high. In this work, we design two lossy joint source-channel coding (JSCC) schemes that do not use explicit algebraic channel coding for a recently introduced channel model, in order to take advantage of both channel memory and soft-decision information. The channel model, called the non-binary noise discrete channel with queue based noise (NBNDC-QB), obtains closed form expressions for the channel transition distribution, correlation coefficient, and many other channel properties. The channel has binary input and $2^q$-ary output and the noise is a $2^q$-ary Markovian stationary ergodic process, based on a finite queue, where $q$ is the output's soft-decision resolution. We also numerically show that the NBNDC-QB model can effectively approximate correlated Rayleigh fading channels without losing its analytical tractability. The first JSCC scheme is the so called channel optimized vector quantizer (COVQ) and the second scheme consists of a scalar quantizer, a proper index assignment, and a sequence maximum a posteriori (MAP) decoder, designed to harness the redundancy left in the quantizer's indices, the channel's soft-decision output, and noise time correlation. We also find necessary and sufficient condition when the sequence MAP decoder is reduced to an instantaneous symbol-by-symbol decoder, i.e., a simple instantaneous mapping.en
dc.language.isoengen
dc.relation.ispartofseriesCanadian thesesen
dc.rightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.en
dc.subjectchannel with Markovian memoryen
dc.subjectquantizationen
dc.subjectFading channelsen
dc.subjectsoft-decision demodulationen
dc.subjectMAP decodingen
dc.subjectJoint source-channel codingen
dc.titleRobust Lossy Source Coding for Correlated Fading Channelsen
dc.typethesisen
dc.description.degreeM.A.Sc.en
dc.contributor.supervisorAlajaji, Fadyen
dc.contributor.supervisorLinder, Tamásen
dc.contributor.departmentElectrical and Computer Engineeringen
dc.degree.grantorQueen's University at Kingstonen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record