Name
Abstract | ||
|---|---|---|
Product accumulate (PA) codes were proposed and shown by Li, Narayanan and Georghiades (see Proc. Intl.. Symp. Inform. Theory, Washington DC, p.122-22, June 2001, and IEEE Tran. Info. Theory) 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 (see Proc. 1998 Allerton Conf. Commun. and Control, Sept. 1998, p.201-10) and the thresholds computed using density evolution are examined. Simulations are presented and evaluated, especially for rate R⩽1/2 |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/GLOCOM.2001.965563 | GLOBECOM |
Keywords | Field | DocType |
code rate,maximum likelihood decoding,concatenated codes,threshold phenomenon,maximum likelihood bounds,weight distribution,density evolution,thresholds,generalized product accumulate codes,ml decoding based bounds,simulations,upper bound,iterative decoding,ml bounds,convolutional codes,interleaved codes,computational modeling,information theory,maximum likelihood,distributed computing,iterative methods | Discrete mathematics,Concatenated error correction code,Combinatorics,Block code,Serial concatenated convolutional codes,Turbo code,Raptor code,Linear code,Reed–Muller code,List decoding,Mathematics | Conference |
Volume | ISSN | ISBN |
2 | 1930-529X | 0-7803-7206-9 |
Citations | PageRank | References |
5 | 0.67 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Li | 1 | 329 | 27.99 |
| Krishna R. Narayanan | 2 | 706 | 72.24 |
| Costas N. Georghiades | 3 | 301 | 32.18 |