Integer-Forcing Source Coding
From MaRDI portal
Publication:2989655
DOI10.1109/TIT.2016.2629491zbMATH Open1364.94308arXiv1308.6552OpenAlexW2963363054MaRDI QIDQ2989655FDOQ2989655
Authors: Or Ordentlich, Uri Erez 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-complexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources under a minimum mean squared error distortion measure. All encoders use the same nested lattice codebook. Each encoder quantizes its observation using the fine lattice as a quantizer and reduces the result modulo the coarse lattice, which plays the role of binning. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer linear combinations of the quantized signals, and then inverts it. In general, the linear combinations have smaller average powers than the original signals. This allows to increase the density of the coarse lattice, which in turn translates to smaller compression rates. We also propose and analyze a one-shot version of IF source coding, that is simple enough to potentially lead to a new design principle for analog-to-digital converters that can exploit spatial correlations between the sampled signals.
Full work available at URL: https://arxiv.org/abs/1308.6552
Cited In (3)
This page was built for publication: Integer-Forcing Source Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989655)
