Abstract
This paper presents a new structure of product codes formed by combining two polar codes. The encoding performance of these codes is verified by implementing an exhaustive search algorithm, which determines their minimum weight specifications. Conducted analysis and simulations confirm that with the equal code length and rate, the newly proposed codes outperform the conventional polar codes in high energy per bit-to-noise ratios (Eb/N0≤5 dB). This is concluded from punctured and nonpunctured product codes.
Highlights
Polar codes are promising forward error correction (FEC) codes for the generation of broadband networks including the fifth generation of wireless networks (5G)
This paper presents a new scheme of serially concatenated codes constituted by two systematic polar codes linked by an interleaver
The bit error rate (BER) and frame error rate (FER) performances of different product and single polar codes transmitted over the additive white Gaussian noise (AWGN) channel are verified
Summary
Polar codes are promising forward error correction (FEC) codes for the generation of broadband networks including the fifth generation of wireless networks (5G). A parallel concatenated code was presented by combining a polar code with a Recursive Systematic Convolutional (RSC) code [10] Codes obtained by this method conclude a performance better than other well-known codes (turbo codes and LDPC codes), mainly at the error floor region due to utilizing a modified interleaver, which is matched with specifications of the constituent RSC code. Unlike a punctured single polar code, which applies a relatively high number of punctured bits, punctured product polar codes can be constructed by removing a low number of bits applied in one of the constituent codes This feature will allow decoders to interactively exchange their decoded information with each other and improve the error correcting capability of the code.
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