Abstract
A simple but powerful scheme exploiting the binning
concept for asymmetric lossless distributed source coding is
proposed. The novelty in the proposed scheme is the introduction
of a syndrome former (SF) in the source encoder and an
inverse syndrome former (ISF) in the source decoder to
efficiently exploit an existing linear channel code without the
need to modify the code structure or the decoding strategy. For
most channel codes, the construction of SF-ISF pairs is a light
task. For parallelly and serially concatenated codes and
particularly parallel and serial turbo codes where this appear
less obvious, an efficient way for constructing linear complexity
SF-ISF pairs is demonstrated. It is shown that the proposed SF-ISF
approach is simple, provenly optimal, and generally applicable to
any linear channel code. Simulation using conventional and
asymmetric turbo codes demonstrates a compression rate that is
only 0.06 bit/symbol from the theoretical limit, which is among
the best results reported so far.