公开(公告)号：WO2013159616A1

公开(公告)日：2013-10-31

申请号：PCT/CN2013/072908

申请日：2013-03-20

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  IBM (CHINA) CO., LIMITED

Inventor： CIDECIYAN, Roy D. ,  HUTCHINS, Robert A. ,  MITTELHOLZER, Thomas ,  OELCER, Sedat

IPC: H03M13/00

CPC classification number: G11B20/1833 ,  G11B5/00813 ,  G11B20/10379 ,  G11B2020/185 ,  H03M5/145 ,  H03M13/1111 ,  H03M13/13 ,  H03M13/2957 ,  H03M13/3905 ,  H03M13/3972 ,  H03M13/6325

Abstract: In one embodiment, a method includes executing a first forward loop of a detection algorithm on a block of signal samples during a first time interval, executing a first reverse loop of the detection algorithm on the block during a second time interval to produce first soft information, executing a decoding algorithm on the block during a third time interval using the first soft information to produce second soft information, executing a second forward loop of the detection algorithm on the block during a fourth time interval using the second soft information, executing a second reverse loop of the detection algorithm on the block during a fifth time interval to produce third soft information, executing the decoding algorithm on the block during a sixth time interval using the third soft information to produce a decoded block of signal samples, and outputting the decoded block of signal samples.

Abstract translation: 在一个实施例中，一种方法包括在第一时间间隔期间对信号样本块执行检测算法的第一前向循环，在第二时间间隔内在块上执行检测算法的第一反向循环，以产生第一软信息 在第三时间间隔期间使用第一软信息在块上执行解码算法以产生第二软信息，使用第二软信息在第四时间间隔期间在块上执行检测算法的第二正向循环，执行第二软信息 在第五时间间隔内在块上反向循环检测算法以产生第三软信息，在第六时间间隔内使用第三软信息在块上执行解码算法以产生解码的信号样本块，并输出解码 信号样本块。

公开(公告)号：WO2010151268A1

公开(公告)日：2010-12-29

申请号：PCT/US2009/048957

申请日：2009-06-26

Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY,- ,  ORDENTLICH, Erik ,  ROTH, Ron, M.

Inventor： ORDENTLICH, Erik ,  ROTH, Ron, M.

IPC: H03M7/00 ,  H03M7/40

CPC classification number: H03M5/145

Abstract: An approximate enumerative coding method (100, 200) and apparatus (300) employ a cardinality-approximating (C-A) lower bound in mapping a message M to a 2-dimensional (2-D) codeword array that satisfies a 2-D constraint. The method (100) includes encoding the message M as a codeword array X using an encoder apparatus. The encoding determines entries in a codeword array X using the C-A lower bound. The C-A lower bound is a function of several terms, namely a memory term k, a cardinality of a set of sequences satisfying a horizontal constraint, a columnar extension probability of the 2-D constraint, and a non-negative constant that is a function of the columnar extension probability. The apparatus (300) includes an encoder processor (310), memory (320) and a computer program (330) stored in the memory (320) and executed by the encoder processor (310).

Abstract translation: 近似枚举编码方法（100,200）和装置（300）在将消息M映射到满足2-D约束的二维（2-D）码字阵列时采用基数近似（C-A）下限。 方法（100）包括使用编码器装置将消息M编码为码字阵列X. 编码使用C-A下限确定码字阵列X中的条目。 CA下限是几个项的函数，即存储项k，满足水平约束的一组序列的基数，2-D约束的列扩展概率和作为函数的非负常数 的柱状扩展概率。 装置（300）包括编码器处理器（310），存储器（320）和存储在存储器（320）中并由编码器处理器（310）执行的计算机程序（330）。

公开(公告)号：WO2010133033A1

公开(公告)日：2010-11-25

申请号：PCT/CN2009/071900

申请日：2009-05-21

Applicant: 华为技术有限公司 ,  封东宁 ,  耿东玉 ,  梁伟光 ,  李靖 ,  埃芬博格·弗兰克 ,  贝勒迪多·塞吉奥 ,  蒙托里·西基多

Inventor： 封东宁 ,  耿东玉 ,  梁伟光 ,  李靖 ,  埃芬博格·弗兰克 ,  贝勒迪多·塞吉奥 ,  蒙托里·西基多

IPC: H03M7/00

CPC classification number: H03M5/145

