Trellis code for extended partial response maximum likelihood (EPRML) channel
    1.
    发明授权
    Trellis code for extended partial response maximum likelihood (EPRML) channel 有权
    扩展部分响应最大似然(EPRML)通道的格子码

    公开(公告)号:US06408419B1

    公开(公告)日:2002-06-18

    申请号:US09347598

    申请日:1999-07-01

    IPC分类号: H03M1300

    摘要: A first trellis code (12A, 20A) according to the present invention is a rate 24/26 trellis code with three (3) bytes error propagation due to EPRML minimum instance channel errors, a minimum of six (6) transitions per code word and a maximum of twelve (12) consecutive zeroes. A second trellis code (12B, 20B) according to the present invention is a rate 48/51 trellis code, derived from the first trellis code. The second trellis code has four (4) bytes error propagation due to EPRML minimum distance channel errors, a minimum of twelve (12) transitions per code word and a maximum of twelve (12) consecutive zeroes. A third trellis code (12C, 20C) according to the present invention is a rate 48/51 trellis code with four (4) bytes error propagation due to EPRML minimum distance channel errors, a minimum of fourteen (14) transitions per code word and a maximum of eleven (11) consecutive zeroes.

    摘要翻译: 根据本发明的第一网格码(12A,20A)是由于EPRML最小实例信道错误而导致的三(3)字节错误传播的速率为24/26格状码,每码字最少六(6)个转换, 最多十二(12)个连续零。 根据本发明的第二网格码(12B,20B)是从第一网格码导出的速率48/51网格码。 由于EPRML最小距离信道错误,每个码字最少十二(12)个转换和最多十二(12)个连续零点,第二个网格码具有四(4)个字节的错误传播。 根据本发明的第三网格码(12C,20C)是由于EPRML最小距离信道误差而导致四(4)字节错误传播的速率48/51格状码,每码字最少十四(14)个转换, 最多十一(11)个连续零。

    SYSTEMS AND METHODS FOR PROCESSING DATA SETS IN PARALLEL
    2.
    发明申请
    SYSTEMS AND METHODS FOR PROCESSING DATA SETS IN PARALLEL 审中-公开
    并行处理数据集的系统和方法

    公开(公告)号:US20080140740A1

    公开(公告)日:2008-06-12

    申请号:US11608709

    申请日:2006-12-08

    IPC分类号: G06F7/38

    CPC分类号: H03M13/1515 H03M13/1595

    摘要: Various parallel processing devices, methods for designing such and using such are disclosed herein. For example, a parallel linear processing device is disclosed that includes two multipliers. One of the multipliers is operable to multiply a feedback signal by a first value and to provide a first multiplier output. The other multiplier is operable to multiply a data input by a second value and to provide a second multiplier output. The processing device further includes an adder and a register. The adder is operable to sum at least the first multiplier output and the second multiplier output and to provide an adder output. The register is operable to register the adder output as a register output, and the feedback signal provided to the first multiplier is derived from the register output.

    摘要翻译: 本文公开了各种并行处理装置,用于设计和使用其的方法。 例如,公开了一种包括两个乘法器的并行线性处理装置。 乘法器之一可操作以将反馈信号乘以第一值并提供第一乘法器输出。 另一乘法器可操作以将数据输入乘以第二值并提供第二乘法器输出。 处理装置还包括加法器和寄存器。 加法器可操作以至少对第一乘法器输出和第二乘法器输出求和并提供加法器输出。 该寄存器用于将加法器输出注册为寄存器输出,并且从寄存器输出中导出提供给第一乘法器的反馈信号。

    Method and apparatus for a data-dependent noise predictive viterbi
    3.
    发明授权
    Method and apparatus for a data-dependent noise predictive viterbi 有权
    用于数据相关噪声预测维特比的方法和装置

    公开(公告)号:US07522678B2

    公开(公告)日:2009-04-21

    申请号:US10402654

    申请日:2003-03-28

    IPC分类号: H03D1/00

    CPC分类号: G11B20/10296 G11B20/10009

    摘要: An improved Viterbi detector is disclosed in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. Also disclosed is a method of reducing the complexity of the branch metric calculations by clustering branches corresponding to signals with similar signal-dependent noise statistics. A feature of this architecture is that the branch metrics are clustered into multiple groups, where all the members of each group draw input from a single, shared noise predictive filter corresponding to the group. In recording technologies as practiced today, physical imperfections in the representation of recorded user data in the recording medium itself are becoming the dominate source of noise in the read back data. This noise is highly dependent on what was (intended to be) written in the medium. The disclosed Viterbi detector exploits this statistical dependence of the noise on the signal.

    摘要翻译: 公开了一种改进的维特比检测器,其中基于依赖于与分支对应的信号假设的噪声统计来计算每个分支度量。 还公开了一种通过对与具有相似的信号相关噪声统计信号的信号进行聚类的分支来降低分支度量计算的复杂度的方法。 该架构的一个特点是分支度量被聚集成多个组,其中每个组的所有成员从与组相对应的单个共享噪声预测滤波器中绘制输入。 在今天所采用的记录技术中,在记录介质本身中记录的用户数据的表示中的物理缺陷正在回读数据中成为主要的噪声源。 这种噪音很大程度上取决于介质中写的内容。 所公开的维特比检测器利用噪声对信号的统计依赖性。

    Method and apparatus for calibrating data-dependent noise prediction
    4.
    发明授权
    Method and apparatus for calibrating data-dependent noise prediction 有权
    用于校准数据相关噪声预测的方法和装置

    公开(公告)号:US06889154B2

    公开(公告)日:2005-05-03

    申请号:US10402033

    申请日:2003-03-28

    摘要: Disclosed herein is an apparatus and method of calibrating the parameters of a Viterbi detector 138 in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. An offline algorithm for calculating the parameters of data-dependent noise predictive filters 304A-D is presented which has two phases: a noise statistics estimation or training phase, and a filter calculation phase. During the training phase, products of pairs of noise samples are accumulated in order to estimate the noise correlations. Further, the results of the training phase are used to estimate how wide (in bits) the noise correlation accumulation registers need to be. The taps [t2[k], t1[k], t0[k]] of each FIR filter are calculated based on estimates of the entries of a 3-by-3 conditional noise correlation matrix C[k] defined by Cij[k]=E(ni−3nj−3|NRZ condition k).

    摘要翻译: 本文公开了一种校准维特比检测器138的参数的装置和方法,其中基于依赖于与分支对应的信号假设的噪声统计量来计算每个分支度量。 提出了一种用于计算数据相关噪声预测滤波器304A-D的参数的离线算法,其具有两个阶段:噪声统计估计或训练阶段和滤波器计算阶段。 在训练阶段,累积了噪声样本对的乘积,以估计噪声相关性。 此外,训练阶段的结果用于估计噪声相关累加寄存器的宽度(以比特为单位)。 水龙头 2 > 1 [k] 0 基于由<?in-line-formula description = 3定义的3×3条件噪声相关矩阵C [k] 的条目的估计来计算每个FIR滤波器的 “In-line Formulas”end =“lead”?> C i> E E E E E =>>>>>>>>>>>>>>>>>>>>>>>>> j-3

    Tabular puzzle
    5.
    发明授权
    Tabular puzzle 失效
    表格拼图

    公开(公告)号:US4451040A

    公开(公告)日:1984-05-29

    申请号:US391165

    申请日:1982-06-22

    IPC分类号: A63F9/08

    摘要: The tabular puzzle, shown in FIG. 5, is a puzzle comprising nine square tablets arranged in a three-by-three array and inclosed in a mechanism in such a way that any group of four tablets meeting at a common corner point may be rotated about said point by any multiple of 90.degree.. The exposed face of each of the tablets is marked with an index which uniquely establishes said tablet's identity and orientation. These indices may be scrambled by a series of said rotations. The object of the puzzle is to return the tablets, and hence the indices, to their original positions and orientations in the said three-by-three array by means of a series of said rotations.

    摘要翻译: 图示的平板拼图 如图5所示,是包括以三乘三阵列布置的九个平板的拼图,并以这样的方式封闭,使得在公共角点处相遇的任何一组四个片可以围绕所述点旋转任何倍数的90 DEG。 每个片剂的暴露的脸部标有唯一地建立所述片剂的身份和方向的指数。 这些指数可以通过一系列所述旋转加扰。 拼图的目的是通过一系列所述旋转将平板电脑,从而将索引返回到所述三乘三阵列中的原始位置和方位。

    Method and apparatus for calibrating data-dependent noise prediction
    6.
    发明授权
    Method and apparatus for calibrating data-dependent noise prediction 有权
    用于校准数据相关噪声预测的方法和装置

    公开(公告)号:US07191083B2

    公开(公告)日:2007-03-13

    申请号:US11490981

    申请日:2006-07-20

    IPC分类号: G01R35/00

    摘要: Disclosed herein is an apparatus and method of calibrating the parameters of a Viterbi detector 138 in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. An offline algorithm for calculating the parameters of data-dependent noise predictive filters 304A-D is presented which has two phases: a noise statistics estimation or training phase, and a filter calculation phase. During the training phase, products of pairs of noise samples are accumulated in order to estimate the noise correlations. Further, the results of the training phase are used to estimate how wide (in bits) the noise correlation accumulation registers need to be. The taps [t2[k], t1[k], t0[k]] of each FIR filter are calculated based on estimates of the entries of a 3-by-3 conditional noise correlation matrix C[k] defined by Cij[k]=E(ni-3nj-3|NRZ condition k).

    摘要翻译: 本文公开了一种校准维特比检测器138的参数的装置和方法,其中基于依赖于与分支对应的信号假设的噪声统计量来计算每个分支度量。 提出了一种用于计算数据相关噪声预测滤波器304A-D的参数的离线算法,其具有两个阶段:噪声统计估计或训练阶段和滤波器计算阶段。 在训练阶段,累积了噪声样本对的乘积,以估计噪声相关性。 此外,训练阶段的结果用于估计噪声相关累加寄存器的宽度(以比特为单位)。 抽头[t 2],[0],[0],0&lt; 1&lt; 基于由C定义的3×3条件噪声相关矩阵C∈[k] 的条目的估计来计算每个FIR滤波器的SUB> [k] = E(n-i-3)n-3 / NRZ条件k)。

    Method and apparatus for calibrating data-dependent noise prediction
    7.
    发明授权
    Method and apparatus for calibrating data-dependent noise prediction 有权
    用于校准数据相关噪声预测的方法和装置

    公开(公告)号:US07165000B2

    公开(公告)日:2007-01-16

    申请号:US11109207

    申请日:2005-04-18

    IPC分类号: G06F19/00

    摘要: Disclosed herein is an apparatus and method of calibrating the parameters of a Viterbi detector 138 in which each branch metric is calculated based on noise statistics that depend on the signal hypothesis corresponding to the branch. An offline algorithm for calculating the parameters of data-dependent noise predictive filters 304A–D is presented which has two phases: a noise statistics estimation or training phase, and a filter calculation phase. During the training phase, products of pairs of noise samples are accumulated in order to estimate the noise correlations. Further, the results of the training phase are used to estimate how wide (in bits) the noise correlation accumulation registers need to be. The taps [t2[k],t1[k],t0[k]] of each FIR filter are calculated based on estimates of the entries of a 3-by-3 conditional noise correlation matrix C[k] defined by Cij[k]=E(ni−3nj−3|NRZ condition k).

    摘要翻译: 本文公开了一种校准维特比检测器138的参数的装置和方法,其中基于依赖于与分支对应的信号假设的噪声统计量来计算每个分支度量。 提出了一种用于计算数据相关噪声预测滤波器304A-D的参数的离线算法,其具有两个阶段:噪声统计估计或训练阶段和滤波器计算阶段。 在训练阶段,累积了噪声样本对的乘积,以估计噪声相关性。 此外,训练阶段的结果用于估计噪声相关累加寄存器的宽度(以比特为单位)。 抽头[t 2],[0],[0],0&lt; 1&lt; 基于由C定义的3×3条件噪声相关矩阵C∈[k] 的条目的估计来计算每个FIR滤波器的SUB> [k] = E(n-i-3)n-3 / NRZ条件k)。

    Encoding for pit-per-transition optical data recording
    8.
    发明授权
    Encoding for pit-per-transition optical data recording 失效
    凹坑/转换光学数据记录的编码

    公开(公告)号:US4881076A

    公开(公告)日:1989-11-14

    申请号:US126653

    申请日:1987-12-01

    IPC分类号: H03M7/46 G11B20/14 H03M7/14

    CPC分类号: G11B20/1426

    摘要: Encoding method for data to be recorded on optical disks using the pit-per-transition technique or return-to-zero techniques whereby the characteristics of the encoded bits produce a stable, low frequency spectral notch and minimum interference with associated focus and tracking servomechanisms. RLL (d,k) code words are selected so that the ratio of the lengths of pits and lands approximate some nonzero fraction less than one-half which depends on the (d,k) code employed. For example, a fraction of 1/3 is appropriate for RLL (2,7).

    Eleven-plane cubical puzzle
    9.
    发明授权
    Eleven-plane cubical puzzle 失效
    十一平面立方体拼图

    公开(公告)号:US4474377A

    公开(公告)日:1984-10-02

    申请号:US410445

    申请日:1982-08-23

    IPC分类号: A63F9/08

    CPC分类号: A63F9/0826 A63F9/0834

    摘要: The eleven-plane cubical puzzle, shown in FIG. 1, is a puzzle in the shape of a cube whose twenty-four exposed pieces may be permuted by rotations of groups of said pieces about any of seven axes passing through the vertices and the centers of the faces of said cube.

    摘要翻译: 十一平面立方体拼图,如图所示。 如图1所示,是立方体的一个难题,其二十四个暴露的片可以通过所述片段的组的旋转被绕过通过顶点和所述立方体的面的中心的七个轴中的任何一个轴。