Low-Complexity Architecture of Finding First Four Minimum Values for Non-binary LDPC Decoders

Looking for a set of minimum values is considering as an important part in reducing the computational complexity introduced by the conventional non-binary low-density parity-check (NB-LDPC) decoding algorithms. In which, looking for a set of four min-value has been using i
$n$
recent NB-LDPC decoders. In this paper, a low-complexity architecture is proposed for the first four minimum values finder. Experimental results confirmed that the proposed design is able to achieve a high flexibility in adapting to changing input sequence size while maintaining a low hardware complexity.