公开(公告)号：WO2009134568A2

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

申请号：PCT/US2009/038808

申请日：2009-03-30

Applicant: RAMBUS INC. ,  ABBASFAR, Aliazam

Inventor： ABBASFAR, Aliazam

IPC: G06F7/74

CPC classification number: H04L25/4908 ,  H03M5/145 ,  H04L25/14

Abstract: M-bit data are encoded into n-bit data such that the encoded n-bit data has a sufficient number of encoded data patterns enough to encode the number (2 m ) of data patterns in the m- bit data but that the n-bit data has Hamming Weights (HWs) with minimum (smallest possible) variation. Specifically, encoder logic is configured to receive 2 m of m-bit data patterns and encode the 2 m of m-bit data patterns to n-bit encoded data patterns, n being greater than m and me being a positive integer greater than one. The encoder logic is configured to map the 2 m m-bit data patterns to a subset of 2 n of the n-bit encoded data patterns, and the n-bit data patterns in said subset has a minimum (smallest possible) range of Hamming Weight variation while the number of the n-bit data patterns in said subset is not less than 2 m .

Abstract translation: M位数据被编码为n位数据，使得编码的n位数据具有足够数量的编码数据模式，足以对m位数据中的数据模式的数量（2m）进行编码，但是n位 数据具有最小（可能最小）变化的汉明重量（HW）。 具体地，编码器逻辑被配置为接收2m的m位数据模式，并将m位数据模式的2m编码为n位编码数据模式，n大于m，而我是大于1的正整数。 编码器逻辑被配置为将2m m位数据模式映射到n位编码数据模式的2n个子集，并且所述子集中的n位数据模式具有汉明权重变化的最小（最小可能）范围 而所述子集中的n位数据模式的数量不小于2m。

公开(公告)号：WO2009103723A1

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

申请号：PCT/EP2009/051896

申请日：2009-02-18

Applicant: THOMSON LICENSING ,  THEIS, Oliver ,  CHEN, Xiao-Ming ,  TIMMERMANN, Friedrich

Inventor： THEIS, Oliver ,  CHEN, Xiao-Ming ,  TIMMERMANN, Friedrich

IPC: H03M5/14

CPC classification number: H03M5/145

Abstract: A channel encoding method is disclosed, which comprises dk-encoding and NRZI precoding, the output of which obeys a repeated minimum transition runlength constraint and is FSM decodable with a given lookahead depth. Occurrences of RMTR violating critical bit sequences are replaced by same length replacement sequences containing extended zero runs; and the FSM decodability with a given lookahead depth is achieved by using only those replacement sequences that are decodable with the given lookahead depth. A pertaining FSM channel decoding method and channel decoding apparatus, as well as using the FSM in trellis decoding, are disclosed.

Abstract translation: 公开了一种信道编码方法，其包括dk编码和NRZI预编码，其输出服从重复的最小过渡游程长度约束，并且具有给定的前瞻深度可解码的FSM。 违反关键位序列的RMTR的发生由包含扩展零运行的相同长度替换序列替换; 并且具有给定的前瞻深度的FSM可解码性通过仅使用可以用给定的前瞻深度解码的替换序列来实现。 公开了一种FSM信道解码方法和信道解码装置，以及在网格解码中使用FSM。

公开(公告)号：WO2009060332A2

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

申请号：PCT/IB2008/054372

申请日：2008-10-23

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  MITTELHOLZER, Thomas

Inventor： MITTELHOLZER, Thomas

CPC classification number: H03M5/145 ,  H03M7/02 ,  H03M7/3088

Abstract: Methods and apparatus are provided for modulation coding a stream of binary input data. A 4-ary enumerative encoding algorithm is applied to the input bit-stream to produce a succession of 4-ary output symbols. The 4-ary algorithm is operative to simultaneously encode respective generalized Fibonacci codes in the odd and even interleaves of the input bit-stream. The bits of each successive 4-ary output symbol are then interleaved, producing an output bit-stream which has global and interleaved run-length constraints. Inverting the bits of the 4-ary output symbols produces an output bit-stream with (G, I) -constraints as in the PRML (G, I) codes used in reverse-concatenation modulation systems. Corresponding decoding systems are also provided.

