Method and apparatus for detecting transmission errors for digital subscriber lines

• US 20060083323A1
• Filed: 07/20/2005
• Published: 04/20/2006
• Est. Priority Date: 10/15/2004
• Status: Abandoned Application

• Current Assignee: 2Wire, Inc. (CommScope Holding Company, Inc.)
• Original Assignee: 2Wire, Inc. (CommScope Holding Company, Inc.)
• Inventors: Sedarat, Hossein, DesJardins, Philip
• Application Number:
  US11/185,614
• Publication Number:
  US 20060083323A1
• Time in Patent Office: Days
• US Class Current: 375/260
• CPC Class Codes: H04L 1/0061 Error detection codes
• CPC Class Codes: H04L 1/0065 Serial concatenated codes
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27

Abstract

A multi-carrier communication system receives a plurality of data frames comprised of a plurality of bit groups in a data stream of a multi-carrier communication system, wherein one or more data frames are corrupt data frames, and corrects each corrupt data frame.

Claims

1. A method, comprising:

receiving a plurality of data frames comprised of a plurality of bit groups in a data stream of a multi-carrier communication system, wherein one or more data frames are corrupt data frames; and

correcting each corrupt data frame.

2. The method of claim 1, wherein correcting further comprises determining if there are one or more errors within each of the plurality of data frames by:

receiving N-T data bytes and T first error check bytes in each data frame, wherein the T first error check bytes is associated with the N-T data bytes prior to transmission;

generating T error check bytes using the N-T data bytes received; and

comparing the received T first error check bytes with the T second error check bytes to determine which of the plurality of data frames are the corrupt data frames.

3. The method of claim 2, wherein generating T second error check bytes comprises performing a complimentary operation on the N-T data bytes received.

4. The method of claim 3, wherein the complimentary operation comprises a binary polynomial division of the N bytes received.

5. The method of claim 4, wherein the remainder of the binary polynomial division is compared against a known value.

6. The method of claim 5, wherein a data frame is not corrupt if the remainder is equal to the known value.

7. The method of claim 5, wherein a data frame is corrupt if the remainder is not equal to the known value.

8. The method of claim 5, wherein the known value is zero.

9. The method of claim 2, wherein generating T second error check bytes comprises:

generating a receiver-generated CRC (cyclic redundancy checksum) value using the N-T data bytes received for each frame, wherein the T error check bytes received correspond to a transmit CRC value generated prior to the transmission of the N-T data bytes for each frame; and

comparing the receiver-generated CRC value to the received copy of the transmit CRC value to determine if there is an error within each of the plurality of data frames.

10. The method of claim 9, wherein the CRC is at least one of an 8-bit, 16-bit, or 32-bit CRC.

11. The method of claim 2, further comprising:

generating a first plurality of flag values corresponding to a first plurality of bit groups for each corrupt data frame of the plurality of data frames to a first value; and

generating a second plurality of flag values corresponding to a second plurality of bit groups for each non-corrupt data frame of the plurality of data frames to a second value.

12. The method of claim 11, further comprising:

de-interleaving the first and the second plurality of bit groups corresponding to the corrupt and non-corrupt data frames to generate a plurality of de-interleaved bit groups; and

de-interleaving the first and the second plurality of flag values corresponding to the first and the second plurality of bit groups to generate a plurality of de-interleaved flag values.

13. The method of claim 12, further comprising, correcting the first plurality of bit groups corresponding to one or more corrupt data frames by decoding the plurality of de-interleaved bit groups using the plurality of de-interleaved flag values and erasure decoding.

14. The method of claim 13, wherein the erasure decoding is Reed-Solomon erasure decoding.

15. The method of claim 1, wherein the multi-carrier communication system is an xDSL communication system.

16. The method of claim 15, wherein the xDSL communication system comprises at least one of ADSL or VDSL.

17. A machine readable medium having embodied thereon an instruction set, the instruction set being executable by a machine to perform operations comprising:

receiving a plurality of data frames comprised of a plurality of bit groups in a data stream of a multi-carrier communication system, wherein one or more data frames are corrupt data frames; and

correcting each corrupt data frame.

18. The machine readable medium of claim 17, further comprising determining if there are one or more errors within each of the plurality of data frames by:

receiving N-T data bytes and T first error check bytes in each data frame, wherein the T first error check bytes is associated with the N-T data bytes prior to transmission;

generating T second error check bytes using the N-T data bytes received; and

comparing the received T first error check bytes with the T second error check bytes to determine which of the plurality of data frames are the corrupt data frames.

