专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5373513A Shift correction code system for correcting additive errors and synchronization slips 失效
标题翻译：用于校正加法误差和同步滑移的移位校正码系统
公开(公告)号：US5373513A
公开(公告)日：1994-12-13
申请号：US745788
申请日：1991-08-16
申请人： Dennis G. Howe , Hugh M. Hilden , Edward J. Weldon, Jr.
发明人： Dennis G. Howe , Hugh M. Hilden , Edward J. Weldon, Jr.
IPC分类号： G11B20/14 , G11B20/18 , H03M13/31 , H03M13/33 , G06F11/00 , H03M13/00 , H04L1/00
CPC分类号： G11B20/1833 , G11B20/1426 , H03M13/31 , H03M13/33
摘要： In a shift correction decoder which processes d,k-constrained RLL data that is encoded in accordance with a shift correction code whose symbols in GF(p) comprise modulo p reductions of cumulative sums of successive run symbols of the RLL data (where p is an odd prime), additive errors (i.e., drop-out and drop-in errors) in the received RLL data are corrected by relying in part on information pertaining to the sequence of the polarities of successive 1-bits in the received RLL data. The polarity information is used to either insert missing 1-bits (due to drop-outs) or delete spurious 1-bits (due to drop-ins) and specify to the shift correction decoder the location of an additive error as an erasure. Synchronization slips are corrected by pre-multiplying the received codeword polynomial by a factor which reduces to two the number of errors created by a single synchronization slip. GF(p) is selected such that p.ltoreq.k-d+ 1 and the minimum distance of the shift correction code is selected to be sufficient to enable correction of a limited number of shift errors, additive errors and synchronization slips within one received codeword.
摘要翻译：在移位校正解码器中，处理按照GF（p）中的符号包括RLL数据的连续运行符号的累积和的模p减少的移位校正码编码的d，k约束RLL数据（其中p是奇数素数），接收的RLL数据中的加法误差（即，丢失和插入误差）通过部分地依赖于与所接收的RLL数据中的连续1位的极性的序列有关的信息来校正。极性信息用于插入丢失的1位（由于丢弃）或删除寄存1位（由于插入），并将移位校正解码器指定加法误差的位置作为擦除。通过将接收到的码字多项式预乘以由单个同步滑差产生的误差数量减少到两倍的因子来校正同步滑移。选择GF（p）使得p <= k-d + 1，并且选择移位校正码的最小距离足以使得能够修正一个接收码字内的有限数量的移位误差，加法误差和同步块。

2. 发明授权

US5257270A Shift-correction code rate-enhancing parity encoding/decoding 失效
标题翻译：移码校正码率增强奇偶编码/解码
公开(公告)号：US5257270A
公开(公告)日：1993-10-26
申请号：US633879
申请日：1990-12-26
申请人： Hugh M. Hilden , Dennis G. Howe , Edward J. Weldon, Jr.
发明人： Hugh M. Hilden , Dennis G. Howe , Edward J. Weldon, Jr.
IPC分类号： H03M5/14 , H03M5/16 , H03M13/31 , H03M13/00 , H03M7/46
CPC分类号： H03M5/145 , H03M13/31 , H03M5/16
摘要： A method for coding/decoding ternary symbols to d,k-constrained binary runs in a way that (i) associates (codes) a number of ternary symbols with a lesser number of d,k-constrained binary runs and (ii) provides that an individual single-shift error in any of the received binary runs that constitute a binary data codeword will cause at most one ternary symbol to be in error in the associated (decoded) ternary symbol codeword. This method allows shift-correction codeword parity checks to be transmitted (i.e., transformed to a d,k-constrained channel data sequence) with increased efficiency, so that the required number of channel bits needed to represent the parity checks is decreased.
摘要翻译：一种将三进制符号编码/解码为d，k-约束二进制运行的方法，其方式是（i）将多个三进制符号与少量的d，k-约束二进制运行相关联（代码），并且（ii）构成二进制数据码字的任何接收到的二进制运行中的单个单次错误将导致至少一个三进制符号在相关联的（解码的）三进制符号码字中是错误的。该方法允许移位校正码字奇偶校验以增加的效率被发送（即，变换为d，k约束信道数据序列），从而减少表示奇偶校验检查所需的所需数量的信道位。

3. 发明授权

