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.
Highlights
The challenging nature of multiuser communication problems [1] has been recognized for decades and many of these problems still remain unsolved
We note that any valid pair of syndrome former (SF) and inverse syndrome former (ISF) can be used in the source encoder and the source decoder that we present below, but the complexity for constructing different SF-ISF pairs may vary
Let x denote a source sequence to be compressed. Since it is viewed as a virtual codeword of this parallel turbo code, it consists of three parts: the systematic bits from the first branch, xs, the parity bits from the first branch, x1, and the parity bits from the second branch, x2
Summary
The challenging nature of multiuser communication problems [1] has been recognized for decades and many of these problems still remain unsolved. While codewords are “binned” for coset codes and block codes (e.g., via the parity check matrix), the random interleaver in the turbo code makes the code space intractable, precluding the possibility to spell out its parity check matrix Another reason that has possibly prevented the full exploitation of the binning idea is the lack of a general source decoding approach. The proposed source encoder and source decoder explore the concept of syndrome former (SF) and inverse syndrome former (ISF), and are efficient as well as provenly optimal for binary memoryless sources This represents a simple and universal framework that allows an existing powerful linear channel code to be readily exploited in DSC without the burden of redesigning the code or finding a matching encoding/decoding strategy. (3) Through the proposition of the SF-ISF formulation and the general source encoder/decoder structure, we have demonstrated the first provenly optimal turbo-DSC formulation that explicitly exploits the binning scheme.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
