Abstract

We propose generalized partially information coupled (PIC) polar codes and their construction method. In the proposed codes, each code block (CB) shares systematic information bits partially with $J$ adjacent CBs on each side, where $J$ is referred to as the coupling depth. The conventional PIC polar code is a special case of the generalized PIC polar codes for $J=1$ . We modify the polar CB decoding and propose various inter-CB decoding schemes which apply to the code of arbitrary coupling depth $J$ . We also propose a low complexity evaluation method for the error rate of the generalized PIC polar codes, without channel generation and decoding operation. Numerical results show that this approximate evaluation is very accurate. It is verified by simulation that more coding gain can be attained for $J\ge 2$ . Finally, we compare the decoding complexities of the conventional inter-CB decoding algorithms and the proposed algorithms with which a lower decoding complexity is achieved without performance degradation.

Highlights

  • Polar codes and their theoretical background were established by Arikan [1]

  • The reasons why the modified sequential inter-CB decoding (MS-ICD) algorithm is the basic algorithm is that a lower complexity than the others for various Eb/N0 with the same TB error rate (TBER) and CB error rate (CBER) performances as the other inter-code block (CB) decoding algorithms in this article and it can be applied for arbitrary J

  • In this article, we proposed a generalization of partially information coupled (PIC) polar codes which has arbitrary coupling depth

Read more

Summary

INTRODUCTION

Polar codes and their theoretical background were established by Arikan [1]. The importance of polar codes is that they are the firstly proven capacity-achieving codes for any given binary discrete memoryless channels (B-DMCs). H. Ahn et al.: Generalized PIC Polar Codes With Arbitrary Coupling Depth and Their Decoding Algorithms maximum-likelihood (ML) decoding performance over the additive white Gaussian noise (AWGN) channel at high signal-to-noise ratio (SNR) as the list size increases. Ahn et al.: Generalized PIC Polar Codes With Arbitrary Coupling Depth and Their Decoding Algorithms maximum-likelihood (ML) decoding performance over the additive white Gaussian noise (AWGN) channel at high signal-to-noise ratio (SNR) as the list size increases They revealed that concatenating some cyclic-redundancycheck (CRC) code improves the decoding performance by ensuring a good minimum distance. They developed an analytical framework for these codes and optimized the coupling schemes based on this framework They evaluated the error performance and decoding complexity of PIC polar codes.

PARTIALLY INFORMATION COUPLED POLAR CODES
ENCODING OF PIC POLAR CODES
INTER-CB DECODING OF PIC POLAR CODES
COUPLING SCHEME
ENCODING SCHEME
DECODING SCHEME OF THE GENERALIZED PIC
MODIFIED PARALLEL INTER-CB DECODING FOR ARBITRARY COUPLING DEPTH
SEQUENTIAL DECODING WITH ORDERED RE-DECODING FOR ARBITRARY COUPLING DEPTH
13: Decode the CB with the l-th largest Sl from the lmin-th
LOW COMPLEXITY TBER AND CBER EVALUATION
NUMERICAL RESULTS
TBERs FOR VARIOUS COUPLING RATIOS
PERFORMANCES FOR VARIOUS COUPLING DEPTHS
CONCLUSION
Full Text
Published version (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