pith. sign in

arxiv: 1702.01042 · v2 · pith:FCAVIF4Inew · submitted 2017-02-03 · 💻 cs.IT · math.IT

Polar Codes and Polar Lattices for the Heegard-Berger Problem

classification 💻 cs.IT math.IT
keywords polarlatticecodescodingnestedachievechannelconstruction
0
0 comments X
read the original abstract

Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel coding, respectively. Moreover, a similar nested polar lattice construction is employed when the source and the side information are jointly Gaussian. The proposed polar lattice is constructed by nesting a quantization polar lattice and a capacity-achieving polar lattice for the additive white Gaussian noise channel.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.