Performance Improvement of Accumulate Repeat Accumulate Codes with Bounded Complexity
In this paper, we introduce a new family of codes named as systematic spatially coupled accumulate repeat accumulate SC ARA codes based on chain of interconnected proto graphs over the binary erasure channels (BEC) It has been observed that Spatially coupled low density parity check (SC LDPC) codes are able to approach the capacity universally across the binary input memoryless (BMS) channels. A density evolution (DE) analysis is provided for this class of codes which categorized by bounded density and/or complexity per information bit. Simulation results show that the spatially coupling of ensembles of ARA codes, with bounded density and/or complexity, drives the message passing belief propagation decoding threshold (BP) to be closed to the maximum a posterior (MAP) threshold of the underlying codes over the BEC.
2015 IEEE 82nd Vehicular Technology Conference (VTC2015 Fall)