Abstract
A new cooperative punctured polar coding (CPPC) scheme with multi joint successive cancellation (MJSC) decoding at the destination is proposed, which may be obtained by applying puncturing algorithm to coopera- tive polar coding scenario. In this proposed algorithm we generate a cooperative scheme for punctured polar codes with various code lengths by employing the reduction of the general polarizing matrix combined with the cooperative construction to match the multilevel characteristics of polar codes. Punctured polar codes which are a class of polar codes can support a wide range of lengths for a given rate. Hence in our CPPC scheme, the punctured polar codes can be first constructed by eliminating some of the frozen bits such that the values of the punctured bits are known to the decoder. Then the proposed coded coopera- tive construction is employed to match the Plotkin's con- struction between the two relay nodes. This scheme has low encoding and decoding complexity since it can be encoded and decoded in a similar way as a classical polar code. The CPPC scheme offers a cooperative coding which not only improves the data rate of the cooperative system, but also improves the overall bit error rate performance. Nu- merical results show that cooperative punctured polar codes constructed by our approach perform much better than those by the conventional direct approach.
Highlights
The coded cooperation is a combination of the coding and relaying [1] diversity techniques within one system
We present the impact of bit error rate (BER) performance for each relay channel compared with the full BER performance of the proposed cooperative punctured polar coding (CPPC) scheme
We propose a novel method to construct a Punctured polar codes (PPC) that is based on removing some of the frozen bits which are already known by the decoder
Summary
The coded cooperation is a combination of the coding and relaying [1] diversity techniques within one system. The first algorithm for rate-compatible PPC is proposed in [8] to match arbitrary code length by puncturing some coded bits. In the proposed algorithm in [9], the puncturing pattern can be found by searching the large exponent matrices using a suboptimal method Another class of a universal coding scheme for rate-compatible punctured polar codes was proposed in [10] based on the cyclic redundancy check concatenated polar encoder and SC list/stack decoders. We will explore simulation performances of our proposed CPPC scheme compared with other cooperative and direct polar coding schemes illustrating its gain when matching the Plotkin’s construction of polar codes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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.
