A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes

Rong Sun, Tingting Wang, Jingwei Liu
{"title":"A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes","authors":"Rong Sun, Tingting Wang, Jingwei Liu","doi":"10.1109/ICCCHINA.2018.8641088","DOIUrl":null,"url":null,"abstract":"A modified unquantized Fano sequential decoding (MUFSD) algorithm for rateless spinal codes is proposed. The maximum storage space is introduced in MUFSD algorithm. When the number of stored nodes exceeds the storage space, the decoding is stopped immediately so that the decoding process can be controlled well. The calculated nodes are reserved at each forward calculation which reduces the computational complexity. An expression of the new branch metrics of spinal codes over additive white Gaussian noise (AWGN) channel are derived for the MUFSD algorithm. Simulation results show that the complexity and time consumption of the MUFSD algorithm for spinal codes are further reduced without sacrificing the rate performance compared with those of the bubble decoder and the forward stack decoding (FSD) algorithm. Particularly, in the case of low signal-to-noise ratio (SNR), the complexity and time consumption of the MUFSD algorithm are significantly decreased.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A modified unquantized Fano sequential decoding (MUFSD) algorithm for rateless spinal codes is proposed. The maximum storage space is introduced in MUFSD algorithm. When the number of stored nodes exceeds the storage space, the decoding is stopped immediately so that the decoding process can be controlled well. The calculated nodes are reserved at each forward calculation which reduces the computational complexity. An expression of the new branch metrics of spinal codes over additive white Gaussian noise (AWGN) channel are derived for the MUFSD algorithm. Simulation results show that the complexity and time consumption of the MUFSD algorithm for spinal codes are further reduced without sacrificing the rate performance compared with those of the bubble decoder and the forward stack decoding (FSD) algorithm. Particularly, in the case of low signal-to-noise ratio (SNR), the complexity and time consumption of the MUFSD algorithm are significantly decreased.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种改进的无速率脊髓码非量化Fano顺序解码算法
提出了一种改进的无速率脊髓码非量化范诺序列解码算法。在MUFSD算法中引入了最大存储空间。当存储的节点数量超过存储空间时,立即停止解码,以便很好地控制解码过程。每次前向计算都保留计算节点,降低了计算复杂度。推导了基于加性高斯白噪声(AWGN)信道的脊柱码新分支度量表达式。仿真结果表明,与气泡解码器和前向堆栈解码(FSD)算法相比,MUFSD算法在不牺牲码率性能的前提下,进一步降低了脊髓码的复杂度和时间消耗。特别是在低信噪比的情况下,大大降低了MUFSD算法的复杂度和耗时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Power Allocation for D2D Assisted Cooperative Relaying System with NOMA Hybrid Transmission Time Intervals for TCP Slow Start in Mobile Edge Computing System UE Computation Offloading Based on Task and Channel Prediction of Single User A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes Cooperative Slotted Aloha with Reservation for Multi-Receiver Satellite IoT Networks
×
引用
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