会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 171. 发明授权
    • Low-density parity check convolution code (LDPC-CC) encoder and LDPC-CC decoder
    • 低密度奇偶校验卷积码(LDPC-CC)编码器和LDPC-CC解码器
    • US08423876B2
    • 2013-04-16
    • US12668655
    • 2008-07-11
    • Shutai OkamuraYutaka MurakamiMasayuki Orihashi
    • Shutai OkamuraYutaka MurakamiMasayuki Orihashi
    • H03M13/03
    • H03M13/118H03M13/1111H03M13/1154H03M13/23H03M13/235H03M13/6362
    • It is possible to provide and an LDPC-CC (Low-Density Parity-Check Convolution Codes) encoder and an LDPC-CC decoder which performs an error correction encoding and decoding while reducing the amount of a termination sequence required for encoding/decoding the LDPC-CC encoding/decoding and suppressing degradation of the transmission efficiency. The LDPC-CC encoder (400) includes a weight control unit (470) which stores a weight pattern (475) based on an LDPC-CC inspection matrix (100); and a weight pattern (476) based on a check matrix (300) obtained by deforming an LDPC-CC inspection matrix (100). The weight control unit (470) controls a weight to be multiplied onto the outputs of a plurality of shift registers (410-1 to 410-M, 430-1 to 430-M) by using the weight pattern (475) when the input bit is an information sequence, and using a weight pattern (476) which makes a weight value to be multiplied by an inspection bit v2,t to be 0 when the input bit is a termination sequence.
    • 可以提供LDPC-CC(低密度奇偶校验卷积码)编码器和LDPC-CC解码器,该LDPC-CC解码器在减少LDPC编码/解码所需的终止序列的量的同时进行纠错编码和解码 -CC编码/解码并抑制传输效率的降低。 LDPC-CC编码器(400)包括:权重控制单元(470),其基于LDPC-CC检查矩阵(100)存储权重模式(475); 以及基于通过使LDPC-CC检查矩阵(100)变形而获得的校验矩阵(300)的权重模式(476)。 权重控制单元(470)通过使用加权模式(475)来控制要乘以多个移位寄存器(410-1至410-M,430-1至430-M)的输出的权重 位是信息序列,并且当输入比特是终止序列时,使用使加权值乘以检查比特v2的加权模式(476),t为0。
    • 177. 发明申请
    • ENCODING METHOD, ENCODER AND DECODER
    • US20110264984A1
    • 2011-10-27
    • US13142212
    • 2009-12-18
    • Yutaka Murakami
    • Yutaka Murakami
    • H03M13/05G06F11/10
    • H03M13/2792H03M13/1102H03M13/23H03M13/235H03M13/353H03M13/6502H03M13/6516H04L1/0041
    • Disclosed is an encoding method to change an encoding rate of an erasure correcting code, while decreasing a circuit scale of an encoder and a decoder. 12k bit (wherein k represents a natural number) which is an encoding output using LDPC-CC with an encoding rate of ½, and comprises information and parity, is defined as one cycle. From the one cycle, only the information is arranged in the output order of the encoding output to obtain 6k bit information X6i, X6i+1, X6i+2, X6i+3, X6i+4, X6i+5, . . . , X6(i+k−1) X6(i+k−1)+1, X6(i+k−1)+2, X6(i+k−1)+3, X6(i+k−1)+4, and X6(i+k−1)+5. Known information is inserted, in 3k pieces of information (Xj) among the 6k bit information, so that when 3k pieces of mutually different j is divided by 3, there is a remainder of 0 regarding k pieces, there is a remainder of 1 regarding k pieces, and there is a remainder of 2 regarding k pieces, to thereby obtain the parity from the information containing the known information. [Numerical formulas] (Da1+Da2+Da3)X(D)+(Db1+Db2+Db3)P(D)=0  (1-1) (DA1+DA2+DA3)X(D)+(DB1+DB2+DB3)P(D)=0  (1-2) (Da1+Da2+Da3)X(D)+(Dss1+Dss2+Dss3)P(D)=0  (1-3) wherein X(D) is a polynomial expression of the information X; P(D) is a polynomial expression of the parity; a1, a2, a3 are integers (with the proviso that a1≠a2≠a3); b1, b2, b3 are integers (with the proviso that b1≠b2≠b3); A1, A2, A3 are integers (with the proviso that A1≠A2≠A3); B1, B2, B3 are integers (with the proviso that B1≠B2≠B3); a1, a2, a3 are integers (with the proviso that a1≠a2≠a3); ss1, ss2, ss3 are integers (with the proviso that ss1≠ss2≠ss3); and “c % d” represents “a remainder when c is divided by d”.