Neural Decoding with Optimization of Node Activations

06/01/2022
by   Eliya Nachmani, et al.
0

The problem of maximum likelihood decoding with a neural decoder for error-correcting code is considered. It is shown that the neural decoder can be improved with two novel loss terms on the node's activations. The first loss term imposes a sparse constraint on the node's activations. Whereas, the second loss term tried to mimic the node's activations from a teacher decoder which has better performance. The proposed method has the same run time complexity and model size as the neural Belief Propagation decoder, while improving the decoding performance by up to 1.1dB on BCH codes.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset