Name
Abstract | ||
|---|---|---|
Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate distortion performance at low to moderate quantization rates. In this work the bit error sensitivity of these codes is explored. The theoretical analysis shows that for a given number of trellis states the deviation from the correct trellis path, caused by bit errors on the transmission channel, can be described by two code parameters alone. The theoretic approach is compared to Monte-Carlo simulations and show that the particular trellis source codes under consideration offer robust transmission for bit error ratios up to the order of 10-3 without the aid of any explicit correcting channel code. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICC.2007.149 | Glasgow |
Keywords | Field | DocType |
Monte Carlo methods,source coding,trellis codes,Monte-Carlo simulations,computational complexity,linear congruential recursions,transmission channel,trellis source codes | BCJR algorithm,Convolutional code,Low-density parity-check code,Computer science,Block code,Algorithm,Real-time computing,Theoretical computer science,Trellis quantization,Space–time trellis code,Linear code,Bit error rate | Conference |
ISSN | ISBN | Citations |
1550-3607 | 1-4244-0353-7 | 0 |
PageRank | References | Authors |
0.34 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomas Eriksson | 1 | 14 | 4.22 |
| Norbert Goertz | 2 | 316 | 28.94 |