Polar codes have been proved to be able to achieve the capacity of a Binary-Input Discrete Memoryless Channel (B-DMC) despite the possibility of a low-complexity encoding and decoding. Belief Propagation (BP) decoding is one of the major techniques proposed and vastly used for decoding polar codes, which has the advantage of high throughput compared with the other main decoding technique, namely Successive Cancellation (SC). The number of iterations in BP decoding is of utmost importance, as it directly impacts decoding performance, throughput, and power consumption. Devising an appropriate criterion for early termination of decoding once the remaining iterations are not necessary is therefore a useful technique for preventing further latency and power consumption. In this paper, an H-matrix-based criterion for early termination is introduced and shown to be more effective than the conventional G-matrix-based technique without sacrificing the Bit-Error Rate (BER) performance. It is also argued that the proposed method is simpler to be implemented, and its complexity is further reduced as the code-rate increases, unlike the G-matrix criterion whose complexity grows as the code-rate increases.
Early Stopping of BP Polar Decoding Based on Parity-Check Sums
01.06.2022
4293102 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Low-Density Parity Check Codes and Iterative Decoding for Long-Haul Optical Communication Systems
British Library Online Contents | 2003
|Stopping Station Passing Prevention Check Braking Circuit
Europäisches Patentamt | 2025
|WDM Coding System with Single Parity-Check Channel
British Library Online Contents | 1994
|