会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method for padding and puncturing low density parity check code
    • 填补和打孔低密度奇偶校验码的方法
    • US08006162B2
    • 2011-08-23
    • US11435014
    • 2006-05-16
    • Eoi-Young ChoiSeung-Bum Suh
    • Eoi-Young ChoiSeung-Bum Suh
    • H03M13/00
    • H03M13/6393H03M13/116H03M13/1185H03M13/1188H03M13/6356H03M13/6362
    • Disclosed is a method for puncturing a Low Density Parity Check (LDPC) code that is expressed by a factor graph having a check node and a variable node, connected to each other by an edge, and is decoded by a parity check matrix including a parity part having a single weight-3 column and a dual-diagonal matrix. The method includes selecting 1-step recoverable (1-SR) variable nodes with the highest quality including a variable node mapped to a weight-3 column, and setting a first puncturing priority group using the selected 1-SR variable nodes, selecting k-step recoverable (k-SR) variable nodes with the highest quality in the next step k taking into account the variable nodes selected in the current step, and setting a priority group for each individual step, puncturing an LDPC code mapped to a variable node belonging to a corresponding group according to priority of each group obtained in the preceding steps.
    • 公开了一种用于删除由具有由边缘彼此连接的校验节点和可变节点的因子图表示的低密度奇偶校验(LDPC)码的方法,并且通过包括奇偶校验的奇偶校验矩阵来解码 部分具有单个重量3列和双对角矩阵。 该方法包括选择具有最高质量的一步可恢复(1-SR)变量节点,包括映射到权重3列的变量节点,以及使用所选择的1-SR变量节点设置第一穿孔优先级组,选择k- 考虑到当前步骤中选择的变量节点,在下一步骤k中具有最高质量的步骤可恢复(k-SR)变量节点,并且为每个单独步骤设置优先级组,对映射到属于变量节点的LDPC码进行穿孔 根据在前述步骤中获得的每个组的优先级,对应于组。
    • 7. 发明申请
    • Method for padding and puncturing low density parity check code
    • 填补和打孔低密度奇偶校验码的方法
    • US20070011567A1
    • 2007-01-11
    • US11435014
    • 2006-05-16
    • Eoi-Young ChoiSeung-Bum Suh
    • Eoi-Young ChoiSeung-Bum Suh
    • H03M13/00
    • H03M13/6393H03M13/116H03M13/1185H03M13/1188H03M13/6356H03M13/6362
    • Disclosed is a method for puncturing a Low Density Parity Check (LDPC) code that is expressed by a factor graph having a check node and a variable node, connected to each other by an edge, and is decoded by a parity check matrix including a parity part having a single weight-3 column and a dual-diagonal matrix. The method includes selecting 1-step recoverable (1-SR) variable nodes with the highest quality including a variable node mapped to a weight-3 column, and setting a first puncturing priority group using the selected 1-SR variable nodes, selecting k-step recoverable (k-SR) variable nodes with the highest quality in the next step k taking into account the variable nodes selected in the current step, and setting a priority group for each individual step, puncturing an LDPC code mapped to a variable node belonging to a corresponding group according to priority of each group obtained in the preceding steps.
    • 公开了一种用于删除由具有由边缘彼此连接的校验节点和可变节点的因子图表示的低密度奇偶校验(LDPC)码的方法,并且通过包括奇偶校验的奇偶校验矩阵来解码 部分具有单个重量3列和双对角矩阵。 该方法包括选择具有最高质量的一步可恢复(1-SR)变量节点,包括映射到权重3列的变量节点,以及使用所选择的1-SR变量节点设置第一穿孔优先级组,选择k- 考虑到当前步骤中选择的变量节点,在下一步骤k中具有最高质量的步骤可恢复(k-SR)变量节点,并且为每个单独步骤设置优先级组,对映射到属于变量节点的LDPC码进行穿孔 根据在前述步骤中获得的每个组的优先级,对应于组。