会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Decoding apparatus
    • 解码装置
    • US08205130B2
    • 2012-06-19
    • US12100730
    • 2008-04-10
    • Masashi ShinagawaHiroyuki YamagishiMakoto Nada
    • Masashi ShinagawaHiroyuki YamagishiMakoto Nada
    • G06F11/00
    • H03M13/1137H03M13/1111H03M13/6566
    • In the present application, there is provided a decoding apparatus for decoding low density parity check codes, including: a plurality of storage sections configured to store logarithmic likelihood ratios or logarithmic posteriori probability ratios for one codeword into addresses thereof which are independent of each other thereamong; and a readout section configured to simultaneously read out, from among the logarithmic likelihood ratios or logarithmic posteriori probability ratios for the one codeword stored in the storage sections, a plurality of ones of the logarithmic likelihood ratios or logarithmic posteriori probability ratios which correspond to non-zero value elements in a predetermined one row of the check matrix used in a coding process of the low density parity check codes.
    • 在本申请中,提供了一种用于解码低密度奇偶校验码的解码装置,包括:多个存储部分,被配置为将一个码字的对数似然比或对数后验概率比存储为彼此独立的地址 ; 以及读出部,被配置为从存储在存储部中的一个码字的对数似然比或对数后验概率之中同时读出与非对数似然比对应的多个对数似然比或对数后验概率, 在低密度奇偶校验码的编码处理中使用的校验矩阵的预定一行中的零值元素。
    • 8. 发明申请
    • CRC generator polynomial select method, CRC coding method and CRC coding circuit
    • CRC生成多项式选择方法,CRC编码方法和CRC编码电路
    • US20080320370A1
    • 2008-12-25
    • US11821561
    • 2007-06-22
    • Masashi ShinagawaKeitarou KondouMakoto Noda
    • Masashi ShinagawaKeitarou KondouMakoto Noda
    • H03M13/00
    • H03M13/09H03M13/6508
    • Disclosed herein is a CRC generator polynomial select method for selecting a generator polynomial to be used in CRC coding processing and/or CRC processing of inspecting a CRC processing result, the CRC generator polynomial select method may include a first process of finding largest minimum Hamming distances Max.dmin; a second process of finding code lengths n for each of the largest minimum Hamming distances Max.dmin and determining a range expressed by relations nmin (r, Max.dmin)≦n≦nmax (r, Max.dmin); a third process of searching all generator polynomials G(x) for specific generator polynomials G(x); and a fourth process of selecting final generator polynomials G(x) each having a smallest term count w and a lowest code undetected-error probability Pud from the specific generator polynomials G(x).
    • 本发明公开了一种CRC生成多项式选择方法,用于选择在CRC编码处理中使用的生成多项式和/或检查CRC处理结果的CRC处理,CRC生成多项式选择方法可以包括找到最大最小汉明距离的第一处理 Max.dmin; 对于最大最小汉明距离Max.dmin中的每一个找到码长度n的第二过程,并且确定由关系nmin(r,Max.dmin)表示的范围,其中,nmin(r,Max.dmin); 搜索特定生成多项式G(x)的所有生成多项式G(x)的第三处理; 以及从特定生成多项式G(x)中选择最终生成多项式G(x)的第四处理,每个最终生成多项式G(x)具有最小项数w和最低代码未检测错误概率Pud。