In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes perform better than existing punctured LDPC codes.
Bibliographical noteFunding Information:
V. ACKNOWLEDGEMENT This work was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Informa- tion Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) in part by (IITA-2007-(C1090-0701-0003)) and in part by (IITA-2006-(C1090-0603-0011)).
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering
- Applied Mathematics