Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebraic structure can outperform i.i.d. codebooks...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings / IEEE International Symposium on Information Theory s. 1681 - 1686
Hlavní autoři: Pastore, Adriano, Lim, Sung Hoon, Feng, Chen, Nazer, Bobak, Gastpar, Michael
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 25.06.2023
Témata:
algebraic network information theory
Codes
Decoding
Distortion
distributed source coding
entropy
function computation
Lattices
Nested linear codes
Source coding
ISSN:2157-8117
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebraic structure can outperform i.i.d. codebooks. For the special case of finite-alphabet sources, recent work has demonstrated how to incorporate joint typicality decoding alongside linear encoding and binning. This work takes a discretization approach to extend this rate region to include both integer- and real-valued sources. As a case study, the rate region is evaluated for the Gaussian case. The resulting joint-typicality-based rate region recovers and generalizes the best-known rate region for this scenario, based on lattice encoding and sequential decoding.
ISSN:2157-8117
DOI:10.1109/ISIT54713.2023.10206990