会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明专利
    • Method of determining computer of erasure correction for error correction code entity
    • 确定用于错误修正代码实体的擦除校正计算机的方法
    • JP2009295273A
    • 2009-12-17
    • JP2009210860
    • 2009-09-11
    • Quantum Corpクウォンタム・コーポレイションQuantum Corporation
    • WENG LIH-JYHHALL DANA
    • G06F11/10G11B20/10G11B20/18H03M13/15H03M13/29
    • H03M13/2909H03M13/151H03M13/1515
    • PROBLEM TO BE SOLVED: To provide a method of determining an error value, concerning a long burst error correction, also known as an erasure correction, and a lost data correction.
      SOLUTION: The method of determining an error value includes: a step of loading an error correction code (ECC) entity having a line indicating a data symbol; a step of determining an error position with respect to a first line; a step of generating an error syndrome with respect to the first line; a step of determining an erasure constant from the error position; a step of determining the error position with respect to each of the rest of lines; a step of generating the error syndrome with respect to each of the rest of lines; and a step of determining the error value with respect to each line from the corresponding error position and the corresponding error syndrome and the constant.
      COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:提供一种确定误差值的方法,涉及长串扰纠错(也称为消失校正)和丢失数据校正。 解决方案:确定误差值的方法包括:加载具有指示数据符号的行的纠错码(ECC)实体的步骤; 确定相对于第一行的错误位置的步骤; 产生相对于第一行的错误综合征的步骤; 从错误位置确定擦除常数的步骤; 确定相对于每个其余行的错误位置的步骤; 相对于其余行中产生误差综合征的步骤; 以及从相应的错误位置和相应的误差综合征和常数确定相对于每条线的误差值的步骤。 版权所有(C)2010,JPO&INPIT
    • 9. 发明专利
    • Method for encoding and decoding code word of data to be written in medium
    • 编码和解码数据代码字在中文上的方法
    • JP2008204593A
    • 2008-09-04
    • JP2007339489
    • 2007-12-28
    • Quantum Corpクウォンタム・コーポレイションQuantum Corporation
    • FELLER MARC
    • G11B20/14H03M7/14
    • G11B20/1426G11B2220/2516
    • PROBLEM TO BE SOLVED: To provide a method, equipment, and a system directed to run-lengthlimited (RLL) encoding of data.
      SOLUTION: In an embodiment, concatenatable RLL codes with run lengths of zero not exceeding (k) are constructed for any rate N(N+1). As code rates increase, the value of (k) departs from the minimum possible value more slowly than that of many other codes. Further, occurrences of k-bit run lengths occur only at the juncture of two codewords. Due to this property, the codes become ideal for parity bit insertion application such as LDPC channels. In one implementation, the bit address of violating sequences in a table is arranged at the beginning of the codeword, and the user data occupying the locations where the table entries are placed are moved into the locations of the violating sequences. This is done repeatedly, and this is done in a way which provides for cases that the violating sequence is inside the address table itself.
      COPYRIGHT: (C)2008,JPO&INPIT
    • 要解决的问题:提供一种方法,设备和针对数据的长度限制(RLL)编码的系统。 解决方案:在一个实施例中,对于任何速率N(N + 1)构建游程长度为零不超过(k)的可连接的RLL码。 随着码率的增加,(k)的值比许多其他码更慢的最小可能值。 此外,k位运行长度的出现仅在两个码字的接合处发生。 由于该特性,代码成为诸如LDPC信道之类的奇偶校验位插入应用的理想选择。 在一个实现中,表中的违规序列的位地址被排列在码字的开始处,并且占据表条目所在位置的用户数据被移动到违规序列的位置。 这是重复完成的,这是通过一种方式来完成的,这种方式可以提供违反序列在地址表本身内的情况。 版权所有(C)2008,JPO&INPIT