Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation

Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize re...

Full description

Saved in:
Bibliographic Details
Main Authors: Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2017-04-01
Series:Tongxin xuebao
Subjects:
Tanner graph
low-density parity-check codes (LDPC)
short cycle
girth
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017083/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017083/

Similar Items