Partially Information Coupled Duo-Binary Turbo Codes

Xiaowei Wu, Min Qiu, Jinhong Yuan
{"title":"Partially Information Coupled Duo-Binary Turbo Codes","authors":"Xiaowei Wu, Min Qiu, Jinhong Yuan","doi":"10.1109/ISIT44484.2020.9174156","DOIUrl":null,"url":null,"abstract":"Partially information coupled turbo codes (PIC-TCs) is a class of spatially coupled turbo codes that can approach the BEC capacity while keeping the encoding and decoding architectures of the underlying component codes unchanged. However, PIC-TCs have significant rate loss compared to its component rate-$\\frac{1}{3}$ turbo code, and the rate loss increases with the coupling ratio. To absorb the rate loss, in this paper, we propose the partially information coupled duo-binary turbo codes (PIC-dTCs). Given a rate-$\\frac{1}{3}$ turbo code as the benchmark, we construct a duo-binary turbo code by introducing one extra input to the benchmark code. Then, parts of the information sequence from the original input are coupled to the extra input of the succeeding code blocks. By looking into the graph model of PIC-dTC ensembles, we derive the exact density evolution equations of the PIC-dTC ensembles, and compute their belief propagation decoding thresholds on the binary erasure channel. Simulation results verify the correctness of our theoretical analysis, and also show significant error performance improvement over the uncoupled rate-$\\frac{1}{3}$ turbo codes and existing designs of spatially coupled turbo codes.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT44484.2020.9174156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Partially information coupled turbo codes (PIC-TCs) is a class of spatially coupled turbo codes that can approach the BEC capacity while keeping the encoding and decoding architectures of the underlying component codes unchanged. However, PIC-TCs have significant rate loss compared to its component rate-$\frac{1}{3}$ turbo code, and the rate loss increases with the coupling ratio. To absorb the rate loss, in this paper, we propose the partially information coupled duo-binary turbo codes (PIC-dTCs). Given a rate-$\frac{1}{3}$ turbo code as the benchmark, we construct a duo-binary turbo code by introducing one extra input to the benchmark code. Then, parts of the information sequence from the original input are coupled to the extra input of the succeeding code blocks. By looking into the graph model of PIC-dTC ensembles, we derive the exact density evolution equations of the PIC-dTC ensembles, and compute their belief propagation decoding thresholds on the binary erasure channel. Simulation results verify the correctness of our theoretical analysis, and also show significant error performance improvement over the uncoupled rate-$\frac{1}{3}$ turbo codes and existing designs of spatially coupled turbo codes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
部分信息耦合的双二进制Turbo码
部分信息耦合turbo码(pic - tc)是一类空间耦合的turbo码,它可以在保持底层组件码的编码和解码结构不变的情况下接近BEC容量。但pic - tc相对于其组件速率$\frac{1}{3}$ turbo码具有显著的速率损耗,且速率损耗随耦合比的增大而增大。为了吸收速率损失,本文提出了部分信息耦合的双二进制turbo码(pic - dtc)。给定一个rate-$\frac{1}{3}$ turbo代码作为基准,我们通过在基准代码中引入一个额外的输入来构造一个双二进制turbo代码。然后,来自原始输入的部分信息序列耦合到后续代码块的额外输入。通过研究PIC-dTC集成的图模型,导出了PIC-dTC集成的精确密度演化方程,并计算了它们在二进制擦除信道上的信念传播译码阈值。仿真结果验证了理论分析的正确性,并且与不耦合率-$\frac{1}{3}$ turbo码和现有空间耦合turbo码相比,误差性能得到了显著改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Community Detection with Secondary Latent Variables Capacity of Line-of-Sight MIMO Channels On the Randomized Babai Point A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3
×
引用
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