Encoding method of TLDPC codes utilizing treillis representations of the parity check equations and associated encoding device

A non-transitory article of manufacture for use in a computer system comprising calculation means, having a computer usable medium, to perform an encoding method for associating p redundancy data bits with k information data bits to determine code words with a block length of n=p+k data bits, the code words being of tail-biting trellis low density parity check type, the encoding method implementing a degree distribution profile of the n data bits defining a base code word including multiple replicas of the n data bits with respect to the degree distribution, the base code word being represented by a two-state trellis formed of sections with positions accommodating data bits of the base code word whereby the number of positions of a section is denoted as the degree of the section, wherein the computer usable medium comprises a computer readable code means for:

• making a partition, with the calculation means, of the base code word trellis into p intersecting regular parts of triple sections representing p parity check equations,
• arranging, with the calculation means, the base code word data bits into the positions of the two-states trellis with respect to the degree of the sections and of the data bits as well as pre-determined permutation rules,
• successively recovering, with the calculation means, the values of all unknown redundancy data bits, one regular part of triple section after the other, using a redundancy data bit value as a known value after being recovered from previous regular parts of triple sections.

A module on an encoder device for encoding code words associating p redundancy data bits with k information data bits to determine the code words with a block length of n=p+k data bits, the code words being of tail-biting trellis low density parity check type, said module comprising:

• a calculating computer encoder chip,
• a module for implementing a degree distribution profile of n data bits defining a base code word comprising multiple replicas of the n data bits with respect to the degree distribution, the base code word being represented by a two-state trellis formed of sections with positions accommodating data bits of the base code word whereby the number of positions of a section is denoted as the degree of the section,
• a module for making a partition of the base code word trellis into p intersecting regular parts of triple sections representing p parity check equations,
• a module for arranging the base code word data bits into the positions of the two-state trellis with respect to the degree of the sections and of the data bits as well as pre-determined permutation rules,
• a module for successively recovering the values of all unknown redundancy data bits, one regular part of triple section after another, using a redundancy data bit value as a known value after being recovered from previous regular parts of triple sections.