会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for deterministically altering cyclic redundancy check information for data storage
    • 用于确定性地改变用于数据存储的循环冗余校验信息的方法和装置
    • US06438724B1
    • 2002-08-20
    • US09270069
    • 1999-03-16
    • Charles Edwin CoxJames Lee HafnerMartin Aureliano HassnerRalph KoetterArvind Motibhai Patel
    • Charles Edwin CoxJames Lee HafnerMartin Aureliano HassnerRalph KoetterArvind Motibhai Patel
    • H03M1315
    • H03M13/093H03M13/1515H03M13/29H03M13/2903H03M13/2927
    • A method and apparatus for ensuring the integrity of data that can detect errors that remain when the data correction scheme fails to correct at least some of the errors, or has added additional errors. Reed-Solomon check symbols are used for error correction and cyclic redundancy check symbols are used to detect the remaining errors. The roots of the generator polynomials used to generate the Reed-Solomon check symbols and the cyclic redundancy check symbols meet a selected subset of a plurality of conditions. The roots are further selected so that the necessary exponentiation may be performed by a combination of exponentiations by powers of two and multiplications. The Reed-Solomon check symbols are generated based on the data portion of the data block. A deterministically altered data stream is generated based on the data portion of the data block and the cyclic redundancy check symbols are generated based on the deterministically altered data stream. The deterministically altered data stream is generated by performing an operation on a symbol of the data portion based on a position of the symbol within a Reed-Solomon codeword.
    • 一种用于确保数据完整性的方法和装置,其可以检测当数据校正方案无法校正至少一些错误时残留的数据,或者增加了额外的错误。 Reed-Solomon检查符号用于纠错,循环冗余校验符号用于检测剩余错误。 用于产生Reed-Solomon检查符号和循环冗余校验符号的生成多项式的根符合多个条件的选定子集。 进一步选择根,使得可以通过乘以幂的乘积的乘积的组合来执行必要的取幂。 基于数据块的数据部分生成Reed-Solomon检查符号。 基于数据块的数据部分生成确定性改变的数据流,并且基于确定性改变的数据流生成循环冗余校验符号。 基于Reed-Solomon码字中的符号的位置,对数据部分的符号执行操作来生成确定性改变的数据流。
    • 2. 发明授权
    • Method and apparatus for updating cyclic redundancy check information for data storage
    • 用于更新用于数据存储的循环冗余校验信息的方法和装置
    • US06446234B1
    • 2002-09-03
    • US09269000
    • 1999-03-16
    • Charles Edwin CoxJames Lee HafnerMartin Aureliano HassnerRalph KoetterArvind Motibhai Patel
    • Charles Edwin CoxJames Lee HafnerMartin Aureliano HassnerRalph KoetterArvind Motibhai Patel
    • H03M1315
    • H03M13/093H03M13/1515H03M13/29H03M13/2903H03M13/2927
    • A method and apparatus for ensuring the integrity of data that can detect errors that remain when the data correction scheme fails to correct at least some of the errors, or has added additional errors. Reed-Solomon check symbols are used for error correction and cyclic redundancy check symbols are used to detect the remaining errors. The roots of the generator polynomials used to generate the Reed-Solomon check symbols and the cyclic redundancy check symbols meet a selected subset of a plurality of conditions. The roots are further selected so that the necessary exponentiation may be performed by a combination of exponentiations by powers of two and multiplications. The Reed-Solomon check symbols are generated based on the data portion of the data block. A deterministically altered data stream is generated based on the data portion of the data block and the cyclic redundancy check symbols are generated based on the deterministically altered data stream. The deterministically altered data stream is generated by performing an operation on a symbol of the data portion based on a position of the symbol within a Reed-Solomon codeword.
    • 一种用于确保数据完整性的方法和装置,其可以检测当数据校正方案未能校正至少一些错误时残留的错误,或者增加了额外的错误。 Reed-Solomon检查符号用于纠错,循环冗余校验符号用于检测剩余错误。 用于产生Reed-Solomon检查符号和循环冗余校验符号的生成多项式的根符合多个条件的选定子集。 进一步选择根,使得可以通过乘以幂的乘积的乘积的组合来执行必要的取幂。 基于数据块的数据部分生成Reed-Solomon检查符号。 基于数据块的数据部分生成确定性改变的数据流,并且基于确定性改变的数据流生成循环冗余校验符号。 基于Reed-Solomon码字中的符号的位置,对数据部分的符号执行操作来生成确定性改变的数据流。
    • 5. 发明授权
    • Method and apparatus for efficient error detection and correction in long byte strings using generalized, integrated, interleaved reed-solomon codewords
    • 用于使用广义的,集成的,交错的簧片专用码字的长字节串中的有效误差检测和校正的方法和装置
    • US06275965B1
    • 2001-08-14
    • US09260717
    • 1999-03-01
    • Charles Edwin CoxMartin Aureliano HassnerArvind PatelBarry Marshall Trager
    • Charles Edwin CoxMartin Aureliano HassnerArvind PatelBarry Marshall Trager
    • H03M1329
    • G11B20/1833H03M13/1515H03M13/29H03M13/2903
    • A method and means for enhancing the error detection and correction capability obtained when a plurality of data byte strings are encoded in a two-level, block-formatted linear code using code word and block-level redundancy. This is accomplished by vector multiplication of N data byte vectors and a nonsingular invertible integration matrix with nonzero minors with order up to B to secure the necessary interleaving among N data byte vectors to form modified data byte vectors. The selected patterns of interleaving ensure single-pass, two-level linear block error correction coding when the modified data vectors are applied to an ECC encoding arrangement. The method and means are parameterized so as to either extend or reduce the number of bursty codewords or subblocks to which the block-level check bytes can be applied. Lastly, a post-encoding process is provided to “deinterleave” or redistribute the computed codewords into modified codewords such that the data vectors and their codeword check bytes are consistently located in the same codeword with the block-level check bytes are distributed among the first-level codewords.
    • 一种用于增强当使用代码字和块级冗余以两级块格式的线性代码编码多个数据字节串时获得的错误检测和校正能力的方法和装置。 这是通过N个数据字节向量和非奇异可逆积分矩阵与非零未成年人的向量乘法来实现的,阶数达到B以在N个数据字节向量之间保证必要的交织以形成修改的数据字节向量。 所选择的交织模式当将修改的数据向量应用于ECC编码装置时,确保单程,二级线性块纠错编码。 该方法和装置被参数化,以便扩展或减少可应用块级检查字节的突发码字或子块的数量。 最后,提供后编码处理以将所计算的码字“解交织”或重新分配为经修改的码字,使得数据向量及其码字校验字节一致地位于相同的码字中,其中块级校验字节分布在第一 级代码字。
    • 7. 发明授权
    • Parallelized programmable encoder/syndrome generator
    • 并联可编程编码器/综合发生器
    • US06405339B1
    • 2002-06-11
    • US09387665
    • 1999-08-31
    • Charles Edwin CoxMartin Aureliano Hassner
    • Charles Edwin CoxMartin Aureliano Hassner
    • G06F1110
    • H03M13/159
    • A composite encoder/syndrome generating device that both computes check symbols over counterpart data symbol strings to form codewords, and derives syndromes from codewords indicative of their error state. The multistage device provides recursive processing paths at each stage of depth corresponding to the number of symbols concurrently applied to the device. The device is adapted as an encoder when the feed-forward paths between stages are enabled; it is adapted as a syndrome generator upon their disablement. The number of symbols concurrently processed may be varied from clock cycle to clock cycle by conforming the recursion paths per stage to the number of symbols applied as input to the device.
    • 复合编码器/校正子生成装置,其通过对应数据符号串计算校验符号以形成码字,并且从表示其错误状态的码字导出校正子。 多级设备在与被同时应用于设备的符号数量相对应的深度的每个阶段提供递归处理路径。 当启动级之间的前馈路径时,该设备适用于编码器; 它被禁用后适应为综合征发生器。 通过将每个阶段的递归路径符合到作为输入到设备的输入的符号的数量,可以同时处理的符号的数目从时钟周期变化到时钟周期。
    • 8. 发明授权
    • RAM based key equation solver apparatus
    • 基于RAM的密钥方程求解器
    • US6023782A
    • 2000-02-08
    • US766681
    • 1996-12-13
    • Charles Edwin CoxMartin Aureliano Hassner
    • Charles Edwin CoxMartin Aureliano Hassner
    • H03M13/15H03M13/00
    • H03M13/158H03M13/1515
    • The present invention is a circuit for performing a computation of a plurality of coefficients of an error locator polynomial and a plurality of coefficients of an error evaluator polynomial in a system for correcting errors in a Reed-Solomon encoded datastream, comprising a syndrome generator outputting syndromes of the datastream. The circuit of the present invention is coupled to the syndrome generator and receives the syndromes. The present invention comprises an arithmetic unit iteratively generating intermediate and final values of the plurality of coefficients of an error locator polynomial and the plurality of coefficients of an error evaluator polynomial; a random access memory, storing the intermediate and final values of the plurality of coefficients of an error locator polynomial and the plurality of coefficients of an error evaluator polynomial; and a control unit, controlling the arithmetic unit and the memory and detecting when the computation of the plurality of coefficients of an error locator polynomial and the plurality of coefficients of an error evaluator polynomial has been completed.
    • 本发明是一种用于在Reed-Solomon编码数据流中用于校正错误的系统中执行误差定位多项式和多个系数的误差估计多项式的多个系数的计算的电路,其包括输出综合征 的数据流。 本发明的电路耦合到综合征发生器并接收综合征。 本发明包括一个运算单元,迭代地产生误差定位多项式的多个系数和误差估计器多项式的多个系数的中间值和最终值; 存储错误定位多项式的多个系数的中间值和最终值以及误差评估器多项式的多个系数的随机存取存储器; 以及控制单元,控制运算单元和存储器,以及何时完成误差定位多项式的多个系数的计算和误差评估多项式的​​多个系数的计算。
    • 9. 发明授权
    • Root solver and associated method for solving finite field polynomial equations
    • 求解有限域多项式方程的根解和相关方法
    • US06792569B2
    • 2004-09-14
    • US09842244
    • 2001-04-24
    • Charles Edwin CoxMartin Aureliano HassnerBarry Marshall TragerShmuel Winograd
    • Charles Edwin CoxMartin Aureliano HassnerBarry Marshall TragerShmuel Winograd
    • H03M1300
    • H03M13/1545H03M13/1515
    • An error correction algebraic decoder uses a key equation solver for calculating the roots of finite field polynomial equations of degree up to six, and lends itself to efficient hardware implementation and low latency direction calculation. The decoder generally uses a two-step process. The first step is the conversion of quintic equations into sextic equations, and the second step is the adoption of an invertible Tschirnhausen transformation to reduce the sextic equations by eliminating the degree 5 term. The application of the Tschirnhausen transformation considerably decreases the complexity of the operations required in the transformation of the polynomial equation into a matrix. The second step defines a specific Gaussian elimination that separates the problem of solving quintic and sextic polynomial equations into a simpler problem of finding roots of a quadratic equation and a quartic equation.
    • 纠错代数解码器使用密钥方程求解器来计算六个有限域多项式方程的根,并适用于有效的硬件实现和低延迟方向计算。 解码器通常采用两步法。 第一步是将五次方程转换为性别方程,第二步是采用可逆的Tschirnhausen变换,通过消除5度项来减少性别方程。 Tschirnhausen变换的应用大大降低了将多项式方程转换为矩阵所需的操作的复杂性。 第二步定义了一个特定的高斯消除,将解决五元和多项式多项式方程的问题分解成找到二次方程和四次方程的根的一个更简单的问题。