Abstract
An LDPC (Low Density Parity Check) code can be described by Tanner graph [1]. In this paper, loop structure in LDPC codes are studied carefully based on Tanner graph, a new notion, cut-node tree, is proposed to describe LDPC codes. Cut-node tree has full information of Tanner graph. So all loop features in LDPCs can be calculated aided by computer. Also a new decoding scheme for LDPC codes is proposed to avoid repeating iteration of information in traditional decoding algorithms. The results help to give further research on related field.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