19. The machine readable medium of claim 18, wherein generating the T second error check bytes comprises performing a complimentary operation on the N-T data bytes received.

20. The machine readable medium of claim 19, wherein the complimentary operation comprises a binary polynomial division of the N-T data bytes received.

21. The machine readable medium of claim 20, wherein the remainder of the binary polynomial division is compared against a known value.

22. The machine readable medium of claim 21, wherein a data frame is not corrupt if the remainder is equal to the known value.

23. The machine readable medium of claim 21, wherein a data frame is corrupt if the remainder is not equal to the known value.

24. The machine readable medium of claim 21, wherein the known value is zero.

25. The machine readable medium of claim 18, wherein generating the T second error check bytes comprises:

generating a receiver-generated CRC (cyclic redundancy checksum) value using the N-T data bytes received for each frame, wherein the T first error check bytes received correspond to a transmit CRC value generated prior to the transmission of the N-T data bytes for each frame; and

comparing the receive CRC value to the transmit CRC value to determine if there is an error within each of the plurality of data frames.

26. The machine readable medium of claim 18, further comprising:

generating a first plurality of flag values corresponding to a first plurality of bit groups for each corrupt data frame of the plurality of data frames to a first value; and

generating a second plurality of flag values corresponding to a second plurality of bit groups for each non-corrupt data frame of the plurality of data frames to a second value.

27. The machine readable medium of claim 26, further comprising:

de-interleaving the first and the second plurality of bit groups corresponding to the corrupt and non-corrupt data frames to generate a plurality of de-interleaved bit groups; and

de-interleaving the first and the second plurality of flag values corresponding to the first and the second plurality of bit groups to generate a plurality of de-interleaved flag values.

28. The machine readable medium of claim 27, further comprising, correcting the first plurality of bit groups corresponding to corrupt data frames by decoding the plurality of de-interleaved bit groups using the plurality of de-interleaved flag values and erasure decoding.

29. An apparatus, comprising:

a receiver to receive a plurality of data frames comprised of a plurality of bit groups in a data stream of a multi-carrier communication system;

a corrupted frame detector to detect one or more corrupt data frames of the plurality of data frames; and

a decoder to decode the plurality of bit groups comprising the plurality of data frames received and to correct each corrupt bit group corresponding to the detected one or more corrupt data frames.

30. The apparatus of claim 29, wherein to detect, the corrupted frame detector further to:

receive N-T data bytes and T first error check bytes in each data frame, wherein the T first error check bytes is associated with the N-T data bytes prior to transmission;

generate T second error check bytes using the N-T data bytes received; and

compare the received T first error check bytes with the T second error check bytes to determine which of the plurality of data frames are the corrupt data frames.

31. The apparatus of claim 30, wherein to generate the T second error check bytes, the corrupted frame detector to perform a complimentary operation on the N-T data bytes received.

32. The apparatus of claim 30, wherein to generate T second error check bytes, the corrupted frame detector to generate a receive CRC (cyclic redundancy checksum) value using the N-T data bytes received for each frame, wherein the T error check bytes received correspond to a transmit CRC value generated prior to the transmission of the N data bytes for each frame, and to compare the receive CRC value to the transmit CRC value to determine if there is an error within each of the plurality of data frames.

33. The apparatus of claim 30, wherein the corrupted frame detector further to generate a first plurality of flag values corresponding to a first plurality of bit groups for each corrupt data frame of the plurality of data frames to a first value, and to generate a second plurality of flag values corresponding to a second plurality of bit groups for each non-corrupt data frame of the plurality of data frames to a second value.

34. The apparatus of claim 33, further comprising:

a de-interleaver to de-interleave the first and the second plurality of bit groups corresponding to the corrupt and non-corrupt data frames to generate a plurality of de-interleaved bit groups, and to de-interleave the first and the second plurality of flag values corresponding to the first and the second plurality of bit groups to generate a plurality of de-interleaved flag values.

35. The apparatus of claim 34, wherein the de-interleaver is a dual field de-interleaver comprised of a flag bit de-interleaver and a bit group de-interleaver, wherein at least one of the flag bit de-interleaver and the bit group de-interleaver is implemented in software and the other implemented in hardware.

36. The apparatus of claim 34, wherein the decoder further to correct the first plurality of bit groups corresponding to corrupt data frames by decoding the plurality of de-interleaved bit groups using the plurality of de-interleaved flag values and erasure decoding.

37. The apparatus of claim 36, wherein the erasure decoding algorithm is a Reed-Solomon erasure decoding algorithm.