Name
Title | ||
|---|---|---|
An efficient decoding algorithm for cycle-free convolutional codes and its applications |
Abstract | ||
|---|---|---|
This paper proposes an efficient graph-based sum-product algorithm for decoding 1/(1+Dn) code, whose Tanner (1981) graph is cycle-free. A rigorous proof is given which shows the proposed algorithm is equivalent to the MAP decoding implementing the BCJR algorithm, but with a lower complexity magnitude. The paper presents an explicit example which confirms the claim that the sum-product algorithm is optimal on cycle-free graphs. A parallel realization is then discussed and shown to resemble low density parity check (LDPC) decoding. The paper further proposes a min-sum algorithm which is equivalent to the max-log-MAP algorithm. Prospective applications which can take advantage of the proposed decoding algorithms are discussed and simulations are provided |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/GLOCOM.2001.965634 | GLOBECOM |
Keywords | Field | DocType |
approximation theory,graph-based sum-product algorithm,min-sum algorithm,max-log-map algorithm,efficient decoding algorithm,cycle-free convolutional codes,ldpc decoding,low density parity check,cycle-free tanner graph,simulations,decoding algorithms,graph theory,low-complexity approximation,bcjr algorithm,map decoding,decoding,convolutional codes,approximation algorithms,geometry,bayesian methods,turbo codes | Factor graph,BCJR algorithm,Sequential decoding,Convolutional code,Berlekamp–Welch algorithm,Low-density parity-check code,Computer science,Turbo code,Algorithm,List decoding | Conference |
Volume | ISSN | ISBN |
2 | 1930-529X | 0-7803-7206-9 |
Citations | PageRank | References |
5 | 0.61 | 7 |
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 |