LDPC codes based on Progressive Edge Growth techniques for block fading channels

A. G. Uchoa, Cornelius T. Healy, R. D. Lamare, R. Souza
{"title":"LDPC codes based on Progressive Edge Growth techniques for block fading channels","authors":"A. G. Uchoa, Cornelius T. Healy, R. D. Lamare, R. Souza","doi":"10.1109/ISWCS.2011.6125390","DOIUrl":null,"url":null,"abstract":"We propose an algorithm to design Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels. The proposed algorithm imposes some restrictions on the traditional PEG algorithm to ensure that the LDPC code generated is Root-Check with the largest possible girth. The performance is investigated by means of the outage probability. By doing so, the codes generated by our proposed algorithm are shown to outperform the existing methods for generating Root-Check LDPC codes.","PeriodicalId":414065,"journal":{"name":"2011 8th International Symposium on Wireless Communication Systems","volume":"367 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 8th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2011.6125390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

We propose an algorithm to design Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels. The proposed algorithm imposes some restrictions on the traditional PEG algorithm to ensure that the LDPC code generated is Root-Check with the largest possible girth. The performance is investigated by means of the outage probability. By doing so, the codes generated by our proposed algorithm are shown to outperform the existing methods for generating Root-Check LDPC codes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于渐进式边缘增长技术的分组衰落信道LDPC码
提出了一种基于逐行边缘增长(PEG)技术的分组衰落信道根检LDPC码设计算法。该算法对传统的PEG算法进行了一定的限制,以保证生成的LDPC码是具有最大周长的Root-Check。用中断概率来考察系统的性能。通过这样做,我们提出的算法生成的代码被证明优于现有的生成根检查LDPC代码的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transmit precoding scheme for ICI suppression and path diversity in FS-OFDM A simple analytical model for Robust Header Compression in correlated wireless links CORELA: A cooperative relaying enhanced link adaptation algorithm for IEEE 802.11 WLANs Interference alignment, carrier pairing, and lattice decoding Asymptotic performance of dual-hop non-regenerative cooperative systems with or without direct path
×
引用
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