A Novel Channel Coding Scheme of Accumulate Repeat Tree Codes
Maofan Yang, Liang Fang, Xin Zhang, Dacheng Yang · 2009
This paper is concerned with a novel channel coding scheme called accumulate repeat tree (ART) codes which are constructed based on repeat accumulate (RA) codes and concatenated tree (CT) codes. This class of codes can be viewed as special low-density parity-check (LDPC) codes, or as special turbo codes, so they are proposed as turbo-like codes combing many advantages of LDPC and turbo codes. ART codes have a Tanner graph representation, and they are decodable by belief-propagation (BP) iterative algorithm. The code structures are discussed. The simulation in both AWGN and Rayleigh fading channels is given and compared with RA and CT codes. The results and theoretical analysis show the enhanced performance of ART codes.