Decreasing the complexity of LDPC iterative decoders

In this letter we analyze the performance of a low-density parity-check iterative decoder which makes use of an additional buffer at its input, whose function is to decrease the overall complexity of the decoding circuit. We propose a semi-analytical technique that permits the evaluation of the optimum buffer length for each analyzed code.