检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘锐 黎勇 LIU Rui;LI Yong(School of Computer Science,Chongqing University,Chongqing 400044,China)
出 处:《通信学报》2023年第10期23-33,共11页Journal on Communications
基 金:国家自然科学基金资助项目(No.61771081)。
摘 要:尽管多元LDPC码纠错性能优异且能抗突发错误,但高译码复杂度仍制约了其实际应用。在其经典的FHT-QSPA译码中,快速哈达玛变换(FHT)及其逆变换(IFHT)是校验节点更新的主要瓶颈。基于此,提出了基于系统型MDS码的编码分布式FHT方案。该方案在主节点上将信道概率建模为矩阵并对其进行切分,再编码生成冗余子矩阵;其后,将所有子矩阵卸载到从节点并行执行FHT和IFHT,然后将计算结果传回主节点并完成最终译码。编码冗余的嵌入克服了节点掉队问题,稳定地提升了变换效率,从而加速了整个译码过程。与先前的编码矩阵乘法方案相比,所提方案编码复杂度更低、译码恢复数值精度更高,并保持了高效蝶形运算结构,降低了从节点计算复杂度。耗时对比和译码性能分析表明,所提方案相比传统单节点FHT方案快了约3.8倍,大幅提升了FHT-QSPA译码效率,且没有译码性能损失。Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes,the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding,the fast Hadamard transform(FHT)and its inverse transform(IFHT)have become the main bottleneck for updating the check nodes.Therefore,a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme,the channel probability was modeled by the master node as a matrix and it was segmented,and those sub-matrices were encoded into redundant ones.Then,all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT,and the results were sent back to the master node for the final decoding.By embedding redundant information,the proposed scheme resolved the straggling problem,improving the efficiency,and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes,the proposed scheme provides lower encoding complexity,higher numerical accuracy in decoding recovery,and maintains an efficient butterfly operation,effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme,significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance.
关 键 词:多元LDPC码译码 编码分布式计算 快速哈达玛变换
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38