会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Multiple error detecting and correcting system employing Reed-Solomon
codes
    • 使用Reed-Solomon码的多重错误检测和校正系统
    • US4413339A
    • 1983-11-01
    • US277060
    • 1981-06-24
    • Charles M. RiggleLih-Jyh WengNorman A. Field
    • Charles M. RiggleLih-Jyh WengNorman A. Field
    • H03M13/15G06F11/12
    • H03M13/151
    • An error detecting and correcting system implementing the Reed-Solomon (1023, 1006) code having code words whose symbols are elements in the Galois field GF(2.sup.10) generated by either the primitive polynomial x.sup.10 +x.sup.3 +1 or x.sup.10 +x.sup.7 +1. An original data word is encoded to produce a code word w(x) including a first set of checksum symbols appended thereto. Upon retrieval, the data symbols of the receive code word y(x) are encoded by the same encoder that encodes the original data word to produce a second set of checksum symbols. Both sets of checksum symbols are modulo-two summed to produce a residue R(x) from which error syndromes S.sub.i can be computed and thus enable rapid correction of errors in the received code word y(x). The system also monitors the number of non-zero symbols in the residue R(x) in order to avoid unnecessary computation of error syndromes S.sub.i and other decoding routines, such as when the received code word y(x) is otherwise uncorrectable or when the error exists only in the received checksum symbols, rather than in the data symbols. The distance between code words being (2T+ 2), the error correction routine is bypassed when the number of non-zero symbols in R(x) is less than or equal to T, which indicates that errors only reside in the checksum symbols. When the number of non-zero symbols equals (T+1), the error is uncorrectable. For determining whether a single error exists so that correction can quickly be made, the system also tests whether S.sub.i+1 /S.sub.i is constant for all error syndromes S.sub.i.
    • 实现具有代码字的Reed-Solomon(1023,1006)代码的错误检测和校正系统,其码元是由原始多项式x10 + x3 + 1或x10 + x7 + 1产生的伽罗瓦域GF(210)中的元素。 原始数据字被编码以产生包括附加到其上的第一组校验和符号的码字w(x)。 在检索时,接收码字y(x)的数据符号由编码原始数据字的相同编码器编码,以产生第二组校验和符号。 两组校验和符号被模二相加以产生残差R(x),从中可以计算出错误综合征Si,从而能够快速校正接收到的代码字y(x)中的错误。 该系统还监视残差R(x)中的非零符号的数目,以避免误差综合征Si和其他解码程序的不必要的计算,例如当接收到的代码字y(x)不可校正时或当 错误仅存在于接收到的校验和符号中,而不是数据符号中。 当R(x)中的非零符号数小于或等于T时,代码字之间的距离为(2T + 2),纠错程序被旁路,这表示错误仅驻留在校验和符号中。 当非零符号的数量等于(T + 1)时,该错误是不可校正的。 为了确定是否存在单一误差以便能够快速进行校正,系统还测试Si + 1 / Si对于所有误差综合征Si是否恒定。
    • 4. 发明授权
    • Method and apparatus for protecting data from mis-synchronization errors
    • 用于保护数据免于错误同步错误的方法和装置
    • US5528607A
    • 1996-06-18
    • US383201
    • 1995-02-02
    • Lih-Jyh WengBruce LeshayDiana Langer
    • Lih-Jyh WengBruce LeshayDiana Langer
    • G11B20/18H03M13/33H03M13/00
    • H03M13/33G11B20/1833
    • An encoder in a data processing system generates, from a single m-bit coset leader constant, or symbol, a coset leader, which is a series of k m-bit symbols that resembles a random sequence of km bits. The encoder encodes the m-bit initial coset leader constant in a linear feedback shift register that is characterized by a maximum length polynomial over GF(2). The constants are produced by the register at the same times as the error correction symbols are produced by the encoder. The corresponding constants and symbols are then XOR'd together before the symbols are concatenated with the data symbols to form a code word for recording. A decoder similarly generates the coset leader from the initial constant. The decoder XOR's these constants with the error correction symbols in a retrieved code word as part of a demodulation operation. If the head was in synchronism with the stored information during a read operation, XOR'ing the k coset leader constants with the error correction symbols of the retrieved code word removes the coset leader from these symbols, and thus, reproduces the original error correction symbols. Otherwise, the XOR operation combines the coset leader with a shifted version of itself and introduces into the retrieved code word a number of errors that exceeds the error correction capability of the error correction code used to encode the data. In the preferred embodiment, the linear feedback shift register is characterized by the maximum length polynomial X.sup.9 +X.sup.8 +X.sup.7 +X.sup.3 +X.sup.2 +1 over GF(2), and the m-bit initial coset leader constant is 100001011.
    • 数据处理系统中的编码器从单个m位陪集前导常量或符号生成陪集首领,该陪集首领是类似于km比特的随机序列的一系列k个m比特符号。 编码器对在GF(2)上的最大长度多项式表征的线性反馈移位寄存器中的m位初始陪集前导常数进行编码。 常数由寄存器在与编码器产生的纠错符号相同的时间产生。 在符号与数据符号连接之前,对应的常数和符号在一起XOR'd以形成用于记录的码字。 解码器类似地从初始常数生成陪集前导。 解码器XOR的这些常数与检索的码字中的纠错符号作为解调操作的一部分。 如果在读取操作期间头部与存储的信息同步,则使用所检索的代码字的纠错符号对k陪集前导符常数进行异或,从这些符号中移除陪集前导符,从而再现原始错误校正符号 。 否则,XOR操作将陪集前导码与其自身的移位版本相结合,并将检索到的码字引入超过用于对数据进行编码的纠错码的纠错能力的多个错误。 在优选实施例中,线性反馈移位寄存器的特征在于GF(2)上的最大长度多项式X9 + X8 + X7 + X3 + X2 + 1,并且m位初始陪集引导常数为100001011。
    • 5. 发明授权
    • Synchronization to different fields in a storage device
    • 同步到存储设备中的不同字段
    • US5365382A
    • 1994-11-15
    • US064286
    • 1993-05-18
    • Lih-Jyh WengMichael E. KastnerBruce Leshay
    • Lih-Jyh WengMichael E. KastnerBruce Leshay
    • G11B20/14G11B27/30G11B5/09
    • G11B20/1426G11B27/3027
    • A method and apparatus for identifying and synchronizing to two different fields in a disk drive employs different synchronization or "sync" patterns to reduce the chances of mis-identifying and false-identifying a field. Two very distinct synchronization patterns have been found that satisfy the d=1, k=7 run-length constraints of a data code used in the disk drive. During operation, one sync pattern is searched for to identify and synchronize to its associated field, then the field itself is read. This procedure is then repeated for the other sync pattern and its associated field. Also, the phase of a preamble preceding each sync character is established, so that the number of comparisons needed to find either sync character is reduced. A sync detector operates on cell pairs, and has a selector that selects which sync pattern to search for. The sync detector also has special features that enable it to find preamble and DC Erase fields in the disk cell stream.
    • 用于识别和同步到磁盘驱动器中的两个不同字段的方法和装置采用不同的同步或“同步”模式,以减少错误识别和伪识别字段的机会。 已经发现两种非常不同的同步模式满足磁盘驱动器中使用的数据码的d = 1,k = 7游程长度限制。 在操作期间,搜索一个同步模式以识别并同步到其相关联的字段,然后读取字段本身。 然后对其他同步模式及其相关字段重复该过程。 此外,在每个同步字符之前的前导码的相位被建立,使得找到同步字符所需的比较的数量减少。 同步检测器对单元对进行操作,并且具有选择器来选择要搜索的同步模式。 同步检测器还具有使其能够在磁盘单元流中找到前导码和直流擦除字段的特殊功能。
    • 6. 发明授权
    • System and method for performing a Chien search using multiple Galois field elements
    • US06581180B1
    • 2003-06-17
    • US09527736
    • 2000-03-17
    • Lih-Jyh Weng
    • Lih-Jyh Weng
    • H03M1300
    • H03M13/1545H03M13/158
    • A system for performing a Chien search simultaneously tests multiple elements of GF(2P) as possible roots of a degree-t error locator polynomial &sgr;(x) using a plurality of simplified multipliers that each simultaneously produce the corresponding terms of &sgr;(x). In one embodiment of the system, t−1 simplified multipliers over GF(2P) are used to simultaneously test as possible roots &agr;2, (&agr;2)2, (&agr;2)3 . . . (&agr;2)j. Each multiplier includes a plurality of adders that are set up in accordance with precomputed terms that are based on combinations of the weight-one elements of GF(2P). A summing circuit adds together the associated terms produced by the multipliers and produces j sums, which are then evaluated to test the j individual elements as possible roots. The coefficients of &sgr;(&agr;2)j are then fed back to the multipliers, and the multipliers test, during a next clock cycle, the elements &agr;2*(&agr;2)j, (&agr;2)2*(&agr;2)j . . . , (&agr;2)2j and so forth. Similar multipliers also test the odd powers of &agr; as roots of &sgr;′(x)=&sgr;(&agr;x). If P=mn the system may be implemented using a plurality of GF(2m) multipliers. The field GF(2m) is a subfield of GF(2P), and the elements of GF(2P) can each be represented by a combination of n elements of GF(2m). The error locator polynomial &sgr;(x) can thus be represented by a combination of n expressions &sgr;0(x), &sgr;2(x) . . . &sgr;n−1(x), each with coefficients that are elements of GF(2m). Each of the n expressions has 2m−1 coefficients for the terms x0, x1, x2 . . . x2m−1. Thus, n(2m−2) constant GF(2m) multipliers are used to test each element of GF(2P) as a possible root. The number of GF(2m) multipliers in the system is independent of the degree of the error locator polynomial, and each multiplier operates over a subfield of GF(2P). Accordingly, the system can simultaneously tests j elements using j sets of n(2m−2) constant multipliers over GF(2m).
    • 7. 发明授权
    • Pipelined combined system for producing error correction code symbols and error syndromes for large ECC redundancy
    • 流水线组合系统,用于产生用于大ECC冗余的纠错码符号和错误综合征
    • US06226772B1
    • 2001-05-01
    • US09187144
    • 1998-11-06
    • Lih-Jyh WengDiana Langer
    • Lih-Jyh WengDiana Langer
    • H03M1300
    • H03M13/1555H03M13/158
    • An n-stage pipelined combined encoder and syndrome generator system includes n stages that are essentially identical. Each of the stages includes two associated delay circuits, namely, a first delay circuit in a chain of feedback adders that operate as a feedback path during encoding, and a second delay circuit in a data input line. During encoding operations, the delay circuits in the feedback adder chain segment the chain of j feedback adders into n stages of j/n adders, and the delay circuits in the data input line delay the data symbols by the latencies associated with the respective stages. The delay circuits thus simultaneously provide to the various stages the corresponding data symbols and propagating sums. After the last data symbol is encoded, the ECC symbols are available after a time lag associated with the j/n adders in the last stage. During syndrome generation operations, the feedback adders are essentially decoupled from one another by AND gates that are included in the feedback path and switches in the data input line bypass the delay circuits, to avoid introducing latency into the syndrome generation operations.
    • n级流水线组合编码器和综合征发生器系统包括基本相同的n个阶段。 每个级包括两个相关联的延迟电路,即,在编码期间作为反馈路径工作的反馈加法器链中的第一延迟电路,以及数据输入线中的第二延迟电路。 在编码操作期间,反馈加法器链中的延迟电路将j个反馈加法器链分段成j个加法器的n个级,并且数据输入行中的延迟电路通过与各个级相关联的延迟来延迟数据符号。 因此,延迟电路同时向各个阶段提供对应的数据符号和传播和。 在最后一个数据符号被编码之后,ECC符号在与最后阶段中的j / n加法器相关联的时滞之后可用。 在校正子发生操作期间,反馈加法器基本上通过包括在反馈路径中的AND门和数据输入线中的开关绕过延迟电路彼此解耦,以避免将延迟引入到校正子生成操作中。
    • 8. 发明授权
    • ECC system supporting different-length Reed-Solomon codes whose
