公开(公告)号：US4413251A

公开(公告)日：1983-11-01

申请号：US283758

申请日：1981-07-16

申请人： Roy L. Adler ,  Martin Hassner ,  John P. Moussouris

发明人： Roy L. Adler ,  Martin Hassner ,  John P. Moussouris

IPC分类号： H03M7/14 ,  G06T9/00 ,  G11B20/14 ,  H04L25/49 ,  H03K13/00

CPC分类号： G06T9/005 ,  G11B20/1426

摘要： An algorithm and the hardware embodiment for producing a run length limited code useful in magnetic recording channels are described. The system described produces sequences which have a minimum of 1 zero and a maximum of 7 zeros between adjacent 1's. The code is generated by a sequential scheme that map 2 bits of unconstrained into 3 bits of constrained data. The encoder is a finite state machine whose internal state description requires 3 bits. It possesses the attractive feature of reset data blocks which reset it to a fixed state. The decoder requires a lookahead of two future channel symbols (6 bits) and its operation is channel state independent. The error propagation due to a random error is 5 bits. The hardware implementation is extremely simple and can operate at very high data speeds.

摘要翻译： 描述用于产生在磁记录通道中有用的游程长度有限代码的算法和硬件实施例。 所描述的系统产生在相邻1之间具有最少1个零和最多7​​个零的序列。 该代码由将无约束的2位映射到3位受约束数据的顺序方案生成。 编码器是一个有限状态机，其内部状态描述需要3位。 它具有复位数据块的有吸引力的特征，将其重置为固定状态。 解码器需要两个未来通道符号（6位）的前视，其操作是信道状态独立的。 由于随机误差引起的误差传播是5位。 硬件实现非常简单，可以在非常高的数据速度下运行。

公开(公告)号：US4609907A

公开(公告)日：1986-09-02

申请号：US666842

申请日：1984-10-31

申请人： Roy L. Adler ,  Peter A. Franaszek ,  Martin Hassner ,  Richard C. Schneider

发明人： Roy L. Adler ,  Peter A. Franaszek ,  Martin Hassner ,  Richard C. Schneider

IPC分类号： H03M7/14 ,  G06T9/00 ,  G11B20/14 ,  H03M5/14 ,  H03M13/23 ,  H04L25/497 ,  H03M1/12

CPC分类号： G11B20/1426 ,  G06T9/005

摘要： Method and apparatus is described for encoding and decoding a stream of randomly distributed binary bits representing digital data, including an encoder for encoding the bit stream to achieve a run length limited, partial response coding of the stream; a recording medium for recording the encoded stream; and a decoding system for recovering timing signals and a stream of data signals separately from the recorded stream using a first channel for decoding the recorded stream to recover a timing signal stream; therefrom; and a second channel for decoding the recorded stream to recover a stream of data signals therefrom.

摘要翻译： 描述了用于对表示数字数据的随机分布的二进制比特流进行编码和解码的方法和装置，包括用于编码比特流的编码器，以实现该流的游程长度有限的部分响应编码; 用于记录编码流的记录介质; 以及解码系统，用于使用用于对记录的流进行解码以恢复定时信号流的第一信道来从记录的流中分离地恢复定时信号和数据信号流; 由此; 以及用于解码所记录的流以从其恢复数据信号流的第二信道。

公开(公告)号：US4463344A

公开(公告)日：1984-07-31

申请号：US336478

申请日：1981-12-31

申请人： Roy L. Adler ,  Martin Hassner

发明人： Roy L. Adler ,  Martin Hassner

IPC分类号： H03M5/04 ,  G06F5/00 ,  G06T9/00 ,  G11B20/14 ,  H03M7/14 ,  H03M7/40 ,  H03K13/24

CPC分类号： H03M7/4025 ,  G06T9/005 ,  G11B20/1426

摘要： An algorithm and the hardware embodiment for producing a run length limited code useful in magnetic recording channels are described. The system described produces sequences which have a minimum of 2 zeros and a maximum of 7 zeros between adjacent 1's. The code is generated by a sequential scheme that maps 1 bit of unconstrained into 2 bits of constrained data. The encoder is a finite state machine whose internal state description requires 3 bits. It possesses the attractive feature of reset data blocks which reset it to a fixed state. The decoder requires a lookahead of three future channel symbols (6 bits) and its operation is channel state independent. The error propagation due to a random error is 3 bits. The hardware implementation is extremely simple and can operate at very high data speeds.

摘要翻译： 描述用于产生在磁记录通道中有用的游程长度有限代码的算法和硬件实施例。 所描述的系统产生具有最少2个零和相邻1之间最多7个零的序列。 代码由将1位无约束映射为2位受限数据的顺序方案生成。 编码器是一个有限状态机，其内部状态描述需要3位。 它具有复位数据块的有吸引力的特征，将其重置为固定状态。 解码器需要对未来三个通道符号（6位）进行前瞻，其操作是通道状态独立的。 由于随机误差引起的误差传播是3位。 硬件实现非常简单，可以在非常高的数据速度下运行。