Abstract translation: 提供了用于对二进制输入数据流进行调制编码的方法和设备。 将4元枚举编码算法应用于输入比特流以产生一连串的4元输出符号。 该4元算法用于在输入比特流的奇数和偶数交错中同时编码相应的广义斐波那契码。 然后交错每个连续4元输出符号的比特，产生具有全局和交错游程长度约束的输出比特流。 如反向级联调制系统中使用的PRML（G，I）代码那样，反转4元输出符号的比特产生具有（G，I）约束的输出比特流。 还提供了相应的解码系统。

公开(公告)号：WO2008116725A1

公开(公告)日：2008-10-02

申请号：PCT/EP2008/052510

申请日：2008-02-29

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION ,  IBM UNITED KINGDOM LIMITED ,  ELEFTHERIOU, Evangelos ,  HUTCHINS, Robert ,  MITTELHOLZER, Thomas ,  SEGER, Paul

Inventor： ELEFTHERIOU, Evangelos ,  HUTCHINS, Robert ,  MITTELHOLZER, Thomas ,  SEGER, Paul

IPC: G11B20/18

CPC classification number: G11B20/1866 ,  G11B20/1426 ,  G11B20/1803 ,  G11B2020/1287 ,  G11B2020/1446 ,  G11B2020/1836 ,  G11B2220/2516 ,  G11B2220/2537 ,  G11B2220/90 ,  H03M5/145 ,  H03M13/1515 ,  H03M13/2707 ,  H03M13/2721 ,  H03M13/275 ,  H03M13/2792 ,  H03M13/2909 ,  H03M13/53 ,  H03M13/6343

Abstract: A system, method and computer program product are provided to encode data for recording onto media whereby modulation and linear constraints from a concatenated code or product code are imposed. A first array of unencoded user data is generated. Each row is modulation encoded to enforce a first modulation constraint; the array is transformed into a second array which is transformed into a third array having predetermined empty locations in each column interleaved with the modulated data. A C2-parity byte is computed for at least some of the empty locations of the third array and a fourth array is generated. C1-parity symbols in each row are computed, generating a fifth array. A second modulation constraint is enforced on each C1-parity symbol in each row of the fifth array, generating a sixth array. The rows of the sixth array are assembled with header and sync fields for recording onto a recording media.

Abstract translation: 提供了一种系统，方法和计算机程序产品，用于对用于记录到介质上的数据进行编码，从而施加来自级联代码或产品代码的调制和线性约束。 生成第一组未编码的用户数据。 每行被调制编码以执行第一调制约束; 该阵列被变换成第二阵列，该第二阵列被转换成具有与调制数据交错的每列中的预定空位置的第三阵列。 对于第三阵列的至少一些空位置计算C2奇偶校验字节，并且生成第四阵列。 计算每行中的C1奇偶校验符号，生成第五个数组。 在第五阵列的每行中的每个C1奇偶校验符号上强制执行第二调制约束，产生第六阵列。 第六阵列的行与标题和同步字段组合，用于记录到记录介质上。

公开(公告)号：WO2007072277A2

公开(公告)日：2007-06-28

申请号：PCT/IB2006/054698

申请日：2006-12-08

Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  SONY CORPORATION ,  COENE, Willem, M., J., M. ,  HEKSTRA, Andries, P. ,  YAMAGISHI, Hiroyuki ,  NODA, Makota

Inventor： COENE, Willem, M., J., M. ,  HEKSTRA, Andries, P. ,  YAMAGISHI, Hiroyuki ,  NODA, Makota

IPC: G11B20/14 ,  H03M5/14

CPC classification number: G11B20/1426 ,  G11B20/10055 ,  G11B20/10296 ,  G11B2020/1453 ,  G11B2020/1457 ,  H03M5/145 ,  H03M7/40 ,  H03M13/29 ,  H03M13/31 ,  H03M13/3761 ,  H03M13/3972 ,  H03M13/41

