Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries

Jun Li, Md. Hashem Ali Khan, Xueqin Jiang, M. Lee
{"title":"Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries","authors":"Jun Li, Md. Hashem Ali Khan, Xueqin Jiang, M. Lee","doi":"10.1109/ICTC.2010.5674261","DOIUrl":null,"url":null,"abstract":"This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC.2010.5674261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于欧几里德几何的大周长拟循环低密度奇偶校验码的混合构造
本文提出了一种基于欧几里德几何中的平行束和循环置换矩阵构造拟循环低密度奇偶校验码的混合方法。用这种方法构造的码具有大周长、低密度的规则性。仿真结果表明,这些编码具有良好的迭代译码性能,与未编码系统相比具有较大的编码增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Compatibility analysis of in-band digital radio systems in interference channel environment Load-aware beamforming and association for system-wide utility maximization Experiences with discriminating TCP loss using K-Means clustering Relation between the number of broadcasts of probe packets and energy consumption in multi-hop wireless networks A nondisruptive multi-path handoff scheme for peer-to-peer live video streaming
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1