公开(公告)号：US07653862B2

公开(公告)日：2010-01-26

申请号：US11154978

申请日：2005-06-15

申请人： Martin Hassner ,  Rajesh Koul

发明人： Martin Hassner ,  Rajesh Koul

IPC分类号： H03M13/00 ,  G11C29/00

CPC分类号： G06F11/1008 ,  G11B20/10527 ,  G11B20/1833 ,  G11B2020/10759 ,  G11B2220/2516 ,  H03M13/19

摘要： Embodiments of the present invention provide techniques for detecting and correcting encoded data. In one embodiment, a system for detecting and correcting errors in a plurality of data bits comprises a static memory configured to store a plurality of data bits; a systematic encoder configured to convert the plurality of data bits into a codeword; a systematic parity check encoder configured to convert the codeword into a syndrome; and a syndrome decoder configured to evaluate the syndrome based on preset criteria used to determine whether the syndrome corresponds to an uncorrectable error. A binary [16, 8, 5] code is used to encode the plurality of data bits.

摘要翻译： 本发明的实施例提供了用于检测和校正编码数据的技术。 在一个实施例中，用于检测和校正多个数据位中的错误的系统包括被配置为存储多个数据位的静态存储器; 被配置为将所述多个数据位转换成码字的系统编码器; 被配置为将所述码字转换为综合征的系统奇偶校验编码器; 以及校正器解码器，其被配置为基于用于确定所述综合征是否对应于不可校正误差的预设标准来评估所述综合征。 二进制[16,8,5]代码用于对多个数据位进行编码。

公开(公告)号：US20090254796A1

公开(公告)日：2009-10-08

申请号：US12099532

申请日：2008-04-08

申请人： Martin Hassner ,  Travis Roger Oenning ,  Richard Leo Galbraith

发明人： Martin Hassner ,  Travis Roger Oenning ,  Richard Leo Galbraith

IPC分类号： H03M13/00

CPC分类号： H03M13/455 ,  H03M13/1515 ,  H03M13/1525 ,  H03M13/154

摘要： A system corrects errors in a codeword. The system includes a channel that sorts reliability numbers of symbols in the codeword to create an ordered list of candidate erasure locations. The system also includes a generalized minimum distance decoder that iteratively processes the ordered list of candidate erasure locations and at least two syndromes of the codeword using a single-shot key equation solver to generate an error locator polynomial and an error evaluator polynomial. The generalized minimum distance decoder processes the least reliable candidate erasure locations first within the ordered list of candidate erasure locations.

摘要翻译： 系统校正码字中的错误。 该系统包括对码字中的符号的可靠性数量进行排序以创建候选擦除位置的有序列表的信道。 该系统还包括广义最小距离解码器，其使用单次密钥方程求解器迭代地处理候选擦除位置的有序列表和码字的至少两个校验子，以生成错误定位器多项式和误差评估器多项式。 广义最小距离解码器首先在候选擦除位置的有序列表中处理最不可靠的候选擦除位置。

公开(公告)号：US20090063938A1

公开(公告)日：2009-03-05

申请号：US12270737

申请日：2008-11-13

申请人： Martin Hassner ,  Kirk Hwang

发明人： Martin Hassner ,  Kirk Hwang

IPC分类号： H03M13/07 ,  G06F11/10

CPC分类号： H03M13/1525 ,  H03M13/1515

摘要： Systems and methods are provided for performing error correction decoding. The coefficients of the error locator polynomial are iteratively determined for each codeword using a modular implementation of a single recursion key-equation solver algorithm. According to this implementation, modules are used to calculate the current and previous coefficients of the error locator polynomial. One module is used for each correctable error. The modular single recursion implementation is programmable, because the number of modules can be easily changed to correct any number of correctable errors. Galois field tower arithmetic can be used to calculate the inverse of an error term. Galois field tower arithmetic greatly reduces the size of the inversion unit. The latency time can be reduced by placing the computations of the inverse error term outside the critical path of the error locator polynomial algorithm.

摘要翻译： 提供了用于执行纠错解码的系统和方法。 使用单个递归密钥方程求解算法的模块化实现，针对每个码字迭代确定误差定位多项式的系数。 根据该实现，使用模块来计算误差定位器多项式的当前系数和先前系数。 一个模块用于每个可纠正的错误。 模块化单递归实现是可编程的，因为可以轻松更改模块数量以更正任何数量的可纠正错误。 伽罗瓦域塔算术可用于计算误差项的倒数。 伽罗瓦域塔算术大大减小了反演单元的大小。 通过将反向误差项的计算置于误差定位多项式算法的关键路径之外，可以减少延迟时间。

公开(公告)号：US20070061688A1

公开(公告)日：2007-03-15

申请号：US11207474

申请日：2005-08-18

申请人： Martin Hassner ,  Kirk Hwang

发明人： Martin Hassner ,  Kirk Hwang

IPC分类号： H03M13/00

CPC分类号： H03M13/1525 ,  H03M13/1515

