Title :
A Novel Channel Coding Scheme of Accumulate Repeat Tree Codes
Author :
Yang, Maofan ; Fang, Liang ; Zhang, Xin ; Yang, Dacheng
Author_Institution :
Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
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.
Keywords :
AWGN channels; Rayleigh channels; channel coding; concatenated codes; iterative decoding; parity check codes; trees (mathematics); ART code; AWGN channel; Rayleigh fading channel; Tanner graph representation; accumulate repeat tree; belief-propagation iterative algorithm; channel coding scheme; concatenated tree code; decoding; low-density parity-check code; turbo code; AWGN; Channel coding; Concatenated codes; Fading; Iterative algorithms; Iterative decoding; Parity check codes; Subspace constraints; Tree graphs; Turbo codes;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-3692-7
Electronic_ISBN :
978-1-4244-3693-4
DOI :
10.1109/WICOM.2009.5303077
