Abstract
This paper proposes a distributed joint source-channel coding (DJSCC) scheme using polar-like codes. In the proposed scheme, each distributed source encodes source message with a quasi-uniform systematic polar code (QSPC) or a punctured QSPC, and only transmits parity bits over its independent channel. These systematic codes play the role of both source compression and error protection. For the infinite code-length, we show that the proposed scheme approaches the information-theoretical limit by the technique of joint source-channel polarization with side information. For the finite code-length, the simulation results verify that the proposed scheme outperforms the distributed separate source-channel coding (DSSCC) scheme using polar codes and the DJSCC scheme using classic systematic polar codes.
Highlights
Polar codes, invented by Arikan [1] using a technique called channel polarization, are capable of achieving the symmetric capacity of any binary-input discrete memoryless channel (B-DMC)with low encoding and decoding complexity
Since the polarization phenomenon exists on both source and channel sides, it is of natural interest to integrate channel polarization and source polarization for joint source-channel coding (JSCC)
We have proposed a distributed joint source-channel coding (DJSCC) scheme and shown its asymptotic optimality
Summary
Polar codes, invented by Arikan [1] using a technique called channel polarization, are capable of achieving the symmetric capacity of any binary-input discrete memoryless channel (B-DMC). For the distributed source coding (DSC) problem, the Slepian-Wolf theorem [13] states that for two or more correlated sources, lossless compression rates of joint encoding can be achieved with separate encoding if a joint decoder is used at the receiver This theorem has been known for a long time, but the practical DSC scheme was only recently proposed by Pradhan and Ramchandran using syndromes [14]. The design of DSC scheme can be based on parity approach where a systematic code is used to encode the source and the source is recovered by parity bits These kinds of schemes can be extended to distributed JSCC (DJSCC) [18,19].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
