Show simple item record

dc.contributor.advisorArıkan, Erdal
dc.contributor.authorÖnay, Saygun
dc.date.accessioned2016-01-08T20:02:49Z
dc.date.available2016-01-08T20:02:49Z
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11693/16904
dc.descriptionAnkara : The Department of Electrical and Electronics Engineering and The Graduate School of Engineering and Science of Bilkent Univesity, 2014.en_US
dc.descriptionThesis (Ph. D.) -- Bilkent University, 2014.en_US
dc.descriptionIncludes bibliographical references leaves 164-170.en_US
dc.description.abstractPolar codes were invented by Arıkan as the first “capacity achieving” codes for binary-input discrete memoryless symmetric channels with low encoding and decoding complexity. The “polarization phenomenon”, which is the underlying principle of polar codes, can be applied to different source and channel coding problems both in single-user and multi-user settings. In this work, polar coding methods for multi-user distributed source coding problems are investigated. First, a restricted version of lossless distributed source coding problem, which is also referred to as the Slepian-Wolf problem, is considered. The restriction is on the distribution of correlated sources. It is shown that if the sources are “binary symmetric” then single-user polar codes can be used to achieve full capacity region without time sharing. Then, a method for two-user polar coding is considered which is used to solve the Slepian-Wolf problem with arbitrary source distributions. This method is also extended to cover multiple-access channel problem which is the dual of Slepian-Wolf problem. Next, two lossy source coding problems in distributed settings are investigated. The first problem is the distributed lossy source coding which is the lossy version of the Slepian-Wolf problem. Although the capacity region of this problem is not known in general, there is a good inner bound called the Berger-Tung inner bound. A polar coding method that can achieve the whole dominant face of the Berger-Tung region is devised. The second problem considered is the multiple description coding problem. The capacity region for this problem is also not known in general. El Gamal-Cover inner bound is the best known bound for this problem. A polar coding method that can achieve any point on the dominant face of El Gamal-Cover region is devised.en_US
dc.description.statementofresponsibilityÖnay, Saygunen_US
dc.format.extentix, 170 leaves, chartsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectPolar codesen_US
dc.subjectdistributed codingen_US
dc.subjectsource codingen_US
dc.subjectSlepian-Wolfen_US
dc.subjectchannel codingen_US
dc.subjectmultiple-access channelen_US
dc.subjectlossy source codingen_US
dc.subjectmultiple descriptionsen_US
dc.subjectmultiuser polar codesen_US
dc.subjectsuccessive cancellation decodingen_US
dc.subjectlist decodingen_US
dc.subject.lccTK5102.92 .O53 2014en_US
dc.subject.lcshCoding theory.en_US
dc.titlePolar codes for distributed source codingen_US
dc.typeThesisen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreePh.D.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record