30,208 research outputs found
Some universal noiseless multiterminal source coding theorems
Fixed and variable-rate block and sliding-block weighted universal noiseless coding theorems are obtained which extend the Slepian-Wolf theorem for a single multiterminal source to a family of finite-alphabet, stationary, ergodic multiterminal sources
Practical Sliding Window Recoder: Design, Analysis, and Usecases
Network coding has been widely used as a technology to ensure efficient and
reliable communication. The ability to recode packets at the intermediate nodes
is a major benefit of network coding implementations. This allows the
intermediate nodes to choose a different code rate and fine-tune the outgoing
transmission to the channel conditions, decoupling the requirement for the
source node to compensate for cumulative losses over a multi-hop network. Block
network coding solutions already have practical recoders but an on-the-fly
recoder for sliding window network coding has not been studied in detail. In
this paper, we present the implementation details of a practical recoder for
sliding window network coding for the first time along with a comprehensive
performance analysis of a multi-hop network using the recoder. The sliding
window recoder ensures that the network performs closest to its capacity and
that each node can use its outgoing links efficiently
A Universal Scheme for WynerâZiv Coding of Discrete Sources
We consider the WynerâZiv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by LempelâZiv (LZ) compression, while the decompressor is based on a modification of the discrete universal denoiser (DUDE) algorithm to take advantage of side information. The new algorithms not only universally attain the fundamental limits, but also suggest a paradigm for practical WZ coding. The effectiveness of our approach is illustrated with experiments on binary images, and English text using a low complexity algorithm motivated by our class of universally optimal WZ codes
- âŠ