Lossless polar compression of g-ary sources

Date
2013
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
2013 IEEE International Symposium on Information Theory
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
1132 - 1136
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

In this paper, lossless polar compression of g-ary memoryless sources in the noiseless setting is investigated. Polar compression scheme for binary memoryless sources, introduced by Cronie and Korada, is generalized to sources over prime-size alphabets. In order to reduce the average codeword length, a compression scheme based on successive cancellation list decoding is proposed. Also, a specific configuration for the compression of correlated sources is considered, and it is shown that the introduced polar compression schemes achieve the corner point of the admissible rate region. Based on this result, proposed compression schemes are extended to arbitrary finite source alphabets by using a layered approach. © 2013 IEEE.

Course
Other identifiers
Book Title
Keywords
Average codeword length, Compression scheme, Correlated sources, Finite sources, Layered approaches, List decoding, Memoryless source, Successive cancellation, Information theory
Citation
Published Version (Please cite this version)