%0 Generic %1 geiselhart2022automorphism %A Geiselhart, Marvin %A Ebada, Moustafa %A Elkelesh, Ahmed %A Clausius, Jannis %A Brink, Stephan ten %D 2022 %K coding myown %T Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries %U http://arxiv.org/abs/2202.00287 %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.

@misc{geiselhart2022automorphism, 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.}, added-at = {2022-03-08T14:32:07.000+0100}, author = {Geiselhart, Marvin and Ebada, Moustafa and Elkelesh, Ahmed and Clausius, Jannis and Brink, Stephan ten}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2b7935e5fcbaa13888c8ba7c15db7174a/mgeiselhart}, description = {[2202.00287] Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries}, interhash = {3cbcfaf98e5d33099a4e3f29c5bd2180}, intrahash = {b7935e5fcbaa13888c8ba7c15db7174a}, keywords = {coding myown}, note = {cite arxiv:2202.00287 Comment: 5 pages, submitted to IEEE for possible publication}, timestamp = {2022-03-08T13:32:07.000+0100}, title = {Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries}, url = {http://arxiv.org/abs/2202.00287}, year = 2022 }