×

Clash-free irregular-repeat-accumulate code

  • US 20070011566A1
  • Filed: 04/14/2006
  • Published: 01/11/2007
  • Est. Priority Date: 04/15/2005
  • Status: Active Grant
First Claim
Patent Images

1. A method for performing data encoding comprising:

  • receiving a sequence of data bits;

    encoding the sequence of data bits in accordance with a parity check matrix (H-matrix) to generate a sequence of encoded bits;

    wherein the H-matrix is capable of being partitioned into a first matrix and a second matrix, the first matrix being a dual-diagonal matrix, the second matrix comprising one or more vertically stacked sub-matrices, each sub-matrix consisting of a plurality of columns, each column having a column weight of no more than 1;

    wherein the second matrix is capable of being expressed as a product of a parity check matrix, an interleaver permutation matrix, and a repeat block matrix, and the interleaver permutation matrix satisfies a clash-free interleaver constraint; and

    outputting the sequence of encoded bits.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×