Skip to Main Content
In this paper, we propose an improvement of the previously proposed decoder for split LDPC codes defined over finite groups. The output of the check nodes is adjusted such that it bears better resemblance to that of more complex and efficient algorithms. There is a significant improvement in the decoding performance with almost no oeffect on the decoding complexity. The hardware architecture for the proposed decoder is explained in detail and we show with Monte-Carlo simulations that the performance is indeed improved.