Name
Abstract | ||
|---|---|---|
Turbo codes have excellent performance at low and medium signal-to-noise ratios (SNR) very close to the Shannon limit, and are at the basis of their success. However, a turbo code performance curve can change its slope at high SNR if the code free distance is small. This “error floor” phenomenon is not acceptable for applications requiring very low values of bit error rates. A knowledge of the free distance and its multiplicity allows one to analytically estimate the error floor. An algorithm for computing the turbo code free distance, based on the notion of constrained subcodes, is described. Some considerations on the free distance distribution of turbo codes with growing interleaver length are also provided |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/ICC.2001.936270 | Communications, 2001. ICC 2001. IEEE International Conference |
Keywords | Field | DocType |
error statistics,interleaved codes,turbo codes,BER,SNR,Shannon limit,bit error rate,constrained subcodes,error floor,free distance distribution,interleaver length,signal-to-noise ratio,turbo codes | BCJR algorithm,Concatenated error correction code,Low-density parity-check code,Computer science,Turbo code,Serial concatenated convolutional codes,Algorithm,Theoretical computer science,Real-time computing,Reed–Solomon error correction,Linear code,Turbo equalizer | Conference |
Volume | ISBN | Citations |
1 | 0-7803-7097-1 | 23 |
PageRank | References | Authors |
2.81 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Garello | 1 | 208 | 31.47 |
| F Chiaraluce | 2 | 83 | 12.34 |
| P. Pierleoni | 3 | 45 | 8.71 |
| Scaloni, M. | 4 | 23 | 2.81 |