摘要： Systems and methods are provided for performing error correction decoding. The coefficients of the error locator polynomial are iteratively determined for each codeword using a modular implementation of a single recursion key-equation solver algorithm. According to this implementation, a plurality of modules are used to calculate the current and previous coefficients of the error locator polynomial. One module is used for each correctable error. The modular single recursion implementation is programmable, because the number of modules can be easily changed to correct any number of correctable errors. Galois field tower arithmetic can be used to calculate the inverse of an error term. Galois field tower arithmetic greatly reduces the size of the inversion unit. The latency time can be reduced by placing the computations of the inverse error term outside the critical path of the error locator polynomial algorithm.

摘要翻译： 提供了用于执行纠错解码的系统和方法。 使用单个递归密钥方程求解算法的模块化实现，针对每个码字迭代确定误差定位多项式的系数。 根据该实现，使用多个模块来计算误差定位多项式的当前系数和先前系数。 一个模块用于每个可纠正的错误。 模块化单递归实现是可编程的，因为可以轻松更改模块数量以更正任何数量的可纠正错误。 伽罗瓦域塔算术可用于计算误差项的倒数。 伽罗瓦域塔算术大大减小了反演单元的大小。 通过将反向误差项的计算置于误差定位多项式算法的关键路径之外，可以减少延迟时间。

公开(公告)号：US20060195769A1

公开(公告)日：2006-08-31

申请号：US11059734

申请日：2005-02-16

申请人： Martin Hassner ,  Christopher Dudley

发明人： Martin Hassner ,  Christopher Dudley

IPC分类号： H03M13/00

CPC分类号： H03M13/158 ,  G11B20/1833 ,  H03M13/151

摘要： To perform error detection and correction on a data sector, syndromes are calculated and used to determine error values and error locations. Logarithmic calculations in Galois field need to be performed to determine the error locations using the syndromes. Finite field vectors are represented as “complex” numbers of the form Az+B. An algorithm is performed using the field vectors represented as complex numbers to generate the error locations. The algorithm requires the use of logarithm calculations. The results of the logarithmic calculations are looked up in two (or more) log tables. The log tables store all the possible results of the logarithm calculations. The log tables store significantly less bits than prior art techniques, reducing the amount of storage space required by a factor of 171. Techniques for controlling accesses to the log tables in an efficient manner are also provided.

公开(公告)号：US07743311B2

公开(公告)日：2010-06-22

申请号：US11341230

申请日：2006-01-26

申请人： Martin Hassner ,  Kirk Hwang

发明人： Martin Hassner ,  Kirk Hwang

IPC分类号： H03M13/00

CPC分类号： G11B20/1833 ,  H03M13/158

摘要： A combined encoder/syndrome generator is provided that has a reduced delay. The combined encoder/syndrome generator generates check symbols during an encoding process and error syndromes during a decoding process. The combined encoder/syndrome generator has two or more blocks. The output of each block is fed as an input into a subsequent block. Each block can perform computations in parallel to reduce the delay of the encoding system.

摘要翻译： 提供了具有减少的延迟的组合编码器/校正子发生器。 组合的编码器/校正子发生器在解码过程期间在编码处理期间产生校验符号和错误综合征。 组合的编码器/校正子发生器具有两个或更多个块。 每个块的输出作为输入被馈送到随后的块中。 每个块可以并行执行计算，以减少编码系统的延迟。

公开(公告)号：US07467346B2

公开(公告)日：2008-12-16

申请号：US11207474

申请日：2005-08-18

申请人： Martin Hassner ,  Kirk Hwang

发明人： Martin Hassner ,  Kirk Hwang

IPC分类号： H03M13/00

CPC分类号： H03M13/1525 ,  H03M13/1515

摘要： Systems and methods are provided for performing error correction decoding. The coefficients of the error locator polynomial are iteratively determined for each codeword using a modular implementation of a single recursion key-equation solver algorithm. According to this implementation, a plurality of modules are used to calculate the current and previous coefficients of the error locator polynomial. One module is used for each correctable error. The modular single recursion implementation is programmable, because the number of modules can be easily changed to correct any number of correctable errors. Galois field tower arithmetic can be used to calculate the inverse of an error term. Galois field tower arithmetic greatly reduces the size of the inversion unit. The latency time can be reduced by placing the computations of the inverse error term outside the critical path of the error locator polynomial algorithm.

摘要翻译： 提供了用于执行纠错解码的系统和方法。 使用单个递归密钥方程求解算法的模块化实现，针对每个码字迭代确定误差定位多项式的系数。 根据该实现，使用多个模块来计算误差定位多项式的当前系数和先前系数。 一个模块用于每个可纠正的错误。 模块化单递归实现是可编程的，因为可以轻松更改模块数量以更正任何数量的可纠正错误。 伽罗瓦域塔算术可用于计算误差项的倒数。 伽罗瓦域塔算术大大减小了反演单元的大小。 通过将反向误差项的计算置于误差定位多项式算法的关键路径之外，可以减少延迟时间。