Method and apparatus for using long forward error correcting codes in a content distribution system

• US 7,831,887 B2
• Filed: 12/15/2005
• Issued: 11/09/2010
• Est. Priority Date: 12/15/2005
• Status: Active Grant

• Current Assignee: Google Technology Holdings LLC (Alphabet Inc.)
• Original Assignee: General Instrument Corporation (CommScope Holding Company, Inc.)
• Inventors: Moran, John L., Joyce, Gerald R., Schmidt, Mark S.
• Primary Examiner(s): CHAUDRY, MUJTABA M
• Application Number:
  US11/300,905
• Publication Number:
  US 20070143654A1
• Time in Patent Office: 1,790 Days
• Field of Search: 714/758, 714/804
• US Class Current: 714/758
• CPC Class Codes: H03M 13/1111 Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
• CPC Class Codes: H03M 13/1185 wherein the parity-check matrix comprises a part with a double-diagonal
• CPC Class Codes: H03M 13/255 with Low Density Parity Check [LDPC] codes

Abstract

Method and apparatus for using long FEC codes in a content distribution system is described. One aspect of the invention relates to encoding frames of content. Each frame is partitioned into un-coded bits and bits to be encoded. For each frame, an FEC code is applied to the bits to be encoded to generate a codeword. Groups of bits from the codeword are divided among a plurality of channels. Symbols formed from the groups of bits and the un-coded bits are mapped to a constellation for each of the plurality of channels. The symbols are modulated across a respective plurality of bonded channels for transmission.

Claims

1. A method of encoding frames of content, comprising:

partitioning each frame into un-coded bits and bits to be encoded; and

for each frame;

applying a forward error correction (FEC) code to the bits to be encoded to generate a codeword;

dividing groups of encoded bits from the codeword and dividing a like number of groups of un-coded bits from the un-coded bits;

forming symbols, each symbol being formed from one of the groups of encoded bits and one of the groups of un-coded bits;

mapping the symbols to mapped constellation points; and

modulating each of a plurality of channels using all of the mapped constellation points in a round robin fashion before modulating any of the plurality of channels with a constellation point mapped from bits of a subsequent frame, wherein the round robin fashion simultaneously modulates each of the plurality of channels with different mapped constellation points, and wherein the simultaneous modulation is performed consecutively until all mapped constellation points are used once.

2. The method of claim 1, further comprising, for each frame:

interleaving bits in the codeword to generate an interleaved bit stream; and

obtaining the groups of bits from the interleaved bit stream.

3. The method of claim 1, wherein the FEC code comprises a low density parity check (LDPC) code.

4. The method of claim 3, wherein the LDPC code has a length N greater than or equal to 32,400 bits.

5. The method of claim 1, wherein the mapped constellation points are mapped from a constellation that comprises a quadrature amplitude modulation (QAM) constellation.

6. The method of claim 1, wherein the codeword includes information bits and parity bits, and wherein the information bits comprise two bits for each of the symbols, and wherein the un-coded bits comprise log₂(M)−

2 bits for each of the symbols, where M is a number of the points in the QAM constellation.

7. The method of claim 1, wherein each of the encoded groups of bits comprises two bits.

8. Apparatus for encoding frames of content, comprising:

a data parser for partitioning each frame into un-coded bits and bits to be encoded;

an encoder for applying a forward error correction (FEC) code to the bits to be encoded to generate a codeword for each frame;

a bit interleaver/grouper for dividing groups of bits from the codeword;

a mapper for mapping symbols formed from the groups of bits and a like number of groups of the un-coded bits to mapped constellation points that are mapped from a constellation; and

a modulator that modulates each of a plurality of channels, using the mapped constellation points for each frame in a round robin fashion before modulating any of the plurality of channels with a constellation point mapped from bits of a subsequent frame, wherein the round robin fashion simultaneously modulates each of the plurality of channels with different mapped constellation points, and wherein the simultaneous modulation is performed consecutively until all mapped constellation points are used once.

9. The apparatus of claim 8, wherein the bit interleaver/grouper is configured to interleave bits in the codeword to generate an interleaved bit stream and obtain the groups of bits from the interleaved bit stream for each frame.

10. The apparatus of claim 8, wherein the FEC code comprises a low density parity check (LDPC) code.

11. The apparatus of claim 10, wherein the LDPC code has a length N greater than or equal to 32,400 bits.

12. The apparatus of claim 8, wherein the mapped constellation points are mapped from a constellation that comprises a quadrature amplitude modulation (QAM) constellation.

13. The apparatus of claim 8, wherein the codeword includes information bits and parity bits, and wherein the information bits comprise two bits for each of the symbols, and wherein the un-coded bits comprise log₂(M)−

2 bits for each of the symbols, where M is a number of the points in the QAM constellation.