Generalized product accumulate codes: analysis and performance Conference Paper uri icon

abstract

  • In [1] [2], product accumulate (PA) codes were proposed and shown to be a class of simple and provably good codes for rate R 1/2. This work investigates the generalized product accumulate (GPA) codes which have rates over the entire range and which are also "good" both in the maximum likelihood (ML) sense and under the iterative approach. Analysis concentrates on the weight distribution over the code ensemble, the ML bounds, and the existence and computation of threshold phenomenon in the iterative decoding. A tight upper bound due to Divsalar and the thresholds computed using density evolution are examined. Simulations are presented and evaluated, especially for rate R 1/2.

name of conference

  • GLOBECOM '01. IEEE Global Telecommunications Conference

published proceedings

  • GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)

author list (cited authors)

  • Jing Li, .., Narayanan, K. R., & Georghiades, C. N.

citation count

  • 7

complete list of authors

  • Narayanan, KR||Georghiades, CN

publication date

  • January 2001

publisher