An improved technique to find the trapping sets of the irregular LDPC codes

This paper presents an efficient technique to find the dominant trapping sets of the irregular low density parity check (LDPC) codes. This technique is based on the approach of progressively finding the larger trapping sets from the smaller ones. The proposed technique is applied to some of the most commonly studied irregular codes and it is found to obtain more number of trapping sets compared to those of the techniques using the same approach and others as well.