Low Complexity Rate Compatible Puncturing For Future Communication network

Abstract

Abstract An efficient low complexity puncturing method has studied to achieve rate compatible. The parallel concatenation codes are use mixing of one component of Quasi-Cyclic (QC) low-density parity check codes LDPC codes with two components of (LDPC) in linear coding. The proposed QC-PCGC have lower computation complexity when compared with traditional punctured PCGC. The decreasing in the complexity analysis yields to the reducing in the memory requirement for the encoding/decoding system. It is possible to use the suggested coding system structure in the future communication applications like fifth generation (5G), where it is needed to have coding flexibility, with less complexity in encoding and decoding.