LOW DENSITY PARITY CHECK ENCODING METHOD AND DEVICE FOR DATA

    公开(公告)号:JP2003115768A

    公开(公告)日:2003-04-18

    申请号:JP2002199657

    申请日:2002-07-09

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide a parity check matrix connected to an LDPC code having the encoding complexity of a linear time. SOLUTION: This data low density parity check (LDPC) encoding method comprises a step for defining a first M×N parity check matrix, a step for generating a second parity check matrix having M×M triangle part matrix based on the first parity check matrix, and a step for mapping the data to the LDPC code word based on the second parity check matrix. This method is made valid especially for a data communication application, and also may be used for another application such as a data storage.

    METHOD AND DEVICE FOR DETECTING DATA OF PRML DATA CHANNEL

    公开(公告)号:JPH1125602A

    公开(公告)日:1999-01-29

    申请号:JP13358298

    申请日:1998-05-15

    Applicant: IBM

    Abstract: PROBLEM TO BE SOLVED: To provide a method and device for detecting the data of a partial response maximum liklihood (PRML) data channel in a direct access storage device. SOLUTION: A class IV partial response (PR4) signal is applied to a PR4 viterbi detector 60, and a PR4 viterbi output is generated, and is applied to a first matching delay circuit 64, and a delay PR4 signal is generated. The PR4 viterbi output is subtracted from the delay PR4 signal, and a synthetic signal is applied to a first filter 74 having a frequency response 1/ (1-αD ). A filtered output signal is applied to a second filter 76, and a second filter output signal is generated. The PR4 viterbi output is applied to a second matching delay circuit 86, and a delay PR4 viterbi output signal is generated. The delay PR4 viterbi output is responded to the second filter output signal to be corrected. The first filter is an infinite impulse response (IIR) filter, and the filter output signal shows a white colored noise and a corrected PRML error event.

    Data encoding systems
    3.
    发明专利

    公开(公告)号:GB2355165B

    公开(公告)日:2003-10-22

    申请号:GB0016683

    申请日:2000-07-07

    Applicant: IBM

    Abstract: A method and apparatus for encoding a plurality of successive m-bit binary data words to produce a plurality of successive of n-bit binary code words, where n and m are positive integers and n is greater than m, for supply to a magnetic recording channel. Each m-bit binary data word is partitioned into a plurality of blocks of bits, and at least one said blocks of bits in each m-bit binary data word is encoded in accordance with a finite-state coding scheme to produce a plurality of successive n-bit binary code words. At least one stage of violation correction which transforms the plurality of successive n-bit binary code words. Violation correction includes detecting the occurrence of any of a plurality of prohibited bit patterns at one or more predetermined locations within each n-bit binary coded word, and replacing any prohibited bit pattern so detected by a corresponding substitute bit pattern. The finite-state coding scheme, the prohibited bit patterns, and corresponding substitute bit patterns are predetermined such that in a serial bit-steam comprising the successive n-bit binary code words, the maximum number of consecutive bits of a first value is limited to a first predetermined number j, where b greater or equal to 2, and the maximum number of consecutive bits of the a second value is limited to a second predetermined number k.

    Maximum transition run (MTR) encoding where prohibited portions of block coded data are replaced with substitute portions

    公开(公告)号:GB2355165A

    公开(公告)日:2001-04-11

    申请号:GB0016683

    申请日:2000-07-07

    Applicant: IBM

    Abstract: Methods and apparatus are provided for encoding a succession of m-bit data words to produce a succession of n-bit code words, where n > m, for supply to a magnetic recording channel. Each m-bit data word is partitioned into a plurality of blocks of bits (5a, 6a, 7a), and at least one of said blocks is encoded (5, 6, 7) in accordance with a block coding scheme such that the resulting bit sequence derived from the m bits of the data word comprises an n-bit sequence (5b, 6b, 7b). An n-bit code word is then produced by at least one stage of violation correction (8,9). The or each stage of violation correction comprises detecting the occurrence of any of a plurality of prohibited bit patterns at one or more predetermined locations in the n-bit sequence, and replacing any prohibited bit pattern so detected by a respective substitute bit pattern (8b, 9b). The block coding scheme and the prohibited and substitute bit patterns are predetermined such that, in a succession of said n-bit code words, the maximum number of consecutive bits of one value is limited to a first predetermined number j, where j / 2, and the maximum number of consecutive bits of the other value is limited to a second predetermined number k.

Patent Agency Ranking