Name
Abstract | ||
|---|---|---|
The performance of short block length low-density parity-check (LDPC) codes (both binary and nonbinary) and convolutional codes is compared under the constraint of tight structural delay constraints. Additionally, we use fundamental bounds on block codes and low rate turbo codes to evaluate our results in a broader context. It turns out that - depending on the code rate and given delay - convolutional codes are able to outperform fundamental lower bounds for block codes, yielding a definite result on the question which codes are superior in this regime. From a break-even point onwards, convolutional codes cannot compete with block codes anymore and nonbinary LDPC codes show the best performance. Turbo codes with a short interleaver length show competitive results. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCOMM.2015.2488661 | Communications, IEEE Transactions |
Keywords | Field | DocType |
Delays,Convolutional codes,Parity check codes,Block codes,Decoding,Bit error rate,Turbo codes | BCJR algorithm,Concatenated error correction code,Control theory,Computer science,Turbo code,Serial concatenated convolutional codes,Block code,Expander code,Algorithm,Linear code,Tornado code | Journal |
Volume | Issue | ISSN |
PP | 99 | 0090-6778 |
Citations | PageRank | References |
12 | 0.61 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Rachinger | 1 | 24 | 2.71 |
| Johannes Huber | 2 | 756 | 117.44 |
| R. Muller | 3 | 1206 | 124.92 |