Explicit coding schemes are proposed to achieve the rate-distortion bound for the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion bound for the binary case. 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 for the Gaussian case. The proposed polar lattice is constructed by nesting a quantization polar lattice and an AWGN capacityachieving polar lattice.
Polar codes and polar lattices for the heegard-berger problem / Shi, J.; Liu, L.; Gunduz, D.; Ling, C.. - (2018), pp. 100-105. (Intervento presentato al convegno 24th European Wireless Conference 2018: Wireless Futures in the Era of Network Programmability, EW 2018 tenutosi a ita nel 2018).
Polar codes and polar lattices for the heegard-berger problem
Shi J.;Liu L.;Gunduz D.;
2018
Abstract
Explicit coding schemes are proposed to achieve the rate-distortion bound for the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion bound for the binary case. 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 for the Gaussian case. The proposed polar lattice is constructed by nesting a quantization polar lattice and an AWGN capacityachieving polar lattice.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