Abstract: Presently known d=l codes have long trains consisting of consecutive 2T runs and an overall high frequency of occurrence of the shortest 2T runs that reduce the performance of the bit detector. By using a code with an MTR constraint of 2 an improvement in the bit detection is achieved. A code constructed in a systematic way that provides an MTR constraint of 2 is presented. A variation of such a code is disclosed where one sub-code is used, where coding states are divided into coding classes and where code words are divided into code word types. Then, for a given sub-code, an code word of type t can be concatenated with an code word of the next sub-code if said subsequent code word of said next sub-code belongs to one of coding states of the coding class with index T max + 1 t . In the code according to the invention the overall code has the property that the respective channel bit sequences that are encoded from the same message-bit sequence, starting from any possible state of the finite-state-machine, for each of the two values of a DC-control bit, that is part of a given user word have opposite parities for the sequences generated from the starting state up to the state where both encoder paths merge. For the case that the encoder paths do not merge, there is no such constraint. Finally, a new d=l, k=10 sliding-block decodable RLL code is disclosed with the following properties: (i) it has an r=2 constraint which is the lowest MTR value that is compatible with a rate R=2/3; (ii) it enables practical SISO-RLL decoding because of its compact 2-to-3 mapping; and (iii) the new code uses a parity-complementary word assignment 4 (PCWA) for DC-control.

Abstract translation: 目前已知的d = l代码具有由连续的2T运行组成的长列车，并且出现最短的2T运行的总体高频率，这降低了位检测器的性能。 通过使用MTR约束为2的代码，实现了位检测的改进。 提出了一种以系统方式构建的代码，其提供MTR约束为2的代码。 公开了这样的代码的变型，其中使用一个子代码，其中编码状态被分为编码类别以及代码字被分成代码字类型。 然后，对于给定子码，如果所述下一子码的所述后续码字属于编码类的编码状态之一，则可以将类型t的码字与下一子码的码字连接， 索引T最大

公开(公告)号：WO2005069281A2

公开(公告)日：2005-07-28

申请号：PCT/IB2005/050036

申请日：2005-01-05

Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V. ,  VERSCHUREN, Coen, A. ,  COENE, Willem,. M., J., M.

Inventor： VERSCHUREN, Coen, A. ,  COENE, Willem,. M., J., M.

IPC: G11B7/00

CPC classification number: G11B7/1263 ,  G11B7/1267 ,  G11B11/1051 ,  G11B11/10515 ,  G11B11/10595 ,  G11B20/1426 ,  H03M5/145

Abstract: The present invention relates to a method and apparatus for controlling at least one readout parameter of a magneto-optical domain expansion recording medium. An average detected runlength of the reading signal is monitored, and an error signal is generated on the basis of a comparison of the monitoring result with the predetermined average runlength that has been set during the encoding step. The at least one readout parameter is then controlled by means of the generated error signal. Furthermore, the present invention relates to a method, apparatus and record carrier wherein a runlength constraint is applied to at least one of the following quantities: mark regions and space regions in said storage layer, said runlength constraint being selected to keep an accumulated runlength deviation from a predetermined average runlength within a predetermined range. The proposed runlength property and control scheme provide the advantage that all detected runlengths contribute to the error signal to make the response must faster and to reduce readout errors.

Abstract translation: 本发明涉及用于控制磁光域扩展记录介质的至少一个读出参数的方法和装置。 监视读取信号的平均检测到的游程长度，并且基于监视结果与在编码步骤期间设置的预定平均游程长度的比较来生成错误信号。 然后通过产生的误差信号来控制至少一个读出参数。 此外，本发明涉及一种方法，装置和记录载体，其中运行长度约束应用于以下量中的至少一个：所述存储层中的标记区域和空间区域，所述游程长度约束被选择为保持累积的游程长度偏差 从预定范围内的预定平均游程长度。 所提出的运行长度属性和控制方案提供了所有检测到的运行长度有助于误差信号以使响应更快并且减少读出错误的优点。

公开(公告)号：WO2005043533A1

公开(公告)日：2005-05-12

申请号：PCT/IE2004/000151

申请日：2004-11-01

Applicant: UNIVERSITY OF LIMERICK ,  CONWAY, Thomas

Inventor： CONWAY, Thomas

IPC: G11B20/10

CPC classification number: H03M5/145 ,  G11B20/10009 ,  G11B20/1426

Abstract: A data detector system illuminates a spot (21) centred on a centroid between three symbols (20) in a hexagonal lattice. The lattice does not include guard bands and so there is a high data density. A data detector uses sum-product processing to generate an estimate for each symbol, treating sample values as constraints that need to be satisfied.

Abstract translation: 数据检测器系统以六边形格子照亮位于三个符号（20）之间的质心的点（21）。 晶格不包括保护带，因此存在高数据密度。 数据检测器使用和积处理来生成每个符号的估计，将样本值作为需要满足的约束来处理。