Pruning Neural Belief Propagation Decoders
Paper i proceeding, 2020

We consider near maximum-likelihood (ML) decoding of short linear block codes based on neural belief propagation (BP) decoding recently introduced by Nachmani et al.. While this method significantly outperforms conventional BP decoding, the underlying parity-check matrix may still limit the overall performance. In this paper, we introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We consider the weights in the Tanner graph as an indication of the importance of the connected check nodes (CNs) to decoding and use them to prune unimportant CNs. As the pruning is not tied over iterations, the final decoder uses a different parity-check matrix in each iteration. For ReedMuller and short low-density parity-check codes, we achieve performance within 0.27dB and 1.5dB of the ML performance while reducing the complexity of the decoder.

Författare

Andreas Buchberger

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Christian Häger

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Henry D. Pfister

Duke University

Laurent Schmalen

Karlsruher Institut für Technologie (KIT)

Alexandre Graell I Amat

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

Vol. 2020-June 338-342 9174097

2020 IEEE International Symposium on Information Theory, ISIT 2020
Los Angeles, USA,

Coding for Optical communications In the Nonlinear regime (COIN)

Europeiska kommissionen (EU), 2016-03-01 -- 2020-02-28.

Distribuerad lagring för datalagring och trådlös leverans av data

Vetenskapsrådet (VR), 2016-01-01 -- 2019-12-31.

Coding for terabit-per-second fiber-optical communications (TERA)

Europeiska kommissionen (EU), 2017-01-01 -- 2019-12-31.

Ämneskategorier

Telekommunikation

Signalbehandling

Datorsystem

DOI

10.1109/ISIT44484.2020.9174097

Mer information

Senast uppdaterat

2020-09-18