A novel channel coding scheme of accumulate repeat tree codes

Authors:
Maofan Yang;Liang Fang;Xin Zhang;Dacheng Yang
Affiliations:
School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 0

Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Concatenated tree codes: a low-complexity, high-performance approach

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.