会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明专利
    • Decoding apparatus and decoding method
    • 解码设备和解码方法
    • JP2010206570A
    • 2010-09-16
    • JP2009050200
    • 2009-03-04
    • Sony Corpソニー株式会社
    • SHINAGAWA HITOSHINODA MAKOTOYAMAGISHI HIROYUKI
    • H03M13/41
    • H03M13/4176H03M13/4169H03M13/6561
    • PROBLEM TO BE SOLVED: To enable suppression of the size of memory which stores path selection information used in trace-back processes, and the latency accompanying decoding. SOLUTION: After xN-bit path selection information for radix -2 x is input with respect to a shift register 81 per clock and the amount corresponding to input k is stored, the amount of path selection information (kxN bits) is written at an address of a path memory RAM 82. In a trace-back circuit 83, the maximum likelihood path is selected, when a trace-back process takes place, based on the path selection information stored in the path memory RAM 82, and the value corresponding to each state on the maximum likelihood path is output as a decoding sequence. The present invention is applicable to receiving devices. COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:为了能够抑制存储跟踪过程中使用的路径选择信息的存储器的大小以及伴随解码的等待时间。

      解决方案:在每个时钟相对于移位寄存器81输入基数-2 x 的xN位路径选择信息之后,存储对应于输入k的量,路径选择量 在路径存储器RAM82的地址处写入信息(kxN位)。在追溯回路83中,基于存储在路径存储器RAM 82中的路径选择信息,当追溯处理发生时,选择最大似然路径 路径存储器RAM82,并且输出与最大似然路径上的每个状态相对应的值作为解码序列。 本发明可应用于接收设备。 版权所有(C)2010,JPO&INPIT

    • 3. 发明专利
    • Transmission apparatus and method, reception device and method, and program
    • 传输装置和方法,接收装置和方法以及程序
    • JP2009171540A
    • 2009-07-30
    • JP2008118548
    • 2008-04-30
    • Sony Corpソニー株式会社
    • SHINAGAWA HITOSHINODA MAKOTOYAMAGISHI HIROYUKIKONDO KEITARO
    • H04L1/00
    • H04L1/0061H03M13/036H03M13/09H03M13/6516H04L1/0041
    • PROBLEM TO BE SOLVED: To select much more suitable generator polynomials, and to switch the selected plurality of generator polynomials according to data to be processed for use. SOLUTION: The maximum/minimum hamming distance (Max.d min ) being the maximum value of the minimum hamming distance (d min ) in each code length (n) of a code with code length (n) having k bit information words to which r bit parity is added about the information word is found, and code length n whose Max.d min is changed is found, and the n range (n min ≤n≤n max ) is found. In the n range, generator polynomials (G(x)) satisfying d min =Max.d min all the time are found out by full retrieval, and the generator polynomial in which the number of items (w) and the undetected error capability (P ud ) of the code is the minimum is selected from among the G(x) found out by full retrieval. The plurality of generator polynomials selected in this way are switched and used according to the type or code length of data to be processed. COPYRIGHT: (C)2009,JPO&INPIT
    • 要解决的问题:选择更合适的生成多项式,并根据待处理的数据来切换所选择的多个生成多项式。

      解决方案:每个代码长度(n)中最大/最小汉明距离(Max.d min )是最小汉明距离(d min )的最大值 找到具有相对于该信息字相加r位奇偶校验的k位信息字的代码长度(n)的代码,找到Max.d min 改变的代码长度n, 并且发现n范围(n min ≤n≤n max )。 在n范围内,通过完全检索得到满足d min = Max.d min 的生成多项式(G(x)),生成多项式 从完全检索发现的G(x)中选择代码的数量(w)和未检测到的错误能力(P ud )的最小值。 以这种方式选择的多个生成多项式根据要处理的数据的类型或代码长度进行切换和使用。 版权所有(C)2009,JPO&INPIT

    • 4. 发明专利
    • Device and method for encoding, device and method for decoding, and recording medium
    • 用于编码的装置和方法,用于解码和记录介质的装置和方法
    • JP2006155878A
    • 2006-06-15
    • JP2005369578
    • 2005-12-22
    • Sony Corpソニー株式会社
    • NODA MAKOTOYAMAGISHI HIROYUKI
    • G11B20/14H03M7/14
    • PROBLEM TO BE SOLVED: To carry out encoding by using a code conversion table in which parities of code sequences are different until the time when code states become identical. SOLUTION: The code word allocation of the code conversion table is carried out such that the code word binding length of decoding time is 3 blocks and q 0 ≠q 1 is satisfied for an optional information sequence no matter which position of the first and second bits of an information word the insertion position of a DC control bit is inserted. For example, when information sequences d 0 and d 1 having temporary DC control bits 1 and 0 inserted into the head of an information sequence [1, 1, 0, 0, 0, 1, 0] are encoded by using a predetermined code conversion table with a state 3 set as a starting point, code states s 0 and s 1 become equal at s 0 =s 1 =6 at the third block, and the compliments q 0 and q 1 of 2 of totals of code sequences c 0 and c 1 until the time when the code states become equal are respectively 0 and 1, thereby establishing q 0 ≠q 1 . The invention is applicable to a recording/reproducing device or an encoding device. COPYRIGHT: (C)2006,JPO&NCIPI
    • 要解决的问题:通过使用其中代码序列的奇偶校验不同直到代码状态变得相同的代码转换表来执行编码。 解码:代码转换表的码字分配被执行,使得解码时间的码字绑定长度为3个块,并且q 0 ≠q 1 不管信息字的第一位和第二位的哪个位置,直流控制位的插入位置被插入,都满足可选的信息序列。 例如,当具有插入到信息序列[1,1,10,0]的头部的临时DC控制位1和0的信息序列d 0 和d 1 0,1,0]通过使用设置为起始点的状态3的预定代码转换表进行编码,代码状态s 0 和s 1 在s 在第三块处的 0 = s 1 = 6,并且2的补码q 0 和q 1 代码序列总数c 0 和c 1 直到代码状态变为相等的时间分别为0和1,从而建立q 0 q 1 。 本发明可应用于记录/再现设备或编码设备。 版权所有(C)2006,JPO&NCIPI
    • 5. 发明专利
    • Code detecting apparatus and method, decoding apparatus and method, and information processing apparatus and method
    • 代码检测装置和方法,解码装置和方法以及信息处理装置和方法
    • JP2005045735A
    • 2005-02-17
    • JP2003280427
    • 2003-07-25
    • Sony Corpソニー株式会社
    • YAMAGISHI HIROYUKI
    • H03M13/19H03M13/09
    • PROBLEM TO BE SOLVED: To simplify the circuit configuration of a memory or the like for storing messages to be exchanged between nodes in the case of code detection using a computing element twice or more in one time of repeat processing. SOLUTION: A code detecting apparatus 1 includes a bit node processing arithmetic part 7 which calculates a message Q m, n to be dispatched from a bit node Y n to a check node X m , a check node processing arithmetic part 5 which calculates a message R m, n to be dispatched from the check node to the bit node, a memory 4 which stores Q m, n , and a memory 6 which stores an arithmetic result of the processing arithmetic part 5, and a check node processing computing element 5 temporarily finds A m , B m from the successively inputted messages Q m, n , is successively inputted with the message Q m, n again, successively calculates the message R m, n from this message and the calculated A m , B m and outputs the calculated message to the bit node processing arithmetic part 7. In such a case, (m) is unitariness of a set M(n). COPYRIGHT: (C)2005,JPO&NCIPI
    • 要解决的问题:为了简化存储器等的电路配置,用于在重复处理的一次中使用计算元件两次或更多次来存储在代码检测的情况下在节点之间交换的消息。 解决方案:代码检测装置1包括:位节点处理算术部分7,其计算要从比特节点Y n 发送的消息Q m,n 到 检查节点X m ,校验节点处理算术部分5,其计算要从校验节点发送到比特节点的消息R SB,m N n,存储器4 存储Q< SB> m,n< / SB>和存储处理运算部5的运算结果的存储器6,并且校验节点处理计算单元5临时找到A m 来自连续输入的消息Q m,n 的B m 再次与消息Q m,n 相继输入,连续计算消息R m,n 和计算出的A m ,B m ,并将计算出的消息输出到位节点处理算术部分7.在 这种情况,(m)是集合M(n)的单位性。 版权所有(C)2005,JPO&NCIPI
    • 7. 发明专利
    • Encoding apparatus and method
    • 编码装置和方法
    • JP2010056660A
    • 2010-03-11
    • JP2008217004
    • 2008-08-26
    • Sony Corpソニー株式会社
    • YAMAGISHI HIROYUKI
    • H03M13/19G06F11/10
    • H03M13/15H03M13/116H03M13/6561
    • PROBLEM TO BE SOLVED: To make processing concerning encoding attain a high speed.
      SOLUTION: A combination circuit 253 obtains coefficients of q
      j (x
      2p ) one by one from higher rank 2p symbols of a (NK) step register 251, subtracts multiplied values of these coefficients of 2p piece and generator polynomials from values composed of register output and information symbols of new 2p pieces, then, uses them as input values to the next register. Since the coefficients of q
      j (x
      2p ) for the 2p symbols obtained from the register, are simultaneously obtained, multiplication of the coefficients and the generator polynomials can be simultaneously performed. The invention can apply to a circuit creating a parity in an be applied to the encoding apparatus.
      COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:使得关于编码的处理达到高速。 解决方案:组合电路253从(NK)步进寄存器251的较高级2p个符号逐个地获得q j (x 2p )的系数,减去 从2p的寄存器输出和信息符号组成的值乘以2p段和生成多项式的这些系数的乘积值,然后将它们作为下一个寄存器的输入值。 由于从寄存器获得的2p符号的q j (x 2p )的系数被同时获得,所以可以同时执行系数和生成多项式的乘法。 本发明可以应用于在编码装置中应用奇偶校验的电路。 版权所有(C)2010,JPO&INPIT
    • 8. 发明专利
    • Decoding apparatus
    • 解码设备
    • JP2008278184A
    • 2008-11-13
    • JP2007119090
    • 2007-04-27
    • Sony Corpソニー株式会社
    • SHINAGAWA HITOSHIYAMAGISHI HIROYUKINODA MAKOTO
    • H03M13/19
    • H03M13/1137H03M13/1111H03M13/6566
    • PROBLEM TO BE SOLVED: To execute decoding processing of LDPC (low density parity check) code at high speed with a simple configuration. SOLUTION: A storage section determining part 201 controls processing for determining a storage section of logarithmic likelihood ratios λ n or logarithmic posteriori probability radios q n in each of respective RAMs of this decoding apparatus. The storage section determined by the storage section determining part 201 is supplied to a control part 203 and stored in a memory, or the like in a controller. A decoding part 202 reads the logarithmic likelihood ratios λ n , or logarithmic posteriori probability radios q n in each of respective RAMs of this decoding apparatus, on the basis of the storage section determined by the storage section determining part 201 and controls processing for coding a received codeword. This invention is applicable to a decoding apparatus for decoding the LDPC code. COPYRIGHT: (C)2009,JPO&INPIT
    • 要解决的问题:以简单的配置高速执行LDPC(低密度奇偶校验)码的解码处理。 解决方案:存储部分确定部分201控制用于确定每个相应RAM中的对数似然比λ n 或对数后验概率无线电q n 的存储部分的处理 的解码装置。 由存储部确定部分201确定的存储部分被提供给控制部分203并存储在控制器中的存储器等中。 解码部分202基于存储部分读取该解码装置的每个RAM中的对数似然比λSB> n 或对数后验概率无线电q n 由存储部分确定部分201确定并且控制用于编码所接收的码字的处理。 本发明可应用于解码LDPC码的解码装置。 版权所有(C)2009,JPO&INPIT