Multi-Label and Concatenated Neural Block Decoders

C. Leung, M. Motani, R. Bhat
{"title":"Multi-Label and Concatenated Neural Block Decoders","authors":"C. Leung, M. Motani, R. Bhat","doi":"10.1109/ISIT44484.2020.9174106","DOIUrl":null,"url":null,"abstract":"There has been a growing interest in designing neural-network based decoders (or neural decoders in short) for communication systems. In the prior work, we cast the problem of decoding an (n, k) block code as a single-label classification problem, and it is shown that the performance of such single-label neural decoders closely approaches that of the corresponding maximum likelihood soft-decision (ML-SD) decoders. The main issue is that the number of output nodes of single-label neural decoders increases exponentially with k, making it prohibitive to decode a code with medium or large dimension. To address this issue, we first explore a multi-label classification based neural decoder for block codes, in which the number of output nodes increases linearly with k. The complexity of the multi-label neural decoder is lower, but the performance is still close to that of the ML-SD decoder. We also consider concatenating a high-rate short-length outer code with the original code as the inner code. The proposed concatenated decoding architecture consists of a multi-label neural decoder for the inner code and a single label neural decoder for the outer code. The results demonstrate that the concatenated decoding approach leads to better bit and block error performance as compared to a benchmark soft-decision decoder. We note that the overall size of the concatenated neural decoder is close to that of the single-label neural decoder.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"14 11-12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","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.9174106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

There has been a growing interest in designing neural-network based decoders (or neural decoders in short) for communication systems. In the prior work, we cast the problem of decoding an (n, k) block code as a single-label classification problem, and it is shown that the performance of such single-label neural decoders closely approaches that of the corresponding maximum likelihood soft-decision (ML-SD) decoders. The main issue is that the number of output nodes of single-label neural decoders increases exponentially with k, making it prohibitive to decode a code with medium or large dimension. To address this issue, we first explore a multi-label classification based neural decoder for block codes, in which the number of output nodes increases linearly with k. The complexity of the multi-label neural decoder is lower, but the performance is still close to that of the ML-SD decoder. We also consider concatenating a high-rate short-length outer code with the original code as the inner code. The proposed concatenated decoding architecture consists of a multi-label neural decoder for the inner code and a single label neural decoder for the outer code. The results demonstrate that the concatenated decoding approach leads to better bit and block error performance as compared to a benchmark soft-decision decoder. We note that the overall size of the concatenated neural decoder is close to that of the single-label neural decoder.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多标签和连接神经块解码器
为通信系统设计基于神经网络的解码器(或简称神经解码器)的兴趣越来越大。在之前的工作中,我们将解码(n, k)块码的问题转换为单标签分类问题,并且表明这种单标签神经解码器的性能非常接近相应的最大似然软决策(ML-SD)解码器。主要问题是单标签神经解码器的输出节点数量随着k呈指数增长,这使得它无法解码中等或大维度的代码。为了解决这个问题,我们首先探索了一种基于多标签分类的块码神经解码器,其中输出节点的数量随k线性增加。多标签神经解码器的复杂性较低,但性能仍接近ML-SD解码器。我们还考虑将高速率的短长度外部代码与原始代码连接起来作为内部代码。所提出的串接解码架构由一个多标签神经解码器用于内码和一个单标签神经解码器用于外码组成。结果表明,与基准软判决解码器相比,串联解码方法具有更好的位和块错误性能。我们注意到,串联神经解码器的总体大小接近于单标签神经解码器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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