Back to search

McMaster University

Polar Codes for Multiple Descriptions

Abstract

dc:description.abstract

<p>Two coding schemes based on polar codes are proposed for the multiple description (MD) problem. The first scheme is an adaptation of the one developed by \c{S}a\c{s}o\u{g}lu {\em et al.} for the multiple access channel to the MD setting. Specifically, it is shown that the scheme is able to achieve certain rate pairs on the dominant line of the achievable rate region determined by El Gamal and Cover (EGC) when the associated auxiliary random variables have different prime alphabet sizes. Different from polar coding for the multiple access channel considered by \c{S}a\c{s}o\u{g}lu {\em et al.}, the auxiliary random variables in the MD problem can be dependent, and their alphabet sizes play an unexpected important role in the construction. The second scheme is based on the idea of rate splitting. We show that it can achieve the entire EGC rate region. The effectiveness of the proposed polar coding schemes is verified by the experimental results.</p>

Degree

thesis:*
Department dc:contributor.department
Electrical and Computer Engineering
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Shi, Qi
Advisors dc:contributor.advisor
  • Chen, Jun
  • D. Zhao and S. Dumitrescu

Subjects

dc:subject × 2

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/8112
9203
4551140

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Shi, Qi. Polar Codes for Multiple Descriptions. 2013. http://hdl.handle.net/11375/13293