generator polynomials have common roots
    • ECC系统支持不同长度的里德 - 所罗门码,其生成多项式具有共同的根
    • US5768296A
    • 1998-06-16
    • US761689
    • 1996-12-06
    • Diana LangerMichael LeisCecil MacgregorLih-Jyh Weng
    • Diana LangerMichael LeisCecil MacgregorLih-Jyh Weng
    • H03M13/15H03M13/35H03M13/00
    • H03M13/6516H03M13/151H03M13/35
    • A Reed-Solomon error-correction coding (ECC) scheme selectively supports two different-length codes to optimize the trade-off between error performance and the amount of disk space required to store protection symbols. The encoder contains two sets of alpha multipliers; part of one set is multiplexed with the other depending on which code is being used. Also, a shift register within the encoder is selectively lengthened or shortened depending on the code. The code pair is selected so that the generator polynomial of the shorter code is a complete divisor of the generator polynomial of the longer code. Thus, one code is a sub-code of the other. Accordingly, the ECC system is able to use the same syndrome calculator for each code. The error-correction decoder uses those syndromes that correspond to the roots of the generator polynomial of the code being used.
    • Reed-Solomon纠错编码(ECC)方案选择性地支持两个不同长度的代码来优化误差性能与存储保护符号所需的磁盘空间量之间的权衡。 编码器包含两组α乘数; 根据正在使用的代码,一组的一部分与另一组复用。 此外,根据代码,编码器内的移位寄存器被选择性地延长或缩短。 选择代码对,使得较短代码的生成多项式是较长代码的生成多项式的完全除数。 因此,一个代码是另一个的子代码。 因此,ECC系统能够对每个代码使用相同的校正子计算器。 纠错解码器使用与所使用代码的生成多项式的根相对应的那些校正子。
    • 9. 发明授权
    • Error-resilient information encoding
    • 错误恢复信息编码
    • US5237574A
    • 1993-08-17
    • US808035
    • 1991-12-11
    • Lih-Jyh Weng
    • Lih-Jyh Weng
    • G11B20/18H03M13/29
    • G11B20/1883G11B20/1813H03M13/29G11B2220/20
    • A method for determining whether particular information was used in encoding a codeword; the codeword is formed by encoding information as a first preliminary code sequence using a first code and then combining the first preliminary code sequence with a second preliminary code sequence generated using a second code; the particular information is encoded as a desired first preliminary code sequence in accordance with said first code; the desired first preliminary code sequence is then stripped from the codeword to derive a test sequence; the test sequence is decoded in accordance with the second code, and a determination is made, based on the decoding, whether the particular information was used in encoding the codeword. In another aspect, bad sector, servo correction, and sector address values are encoded for storage in a header associated with a sector of storage on a storage medium by encoding the address value with leading zero symbols in accordance with a code having a first rate, encoding the bad sector and servo correction values in a systematic code having a second rate, and combining these sequences to generate a codeword of the first code such that the bad sector and servo correction values appear explicitly in the codeword.
    • 一种用于确定在编码码字时是否使用特定信息的方法; 通过使用第一码将信息编码为第一初步码序列,然后将第一初步码序列与使用第二码产生的第二初步码序列组合来形成码字; 所述特定信息根据所述第一代码被编码为期望的第一初步代码序列; 然后从码字中去除期望的第一初步码序列以导出测试序列; 根据第二代码对测试序列进行解码,并且基于解码来确定特定信息是否用于编码码字。 在另一方面,通过根据具有第一速率的代码对具有前导零符号的地址值进行编码,将坏扇区,伺服校正和扇区地址值编码为用于存储在与存储介质上的存储扇区相关联的报头中, 对具有第二速率的系统代码中的坏扇区和伺服校正值进行编码,并组合这些序列以生成第一代码的码字,使得坏扇区和伺服校正值明显地出现在码字中。