首页> 外文会议>IEEE International Symposium on Circuits and Systems >Efficient metric sorting schemes for successive cancellation list decoding of polar codes
【24h】

Efficient metric sorting schemes for successive cancellation list decoding of polar codes

机译:高效的度量标准排序方案,用于终于取消列表解码极码代码

获取原文

摘要

Path metric sorting unit of successive cancellation list (SCL) decoders for polar codes is the main concern in this paper. After reviewing existing sorting units in SCL decoders, we propose 2 new sorting schemes namely quick select (QS) based selection algorithm and simplified bitonic sorter (SBT), which exploit the special data dependency of path metrics in log-likelihood ratio based SCL decoding. Theoretical analysis shows that for the list size of L ≤ 8, QS-based selection algorithm has lower delay than existing schemes. FPGA implementation based on Artix7 Family shows that for the list size of L ≥ 16, SBT has the same delay while the hardware reduction is over 40%.
机译:用于极性代码的连续取消列表(SCL)解码器的路径度量排序单元是本文主要关注的问题。在查看SCL解码器中的现有排序单元之后,我们提出了2个新的排序方案即可快速选择(QS)的选择算法和简化的BitOnic分类机(SBT),其利用路径测量的特殊数据依赖性基于基于SCL解码的Log-似然比中的路径度量。理论分析表明,对于L≤8的列表大小,基于QS的选择算法的延迟较低。基于ARTIX7系列的FPGA实现显示,对于L≥16的列表大小,SBT具有相同的延迟,而硬件减少超过40%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号