Skip to main navigation Skip to search Skip to main content

FV polar coding for lossy compression with an improved exponent

  • Runxin Wang
  • , Junya Honda
  • , Hirosuke Yamamoto
  • , Rongke Liu
  • Beihang University
  • The University of Tokyo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Polar codes achieve the rate-distortion bound for nonuniform sources and/or asymmetric distortion measures. However, the performance is not always near optimal for finite code length, especially for short code length. In this paper a new scheme for lossy source coding is proposed. In addition to polar coding, arithmetic coding is applied in the scheme. The source is first encoded by polar coding for lossy compression, then it is further compressed losslessly by arithmetic coding. It is shown that the scheme achieves the rate-distortion bound asymptotically with a good empirical performance. It is also shown that the distortion of the scheme has a better second-order exponent than those of the other polar coding schemes.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1517-1521
Number of pages5
ISBN (Electronic)9781467377041
DOIs
StatePublished - 28 Sep 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong SAR
Duration: 14 Jun 201519 Jun 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory, ISIT 2015
Country/TerritoryHong Kong SAR
CityHong Kong
Period14/06/1519/06/15

Keywords

  • arithmetic coding
  • lossy source coding
  • polar codes
  • second-order exponent

Fingerprint

Dive into the research topics of 'FV polar coding for lossy compression with an improved exponent'. Together they form a unique fingerprint.

Cite this