首页> 外国专利> METHOD FOR STRUCTURE OF MIN-SUM VERIFICATION NODE FOR DECODERS LDPC PARALLELIZED WITH RECURSIVE STRUCTURE, AND DISTRIBUTED CHECK

METHOD FOR STRUCTURE OF MIN-SUM VERIFICATION NODE FOR DECODERS LDPC PARALLELIZED WITH RECURSIVE STRUCTURE, AND DISTRIBUTED CHECK

机译:具有递归结构的解码器LDPC最小和校验节点的结构方法及分布式检查

摘要

new method for min-sum verification node structure for low density parity-check (ldpc) decoders paralleled with recursive structure and distributed verification, which allows design of a verification node which produces the exact output for the min-sum algorithm whose size grows linearly and whose latency grows logarithmically with the number of parity bits in the code. where a distribution of the operations needed to calculate the verification node result for associative, commutative, but not invertible operations based on the computation of the min-sum verification nodes is proposed and described as a divide and conquer algorithm, which can be justified by the merge-sort algorithm, such algorithm can be implemented in hardware with area and power complexity and latency, in order to simplify the verification node in the min-sum algorithm and its variations, obtaining a parallelable structure for determining the message of the verification node.
机译:与递归结构和分布式验证并行的低密度奇偶校验(ldpc)解码器最小和校验节点结构的新方法,它允许设计一个校验节点,该校验节点为最小和算法生成精确的输出,该算法的大小线性增长,并且其延迟随代码中奇偶校验位的数量成对数增长。提出了基于最小和校验节点的计算来为关联,可交换但不是可逆操作计算校验节点结果所需的操作分布,并将其描述为分而治之算法,该算法可以证明是合理的合并排序算法,这种算法可以在面积,功率复杂度和等待时间的硬件中实现,以便简化最小和算法及其变体中的验证节点,从而获得用于确定验证节点消息的可并行结构。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号