Name
Abstract | ||
|---|---|---|
In recent years coarsely quantized LDPC decoding using a flooding schedule has been extensively studied. However, there exist few works addressing coarse quantization for a layered schedule, which enables improved convergence speed of the message passing algorithm. The layered schedule can especially be beneficial for high throughput applications like fiber optical systems. This paper presents innovative layered decoding approaches, where the information bottleneck method is used for the design of different coarsely quantized decoder architectures. The varieties of investigated node implementations include lookup tables, computational domain techniques as well as reduced complexity approximations. All structures are designed offline using a layered discrete density evolution method. The performance of multiple node architectures is investigated in terms of evolution of mutual information in the design phase and in terms of error rates. We focus in this paper on regular quasi-cyclic codes. Our simulations running on GPUs also allow insights into the error floor behavior. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ICC42927.2021.9500593 | IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021) |
DocType | ISSN | Citations |
Conference | 1550-3607 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philipp Mohr | 1 | 0 | 0.34 |
| Gerhard Bauch | 2 | 611 | 77.45 |
| Fan Yu | 3 | 0 | 0.34 |
| mo li | 4 | 0 | 1.35 |