...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Wireless Communications Letters, IEEE >Low-Complexity Decoding for RaptorQ Codes Using a Recursive Matrix Inversion Formula
【24h】

Low-Complexity Decoding for RaptorQ Codes Using a Recursive Matrix Inversion Formula

机译：使用递归矩阵求逆公式对RaptorQ码进行低复杂度解码

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this letter, we propose a low-complexity recursive decoding algorithm for rateless RaptorQ codes, the next generation error correction codes adopted by several standards such as DVB-H. Conventionally, the decoding of RaptorQ codes requires inverting a huge receive code generator matrix (RCGM). Instead of such costly matrix inversion, we propose to calculate the inverse of the transmit code generator matrix (TCGM) beforehand. Then, based on this pre-calculated inverse, the Sherman-Morrison formula is applied to recursively compute the inverse of the RCGM at run time. Most computations are thus shifted offline. Moreover, this recursive decoding distributes the computations among different time slots, thereby significantly shortening the decoding latency and improving the hardware utilization. Numerical simulations demonstrate that the computational complexity of the proposed recursive decoding is as low as 6.5% of that required by the conventional method using direct matrix inversion.
机译：在这封信中，我们为无速率RaptorQ码提出了一种低复杂度的递归解码算法，RaptorQ码是几种标准（例如DVB-H）采用的下一代纠错码。按照惯例，对RaptorQ代码的解码需要对巨大的接收码生成器矩阵（RCGM）进行反转。代替这种昂贵的矩阵求逆，我们建议预先计算发送码生成器矩阵（TCGM）的逆。然后，基于此预先计算的逆，将Sherman-Morrison公式应用于在运行时递归计算RCGM的逆。因此，大多数计算都脱机了。此外，该递归解码将计算分配在不同时隙之间，从而显着缩短了解码等待时间并提高了硬件利用率。数值仿真表明，所提出的递归解码的计算复杂度低至使用直接矩阵求逆的传统方法所需的6.5％。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号