A new class of parity-check concatenated polar codes using belief propagation decoding

Inseon Kim, Hong‐Yeop Song
{"title":"A new class of parity-check concatenated polar codes using belief propagation decoding","authors":"Inseon Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966111","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a construction of parity-check equations for Low Density Parity-Check (LDPC) based Parity-Check Concatenated (PCC) polar codes in order to (i) increase the minimum Hamming weight and (ii) correct some errors using belief propagation decoding. We simulate some experiment to show that the proposed LDPC base PCC polar codes have coding gain in the sense of block error rate compared with existing PCC polar codes.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA46143.2019.8966111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a construction of parity-check equations for Low Density Parity-Check (LDPC) based Parity-Check Concatenated (PCC) polar codes in order to (i) increase the minimum Hamming weight and (ii) correct some errors using belief propagation decoding. We simulate some experiment to show that the proposed LDPC base PCC polar codes have coding gain in the sense of block error rate compared with existing PCC polar codes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信念传播译码的一类新的奇偶校验连接极码
本文提出了一种基于低密度奇偶校验(LDPC)的奇偶校验(PCC)极码的奇偶校验方程的构造,目的是:(1)提高最小汉明权值,(2)利用信念传播译码修正一些错误。仿真实验表明,与现有的PCC极性码相比,本文提出的LDPC基PCC极性码在分组错误率方面具有编码增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimization Method for Designing Sequences With Low Partial-period Autocorrelation Sidelobes Decoding Scheduling for Unequal Error Protection Quasi-Cyclic Low-Density Parity-Check Codes 4q-QAM Complementary Sequence Sets with Non-Power-of-Two Length* Properties of Knuth’s Quadratic Congruential Sequences with Modulus m = 2W p New Constructions of Binary (Near) Complementary Sets
×
引用
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