专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07969862B1 Cycle-based restoration in mesh networks utilizing bandwidth and flow considerations 有权
标题翻译：利用带宽和流量考虑的网状网络中的基于周期的恢复
公开(公告)号：US07969862B1
公开(公告)日：2011-06-28
申请号：US10434868
申请日：2003-05-09
申请人： Guo-Qiang Wang , Attahiru Sule Alfa
发明人： Guo-Qiang Wang , Attahiru Sule Alfa
IPC分类号： H04L1/00 , H04L12/26 , H04L12/28
CPC分类号： H04L45/22 , H04L45/125 , H04L45/28
摘要： A two step method for determining restoration cycles for a mesh network includes generating a set of possible restoration cycles, and selecting a subset of low-cost restoration cycles on the network. The cost of a restoration cycle may be based, in part, on the availability of capacity on the link to restore traffic with and/or without interference, and network policy. Enabling the restoration cycles to be determined based on the bandwidth capacity of the restoring link, the flows carried by the other link, and other network policy considerations enables embodiments of the invention to account for traffic class, priority, and other traffic considerations when selecting restoration cycles on the network. Identifying arcs on the network with relatively high cost restoration cycles allows portions of the network to be targeted for increased capacity.
摘要翻译：用于确定网状网络的恢复周期的两步法包括生成一组可能的恢复周期，以及在网络上选择低成本恢复周期的子集。恢复周期的成本可以部分地基于在具有和/或没有干扰的情况下恢复业务的链路上的容量的可用性以及网络策略。基于恢复链路的带宽容量，其他链路承载的流以及其他网络策略考虑使得能够确定恢复周期，使得本发明的实施例能够在选择恢复时考虑业务类别，优先级和其他流量注意事项在网络上循环。在具有相对较高成本的恢复周期的网络上识别电弧允许网络的一部分被增加容量。

2. 发明授权

US08972817B2 Two low complexity decoding algorithms for LDPC codes 有权
标题翻译： LDPC码的两种低复杂度解码算法
公开(公告)号：US08972817B2
公开(公告)日：2015-03-03
申请号：US13486077
申请日：2012-06-01
申请人： Telex Maglorie Ngatched Nkouatchah , Attahiru Sule Alfa , Jun Cai
发明人： Telex Maglorie Ngatched Nkouatchah , Attahiru Sule Alfa , Jun Cai
IPC分类号： H03M13/00 , G06F11/00 , H03M13/11
CPC分类号： H03M13/6527 , H03M13/1117 , H03M13/1165 , H03M13/6544 , H03M13/6577 , H03M13/658
摘要： In the present invention, two improved variants of the reliability-based iterative majority-logic decoding algorithm for regular low-density parity-check (LDPC) codes are presented. The new algorithms are obtained by introducing a different reliability measure for each check-sum of the parity-check matrix, and taking it into account in the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration. In contrast to the first algorithm, the second algorithm includes check reliability that changes at each iteration. For the tested random and structured LDPC codes, both algorithms, while requiring very little additional computational complexities, achieve a considerable error performance gain over the standard one. More importantly, for short and medium block length LDPC codes of relatively large column weight, both algorithms outperform or perform just as well as the iterative decoding based on belief propagation (IDBP) with less decoding complexity.
摘要翻译：在本发明中，提出了用于常规低密度奇偶校验（LDPC）码的基于可靠性的迭代多数逻辑解码算法的两个改进的变体。通过对奇偶校验矩阵的每个校验和引入不同的可靠性度量来获得新算法，并且在用于更新每个迭代中每个接收比特的可靠性度量的外在信息的计算中考虑。与第一种算法相反，第二种算法包括在每次迭代时改变的校验可靠性。对于测试的随机和结构化LDPC码，这两种算法在需要非常少的额外的计算复杂性的情况下实现了比标准算法更大的错误性能增益。更重要的是，对于相对较大的列权重的短和中块长度的LDPC码，两种算法比基于具有较低解码复杂度的置信传播（IDBP）的迭代解码性能优于或执行。

3. 发明申请

US20130055043A1 Two Low Complexity Decoding Algorithms for LDPC Codes 审中-公开
标题翻译： LDPC码的两个低复杂度解码算法
公开(公告)号：US20130055043A1
公开(公告)日：2013-02-28
申请号：US13486077
申请日：2012-06-01
申请人： Telex Maglorie Ngatched , Attahiru Sule Alfa , Jun Cai
发明人： Telex Maglorie Ngatched , Attahiru Sule Alfa , Jun Cai
IPC分类号： H03M13/11 , G06F11/10
CPC分类号： H03M13/6527 , H03M13/1117 , H03M13/1165 , H03M13/6544 , H03M13/6577 , H03M13/658
摘要： In the present invention, two improved variants of the reliability-based iterative majority-logic decoding algorithm for regular low-density parity-check (LDPC) codes are presented. The new algorithms are obtained by introducing a different reliability measure for each check-sum of the parity-check matrix, and taking it into account in the computation of the extrinsic information that is used to update the reliability measure of each received bit in each iteration. In contrast to the first algorithm, the second algorithm includes check reliability that changes at each iteration. For the tested random and structured LDPC codes, both algorithms, while requiring very little additional computational complexities, achieve a considerable error performance gain over the standard one. More importantly, for short and medium block length LDPC codes of relatively large column weight, both algorithms outperform or perform just as well as the iterative decoding based on belief propagation (IDBP) with less decoding complexity.
摘要翻译：在本发明中，提出了用于常规低密度奇偶校验（LDPC）码的基于可靠性的迭代多数逻辑解码算法的两个改进的变体。通过对奇偶校验矩阵的每个校验和引入不同的可靠性度量来获得新算法，并且在用于更新每个迭代中每个接收比特的可靠性度量的外在信息的计算中考虑。与第一种算法相反，第二种算法包括在每次迭代时改变的校验可靠性。对于测试的随机和结构化LDPC码，这两种算法在需要非常少的额外的计算复杂性的情况下实现了比标准算法更大的错误性能增益。更重要的是，对于相对较大的列权重的短和中块长度的LDPC码，两种算法比基于具有较低解码复杂度的置信传播（IDBP）的迭代解码性能优于或执行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式