Abstract
Concerning the girth problem of Low-Density Parity-Check(LDPC) codes,a new rapid algorithm for detecting the girth of LDPC codes in combination with Dijkstra algorithm and the feature of Tanner graph was proposed,and the time complexity of this algorithms was lower.Compared with known algorithms,this algorithm not only can calculate rapidly,but also return the girth and edges only one time,thus avoiding redundant computation.At last,the simulation verifies the feasibility and efficiency of this new algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
