We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED. However, by applying small modifications to the parity-check matrix at the receiver side, we can break the symmetry without changing the code at the transmitter. This way, we can leverage a gain in error-correcting performance using an ensemble of identical BP decoders, without increasing the worst-case decoding latency. The proposed method is demonstrated using LDPC codes from the CCSDS, 802.11n and 5G standards and produces gains of 0.2 to 0.3 dB over conventional BP decoding. Compared to the similarly performing saturated BP (SBP), the proposed algorithm reduces the average decoding latency by more than eight times.
Description
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries | IEEE Journals & Magazine | IEEE Xplore
%0 Journal Article
%1 9772648
%A Geiselhart, Marvin
%A Ebada, Moustafa
%A Elkelesh, Ahmed
%A Clausius, Jannis
%A ten Brink, Stephan
%D 2022
%E Li, Li
%J IEEE Communications Letters
%K myown from:mgeiselhart
%P 1-1
%R 10.1109/LCOMM.2022.3174164
%T Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
%X We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED. However, by applying small modifications to the parity-check matrix at the receiver side, we can break the symmetry without changing the code at the transmitter. This way, we can leverage a gain in error-correcting performance using an ensemble of identical BP decoders, without increasing the worst-case decoding latency. The proposed method is demonstrated using LDPC codes from the CCSDS, 802.11n and 5G standards and produces gains of 0.2 to 0.3 dB over conventional BP decoding. Compared to the similarly performing saturated BP (SBP), the proposed algorithm reduces the average decoding latency by more than eight times.
@article{9772648,
abstract = {We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED. However, by applying small modifications to the parity-check matrix at the receiver side, we can break the symmetry without changing the code at the transmitter. This way, we can leverage a gain in error-correcting performance using an ensemble of identical BP decoders, without increasing the worst-case decoding latency. The proposed method is demonstrated using LDPC codes from the CCSDS, 802.11n and 5G standards and produces gains of 0.2 to 0.3 dB over conventional BP decoding. Compared to the similarly performing saturated BP (SBP), the proposed algorithm reduces the average decoding latency by more than eight times.},
added-at = {2022-05-16T10:08:41.000+0200},
author = {Geiselhart, Marvin and Ebada, Moustafa and Elkelesh, Ahmed and Clausius, Jannis and ten Brink, Stephan},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2e791e4ed5fedf2b3ad15bc828a31e665/inue},
description = {Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries | IEEE Journals & Magazine | IEEE Xplore},
doi = {10.1109/LCOMM.2022.3174164},
editor = {Li, Li},
interhash = {3cbcfaf98e5d33099a4e3f29c5bd2180},
intrahash = {e791e4ed5fedf2b3ad15bc828a31e665},
issn = {1558-2558},
journal = {IEEE Communications Letters},
keywords = {myown from:mgeiselhart},
pages = {1-1},
timestamp = {2022-05-16T08:08:41.000+0200},
title = {Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries},
year = 2022
}
