Performance and bounds for repeat tree codes

Jun Heo, Kyuhyuk Chung

Research output: Contribution to journalConference articlepeer-review


The Repeat Accumulate (RA) codes introduced in [1] are Serial Concatenated Codes (SCC) consisting of a repetition code and an accumulator which are connected through an interleave. It has the advantage of low encoding complexity and good performance. On the other hand, Concatenated Tree (CT) codes introduced in [2] are Parallel Concatenated Codes (PCC) and also show good performance with low encoding and decoding complexity. The constituent code of CT codes has a tree structure which consists of nonrecursive information bits as well as recursive information bits. In this paper, we present a new code which is constructed based on the RA codes but shows much better performance and better thresholds (i.e., higher noise level or lower signal-to-noise ratio). The main contribution of this paper is putting nonrecursive information bits as well as recursive information bits in the accumulating part of RA codes. The enhanced performance is shown by computer simulation and the asymptotic performance in the water fall region is shown by density evolution. We also show the upper bound on the performance of the RT code for a specific interleaver using the simple tight bound and specific input-output weight distributions that are obtained by the sample based MLE (Maximum Likelihood Estimator).

Original languageEnglish
Pages (from-to)1271-1275
Number of pages5
JournalIEEE Vehicular Technology Conference
Issue number2
Publication statusPublished - 2004
Externally publishedYes
Event2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States
Duration: 2004 Sept 262004 Sept 29


  • Density evolution
  • Iterative decoding
  • RA codes

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Performance and bounds for repeat tree codes'. Together they form a unique fingerprint.

Cite this