Density Evolution and Thresholds for Accumulate Repeat Tree Codes in Mobile Communication Systems

Author

Yang, Maofan ; Zhou, Hua ; Zhang, Xin ; Yang, Dacheng

Author_Institution

Wireless Theor. & Technol. Lab. (WT&T), Beijing Univ. of Posts & Telecommun., Beijing, China

Volume

5

fYear

2009

fDate

14-16 Aug. 2009

Firstpage

393

Lastpage

397

Abstract

Channel coding theories are widely used in computer science and communication systems. This paper proposes a novel channel coding scheme called accumulate repeat tree (ART) codes for improving the channel coding performance in mobile communication systems. This class of codes can be viewed as turbo-like codes combining many advantages of turbo codes and low-density parity-check (LDPC) codes. ART codes can be represented by the Bayesian network and Tanner graph, which allows for high-speed iterative decoding implementation using belief-propagation (BP) algorithm. The density evolution method is presented, and the practicable Gaussian approximation algorithm for ART codes to analyze the thresholds and decoding performance is discussed. ART codes have low coding complexity, and they show good performance improvement by simulation.

Keywords

channel coding; mobile communication; parity check codes; tree codes; turbo codes; Bayesian network; Tanner graph; accumulate repeat tree codes; belief-propagation algorithm; channel coding theories; computer science and communication systems; high-speed iterative decoding; low-density parity-check codes; mobile communication systems; turbo codes; Channel coding; Communication systems; Computer science; Iterative algorithms; Iterative decoding; Mobile communication; Parity check codes; Subspace constraints; Tree graphs; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2009. ICNC '09. Fifth International Conference on

Conference_Location

Tianjin

Print_ISBN

978-0-7695-3736-8

Type

conf

DOI

10.1109/ICNC.2009.12

Filename

5364641