Design of an LDPC code with low error floor
Sang Hyun Lee, Kwang Soon Kim, Jae Kyun Kwon, Yun Hee Kim, Jae Young Ahn
Abstract
Sang Hyun Lee, Kwang Soon Kim, Jae Kyun Kwon, Yun Hee Kim, Jae Young Ahn
Abstract
A search algorithm for stopping sets in a Tanner graph is proposed for designing good low-density parity-check (LDPC) codes. By applying the belief-propagation algorithm with messages containing the information of originated variable nodes and their connected edges, the stopping sets can be detected. Furthermore, a code design method using the algorithm is presented and the performances of the designed code over several channels are shown
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A search algorithm for stopping sets in a Tanner graph is proposed for designing good low-density parity-check (LDPC) codes. By applying the belief-propagation algorithm with messages containing the information of originated variable nodes and their connected edges, the stopping sets can be detected. Furthermore, a code design method using the algorithm is presented and the performances of the designed code over several channels are shown
Key concepts: Low-density parity-check code, Tanner graph, Computer science, Code (set theory), Algorithm, Belief propagation, Graph, Error floor