New rapid algorithm for detecting girth of lowdensity Paritycheck codes
LI Jiong-cheng,LI Gui-yu,XIAO Heng-hui,HUANG Hai-yi
The Key Wireless Network Optimization Center of Guangzhou,Guangdong Planning and Designing Institute of Telecommunications Company, Guangzhou Guangdong 510630, China
LI Jiong-cheng LI Gui-yu XIAO Heng-hui HUANG Hai-yi. New rapid algorithm for detecting girth of lowdensity Paritycheck codes [J]. Journal of Computer Applications, 2012, 32(11): 3100-3106.
[1]
赵晓群. 现代编码理论[M]. 武汉: 华中科技大学出版社, 2007.
[2]
MACKAY D J C, NEAL R M. Near shannon limit performance of lowdensity paritycheck codes[J]. Electron Letter, 1996,32(18):1645-1646.
[3]
SHANNON C E. A mathematical theory of communication[J]. The Bell System Technical Journal, 1948,27:379-423.
[4]
CHUNG, S Y, FORNEY G D, RICHARDSON T J, et al. On the design of lowdensity parity check codes within 0.0045 dB of the Shannon limit[J]. IEEE Communication Letters, 2001,5(2):58-60.
[5]
FAN JUN, XIAO YANG. A method of counting the number of cycles in LDPC codes[C]// 2006 8th International Conference on Signal Processing. Washington:IEEE Computer Society,2006: 2183-2186.
[6]
张志亮,刘英,周红. 基于二分图低密度奇偶校验码围长计算方法[J]. 信息与电子工程, 2009, 7(2): 119-122.
[7]
李博,王钢,杨洪娟,等. 一种LDPC双向图环路检测新算法[J].哈尔滨工业大学学报, 2010,42(7): 1051-1055.
[8]
李建中,骆吉洲. 图论导引[M]. 北京: 机械工业出版社, 2006.
[9]
殷剑宏,吴开亚. 图论及其算法[M]. 合肥:中国科学技术大学出版社,2006.
[10]
MACKAY. D J C. Encyclopedia of sparse graph codes[EB/OL].[2012-04-15]. http://www. inference. Phy.cam.ac.uk/mackay/codes/data.html.
[11]
王战红,孙明明,姚瑶. Dijkstra算法的分析与改进[J].湖北第二师范学院学报,2008,25(8):12-14.
[12]
王智广,王兴会,李妍. 一种基于Dijkstra最短路径算法的改进算法[J].内蒙古师范大学学报,2012,41(2):195-200.