Performance and bounds for repeat tree codes

Jun Heo, Kyuhyuk Chung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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
Title of host publicationIEEE Vehicular Technology Conference
Pages1271-1275
Number of pages5
Volume60
Edition2
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 Sep 262004 Sep 29

Other

Other2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security
CountryUnited States
CityLos Angeles, CA
Period04/9/2604/9/29

Fingerprint

Concatenated codes
Maximum likelihood
Decoding
Signal to noise ratio
Computer simulation
Water

Keywords

  • Density evolution
  • Iterative decoding
  • RA codes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Heo, J., & Chung, K. (2004). Performance and bounds for repeat tree codes. In IEEE Vehicular Technology Conference (2 ed., Vol. 60, pp. 1271-1275)

Performance and bounds for repeat tree codes. / Heo, Jun; Chung, Kyuhyuk.

IEEE Vehicular Technology Conference. Vol. 60 2. ed. 2004. p. 1271-1275.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Heo, J & Chung, K 2004, Performance and bounds for repeat tree codes. in IEEE Vehicular Technology Conference. 2 edn, vol. 60, pp. 1271-1275, 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security, Los Angeles, CA, United States, 04/9/26.
Heo J, Chung K. Performance and bounds for repeat tree codes. In IEEE Vehicular Technology Conference. 2 ed. Vol. 60. 2004. p. 1271-1275
Heo, Jun ; Chung, Kyuhyuk. / Performance and bounds for repeat tree codes. IEEE Vehicular Technology Conference. Vol. 60 2. ed. 2004. pp. 1271-1275
@inproceedings{a0c3bf744ee940b1841747734ac81919,
title = "Performance and bounds for repeat tree codes",
abstract = "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).",
keywords = "Density evolution, Iterative decoding, RA codes",
author = "Jun Heo and Kyuhyuk Chung",
year = "2004",
language = "English",
volume = "60",
pages = "1271--1275",
booktitle = "IEEE Vehicular Technology Conference",
edition = "2",

}

TY - GEN

T1 - Performance and bounds for repeat tree codes

AU - Heo, Jun

AU - Chung, Kyuhyuk

PY - 2004

Y1 - 2004

N2 - 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).

AB - 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).

KW - Density evolution

KW - Iterative decoding

KW - RA codes

UR - http://www.scopus.com/inward/record.url?scp=17144414566&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17144414566&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:17144414566

VL - 60

SP - 1271

EP - 1275

BT - IEEE Vehicular Technology Conference

ER -