US5220568A Shift correcting code for channel encoded data 失效
标题翻译：通道编码数据的移位校正码
公开(公告)号：US5220568A
公开(公告)日：1993-06-15
申请号：US433877
申请日：1989-11-09
申请人： Dennis G. Howe , Edward J. Weldon, Jr. , Hugh M. Hilden
发明人： Dennis G. Howe , Edward J. Weldon, Jr. , Hugh M. Hilden
IPC分类号： G11B20/10 , H03M5/14 , H03M13/27 , H03M13/29 , H03M13/31 , H03M13/33 , H04L7/04
CPC分类号： H03M13/2703 , H03M13/152 , H03M13/29 , H03M13/31 , H03M13/33 , H03M5/145 , H04L7/048 , G11B20/10212 , H04L7/041
摘要： Channel encoded data (for example run length limited encoded data) is further encoded in accordance with a shift correction code prior to transmission. Upon reception, forward and backward shift errors present in the received channel encoded data are corrected by a shift correction decoder. The shift error correction is accomplished using a code, such as (for example) a BCH code over GF(p) or a negacyclic code, which treats each received symbol as a vector having p states. For a single shift error correction, p=3 and there are three states (forward shift, backward shift, no shift). In one embodiment, conventional error correction codewords which encode the user data may be interleaved within successive shift correction codewords prior to channel encoding, thereby enabling the error correction system to easily handle a high rate of randomly distributed shift errors (which otherwise would result in a high rate of short error bursts that exceed the capacity of the block error correction code).
摘要翻译：通道编码数据（例如游程长度限制编码数据）在传输之前根据移位校正码被进一步编码。在接收时，通过移位校正解码器校正存在于接收信道编码数据中的前向和后向移位误差。使用诸如（例如）GF（p）上的BCH码或者负循环码的代码来实现移位误差校正，其将每个接收到的符号视为具有p个状态的向量。对于单次移位误差校正，p = 3，并且有三种状态（前向移位，后向移位，无移位）。在一个实施例中，编码用户数据的常规纠错码字可以在信道编码之前的连续移位校正码字中进行交织，从而使得纠错系统能够容易地处理高速随机分布的移位误差（否则将导致高错误突发速率超过块错误校正码的容量）。

4. 发明授权

US5271016A Shift-correcting code system with efficient symbol-to-channel bit transformation 失效
标题翻译：移位校正码系统，具有高效的符号到通道位转换
公开(公告)号：US5271016A
公开(公告)日：1993-12-14
申请号：US632800
申请日：1990-12-24
申请人： Hugh M. Hilden , Dennis G. Howe
发明人： Hugh M. Hilden , Dennis G. Howe
IPC分类号： G11B20/18 , H03M5/14 , H03M5/18 , H03M13/31 , H03M7/46 , H03M13/00
CPC分类号： G11B20/1833 , H03M13/31 , H03M5/145 , H03M5/18
摘要： In a shift-correcting code which represents (d,k)-constrained run-length-limited (RLL) channel data as symbols drawn from GF(p.sup.m), the encoding process produces a set of redundant parity ternary GF(p.sup.m) symbols representing three shift error conditions: forward shift, backward shift and no shift, for p=3 and m=1 for example. The encoder of the invention transforms the parity symbols into (d,k)-constrained RLL channel bits to produce a binary data sequence that can be inserted in the RLL channel data stream without a large number of linking bits to maintain compliance with the (d,k) RLL constraints. A shift error in the RLL channel data representing parity symbols affects no more than one decoded parity symbol. The encoder of the invention efficiently transforms ternary symbols into (d,k)-constrained binary data by coding successive ternary symbols into one of six binary channel words in accordance with (a) the contents of the input ternary symbol and (b) the current state of the encoder, and sets its state to one of two states in preparation for encoding the next ternary symbol. In the first state, the encoder generates one of three channel words each comprising two bits preceded by b zeroes and in the second state generates one of three channel words each comprising two bits preceded by a one and b-1 zeroes, where b is related to d and k so as to maintain the (d,k)-constraints of a number of practically useful RLL codes.
摘要翻译：在代表（d，k）约束游程长度限制（RLL）信道数据作为从GF（pm）绘制的符号的移位校正码中，编码处理产生一组冗余奇偶校验三进制GF（pm）符号，三个移位误差条件：前向移位，后向移位和无移位，例如p = 3和m = 1。本发明的编码器将奇偶校验符号变换为（d，k）约束的RLL信道位，以产生可以插入到RLL信道数据流中的二进制数据序列，而不需要大量链接位，以保持符合（d ，k）RLL约束。表示奇偶码元的RLL信道数据中的移位误差影响不超过一个解码奇偶校验码元。本发明的编码器根据（a）输入三进制符号的内容和（b）当前的数据，将连续的三进制符号编码为六个二进制通道字之一，将三进制符号有效地转换为（d，k）约束二进制数据编码器的状态，并将其状态设置为两个状态之一，以准备对下一个三进制符号进行编码。在第一状态下，编码器产生三个通道字中的一个，每个三个通道字都包含两个前面加上b 0的位，而在第二个状态中，产生三个通道字中的一个，每个通道字包括两个前面加上一个和第一个零的位，其中b相关到d和k，以便维持一些实际有用的RLL码的（d，k）约束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式