会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • High speed pre-computing circuit and method for finding the error-locator polynomial roots in a Reed-Solomon decoder
    • 用于在Reed-Solomon解码器中找到误差定位多项式根的高速预计算电路和方法
    • US06691277B1
    • 2004-02-10
    • US09190149
    • 1998-11-12
    • Habibollah GolnabiInderpal Deol
    • Habibollah GolnabiInderpal Deol
    • H03M1315
    • H03M13/1555H03M13/1515H03M13/155H03M13/158
    • A system and method used in a Reed-Solomon (RS) decoder for determining roots of error locator polynomials in which a first pre-computation operation is performed to obtain a p-bit polynomial solution value in a first clock cycle and second parallel feedback logical operations are performed to obtain a p-bit polynomial solution value in each subsequent clock cycles. The system excludes constant Galois Field multipliers from the critical timing path of the system so as to facilitate high speed error-locator polynomial root determination. In the case of an unshortened RS(m,d) decoder defined over the Galois Field GF(2p) where GF(2p) is a finite field of 2p elements and m=2p−1, final root location values are obtained in m cycles. In the case of a shortened RS(n,d) decoder defined over the Galois Field GF(2p) where GF(2p) is a finite field of 2p elements and m=2p−1 and n
    • 一种用于确定误差定位多项式的根的Reed-Solomon(RS)解码器的系统和方法,其中执行第一预计算操作以获得第一时钟周期中的p位多项式解值并且第二并行反馈逻辑 执行操作以在每个后续时钟周期中获得p位多项式解值。 该系统从系统的临界定时路径中排除恒定的伽罗瓦域乘法器,以便于高速误差定位多项式根确定。 在Galois Field GF(2))上定义的未经驱动的RS(m,d)解码器的情况下,其中GF(2)是2个元素的有限域,m = 2

      -1,最终根位置值以m个周期获得。 在Galois Field GF(2)上定义的缩短的RS(n,d)解码器的情况下,其中GF(2)是2个元素的有限域,m = 2

      -1和n

    • 92. 发明授权
    • Galios field processor having dual parallel data path for Bose Chaudhuri Hocquenghem/Reed-Solomon decoder
    • 用于Bose Chaudhuri Hocquenghem / Reed-Solomon解码器的具有双并行数据路径的Galios现场处理器
    • US06574771B1
    • 2003-06-03
    • US09528676
    • 2000-03-20
    • Hyung-joon Kwon
    • Hyung-joon Kwon
    • H03M1300
    • H03M13/6561H03M13/15H03M13/153H03M13/1555H03M13/158
    • A Galois field processor having a dual parallel data path for a Bose Chaudhuri Hocquenghem/Reed-Solomon (BCH/RS) decoder is provided. The Galois field processor includes a syndrome register block for storing syndrome values transmitted by a syndrome generating block, a correction polynomial register block, a connection polynomial register block, and a discrepancy register block. A dual mode Galois field data path (DMGFDP) includes a first data path for receiving the respective outputs of the syndrome register block, the correction polynomial register block, the connection polynomial register block, and the discrepancy register block, performing predetermined operations related to the even-degree coefficients of correction and connection polynomial, and outputting the even-degree coefficient output. A second data path performs predetermined operations related to the odd-degree coefficients of the correction and connection polynomial and outputs the odd-degree coefficient output. A delta output unit performs predetermined operations related to the even-degree and the odd-degree coefficients of the connections polynomial and outputs the delta output. An output unit outputs the coefficients of an error location polynomial, according to a control signal. Since the Galois processor, in which latency during the operation processes is minimized, has a small area and operates at high speed, the performance of the decoder is greatly improved.
    • 提供了一种具有用于Bose Chaudhuri Hocquenghem / Reed-Solomon(BCH / RS)解码器的双平行数据路径的Galois场处理器。 伽罗瓦域处理器包括用于存储由校正子生成块,校正多项式寄存器块,连接多项式寄存器块和差异寄存器块发送的校正子值的校正子寄存器块。 双模式伽罗瓦域数据路径(DMGFDP)包括用于接收校正子寄存器块,校正多项式寄存器块,连接多项式寄存器块和差异寄存器块的相应输出的第一数据路径,执行与 校正和连接多项式的偶数系数,并输出偶数系数输出。 第二数据路径执行与校正连接多项式的奇数系数相关的预定操作,并输出奇数系数输出。 增量输出单元执行与连接多项式的偶数和奇数系数相关的预定操作并输出增量输出。 输出单元根据控制信号输出误差位置多项式的系数。 由于在操作过程中的延迟被最小化的Galois处理器具有小面积并且以高速操作,因此大大提高了解码器的性能。
    • 95. 发明授权
    • Pipelined high speed reed-solomon error/erasure decoder
    • 流水线高速专用独奏错误/擦除解码器
    • US06347389B1
    • 2002-02-12
    • US09274406
    • 1999-03-23
    • Keith G. Boyer
    • Keith G. Boyer
    • H03M1315
    • H03M13/1555H03M13/1515H03M13/154
    • The pipelined high speed Reed-Solomon error/erasure decoder processes multiple code words in a pipelined fashion. The pipelined high speed Reed-Solomon error/erasure decoder is designed to process Reed-Solomon encoded words that have been corrupted in a digital system by processing errors as well as erasures through a simple iterative modified syndrome process. The iterative nature of this method provides for limited computational effort at each step of the pipeline. This allows the pipelined high speed Reed-Solomon error/erasure decoder to easily handle full or shortened Reed-Solomon codes, as well as parallel processing to achieve higher data rates. The iterative modified syndrome process is one of the pipelined steps. It relieves the erasure pre-shifting burden from the Berlekamp/Massey synthesis process, which reduces the number of cycles required at that stage of processing. The decoder proceeds classically with a Chien Search for any remaining error locations. This approach allows the pipelined high speed Reed-Solomon error/erasure decoder to relay early information on all error locations. The final stage of the decoding process is a parallel, iterative solution to Forney's equation for the calculation of the error magnitudes.
    • 流水线高速Reed-Solomon错误/擦除解码器以流水线方式处理多个代码字。 流水线高速里德 - 所罗门错误/擦除解码器旨在通过处理错误以及通过简单的迭代修改综合征过程进行擦除来处理在数字系统中损坏的里德 - 所罗门编码的字。 该方法的迭代性质在流水线的每个步骤提供有限的计算工作。 这允许流水线高速里德 - 所罗门错误/擦除解码器轻松处理完整或缩短的里德 - 所罗门码,以及并行处理以实现更高的数据速率。 迭代修正综合征过程是流水线步骤之一。 它可以减轻Berlekamp / Massey合成过程中的擦除预先转移负担,从而减少了处理阶段所需的周期数。 解码器通过Chien搜索经历了任何剩余的错误位置。 这种方法允许流水线高速里德 - 所罗门错误/擦除解码器在所有错误位置上传递早期信息。 解码过程的最后阶段是用于计算误差幅度的Forney方程的并行迭代解。
    • 98. 发明公开
    • INTRA-DECODER COMPONENT BLOCK MESSAGING
    • INTRA-解码器组件BLOCK电信
    • EP1468499A4
    • 2005-12-14
    • EP03732044
    • 2003-01-22
    • THOMSON LICENSING
    • LITWIN JR LOUIS ROBERTVELEZ DIDIER
    • G06F11/10G11B20/18H03M13/15H03M13/29H04L1/00
    • G11B20/1803G11B20/10296H03M13/1515H03M13/1555
    • A decoder and decoding method are described, in which a syndrome is calculated from a codeword in a syndrome generator (410), an error polynomial is generated based upon the syndrome in an error polynomial generator (420), an error location is determined from the error polynomial in the error location generator (430), an error magnitude is calculated from the error polynomial in the error magnitude generator (440) and the codeword is corrected by a error corrected codeword generator (450) responsive to location and error magnitude. An intra?decoder block messaging scheme is described in which one or more components (410, 420, 430, 440, 450) generate inactivity messages (640, 650) to signal an ability to process data corresponding to a next codeword. A dual Chien search block (930, 940) implementation is described in which Chien block (930) is used to determine the number of errors corresponding to a specified codeword, separately from error location and magnitude calculations performed by the Chien/Forney block (940). An enhanced Chien search cell architecture is described which utilizes an additional Galois field adder (1140) to synchronize the codeword and error vector, thereby decreasing delay and expense corresponding to an error correcting block (950) implemented with a LIFO register (952).