High-speed syndrome calculation

• US 6,058,500 A
• Filed: 01/20/1998
• Issued: 05/02/2000
• Est. Priority Date: 01/20/1998
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: 3Com Corporation (HP Inc.)
• Inventors: Mantri, Ravi G., DesJardins, Philip A.
• Primary Examiner(s): De Cady, Albert
• Assistant Examiner(s): GREENE, JASON E
• Application Number:
  US09/009,480
• Time in Patent Office: 833 Days
• Field of Search: 714/785, 714/781, 714/782, 714/784
• US Class Current: 714/781
• CPC Class Codes: H03M 13/151 using error location or error correction polynomials

Abstract

A method and device for calculating syndromes used in forward-error-correction codes. To calculate syndromes more quickly using a computer with memory access latency, the polynomial equation C(X) is divided by a generator polynomial G(X) to form a remainder polynomial R(X). The remainder polynomial R(X) is then used to speed the calculation of the syndromes. A method of dividing a Nth order dividend polynomial by a 2R order divisor polynomial is also described. In addition, to further speed the calculation of syndromes, the generating polynomial is split into a number of sub-polynomials G_j (X) to yield a number of remainder sub-polynomials R_j (X) used to calculate the syndromes. Calculation of syndromes using evaluation by Horner'"'"'s rule and a generalization thereof is also described.

Claims

1. A method of calculating a syndrome using a dividend polynomial, a generator polynomial, and a pre-computed multiplication table of the products of the generator polynomial stored in the memory of a programmable computer comprising the steps of:

calculating a remainder polynomial from the division of the dividend polynomial by the generator polynomial using the pre-computed multiplication table, the remainder polynomial being of lower order than the generator polynomial;

calculating the syndrome using the lower-order remainder polynomial and the generator polynomial;

splitting the generator polynomial into a plurality of generator sub-polynomials, the generator sub-polynomial being factors of the generator polynomial; and

dividing by the plurality of generator sub-polynomials to form a plurality of remainder sub-polynomials;

wherein a computation time of the step of calculating the remainder polynomial depends primarily on the order of the dividend polynomial.

2. The invention of claim 1 wherein the generator polynomial is a polynomial of the order 2R and the remainder polynomial is a polynomial of the order 2R-1.

3. The invention of claim 1 further comprising the step of augmenting the dividend polynomial with a plurality of zero coefficients.

4. The invention of claim 1 wherein the step of calculating the syndrome comprises the step of dividing the remainder polynomial by a first order polynomial which is a factor of the generator polynomial.

5. The invention of claim 4 wherein the step of calculating the syndrome is performed 2R times by a plurality of different first order polynomials to form a plurality of syndromes.

6. The invention of claim 5 wherein the step of calculating the syndrome is performed 2R times by a plurality of 2R first order polynomials to form a plurality of 2R syndromes.

7. The invention of claim 1 wherein the step of calculating the remainder polynomial further comprises an iterative procedure comprising the step of:

multiplying the generator polynomial to form a product of the generator polynomial using the multiplication table stored in computer memory; and

subtracting the product of the generator polynomial from a remainder to form a new remainder;

multiplying the generator polynomial to form a new product using the multiplication table stored in computer memory; and

subtracting the new product from the new remainder to form a newer remainder;

wherein the iterative procedure continues until the product of the generator polynomial can no longer be subtracted from the remainder from the previous iteration.

8. The invention of claim 7, the multiplying steps comprising the step of accessing the pre-computed multiplication table stored in computer memory, wherein the access of the multiplication table involves a latent memory operation taking more than one computer clock cycle to complete.

9. The invention of claim 7 wherein the subtracting step from a previous iteration is performed by the computer processor during a time when the latent memory operation is accessing the multiplication table for the next iteration.

10. The invention of claim 1 wherein the programmable computer comprises a computer memory requiring several clock cycles to return a result of a memory access.

11. The invention of claim 1 wherein the step of splitting the generator polynomials splits the generator polynomial into a plurality of J generator sub-polynomials, and wherein the step of dividing forms a plurality of J remainder sub-polynomials.

12. The invention of claim 11 comprising J equal to 4.

13. The invention of claim 11 comprising J equal to 8.

14. The invention of claim 11 comprising J equal to 16.

15. The invention of claim 11 wherein the generator polynomial is split into a plurality of J generator sub-polynomials having unequal order.

16. The invention of claim 1 wherein the step of calculating the syndrome is performed using polynomial long division of the remainder sub-polynomials by the appropriate first order factors of the generator sub-polynomials.

17. The invention of claim 1 wherein the step of calculating the syndrome comprises polynomial evaluation of the remainder sub-polynomials at the appropriate values of the generator sub-polynomials.

18. The invention of claim 17 where the step of calculating the syndrome comprising polynomial evaluation evaluates a plurality of remainder sub-polynomials simultaneously.

19. The method of claim 1 wherein the step of calculating the syndrome comprises polynomial evaluation using Horner'"'"'s rule, wherein the polynomial evaluation using Horner'"'"'s rule comprises the steps of:

splitting the remainder polynomial equation into a plurality of remainder sub-polynomial equations;

simultaneously evaluating the remainder sub-polynomial equations; and

summing the evaluation results of the remainder sub-polynomial equations to obtain the evaluation of the polynomial.

20. The method of claim 1 wherein the polynomial is a Galois field polynomial.

21. The method of claim 1 wherein evaluating the sub-polynomial requires a latent memory access.

22. A device for calculating a polynomial to form a plurality of syndromes for decoding transmitted data comprising:

a polynomial division means for calculating a remainder polynomial from the division of the polynomial with a generator polynomial to calculate a remainder polynomial of lower order than the generator polynomial; and

a polynomial calculation means for evaluating said remainder polynomial at the plurality of first order factors of the generator polynomial to form a plurality of syndromes, wherein the polynomial calculation means further comprises;

a splitter for splitting the remainder polynomial into a plurality of sub-polynomial equations;

a plurality of accumulators in communication with the splitter for evaluating the sub-polynomial equations of the remainder polynomial;

an adder in communication with a corresponding one of the plurality of accumulators for adding to the sub-polynomial equations in the plurality of accumulators;

a multiplier in communication with a corresponding one of the plurality of accumulators for multiplying the sub-polynomial equations in the plurality of accumulators;

control logic to control the adder and multiplier to carry out Horner'"'"'s rule on the sub-polynomials;

a final multiplier in communication with a corresponding one of a plurality of accumulators for multiplying accumulator values; and

a summer in communication with final multiplier values and yield the result of the polynomial evaluation.

23. The device of claim 22 wherein the polynomial comprises polynomial coefficients corresponding to received symbols in a data transmission system.

24. The device of claim 22 wherein the generator polynomial comprises a 2R order polynomial.

25. The device of claim 22 wherein the remainder polynomial comprises a 2R-1 order polynomial.

26. The device of claim 22 wherein the polynomial calculation means comprises a pre-computed multiplication table of the products of the first order factors of the generator polynomial.

27. The device of claim 26 wherein the pre-computed multiplication table is stored in computer memory requiring a memory latency to access the pre-computed multiplication table.

28. The device of claim 26 wherein the pre-computed multiplication table does not include storing the most significant bit symbol of the products of the first order polynomials.

29. The device of claim 22 wherein the first order factors of the generator polynomials are primitive elements of a Galois field.

30. The device of claim 22 wherein the polynomial calculation means performs a polynomial division of the remainder polynomial by the first order factors of the generator polynomial.

31. The device of claim 22 wherein the polynomial calculation means performs a polynomial evaluation of the remainder polynomial at the first order factors of the generator polynomial.

32. The device of claim 22 wherein the polynomial calculation means performs polynomial evaluation using Horner'"'"'s Rule.

33. The device of claim 22 wherein the plurality of syndromes are used in a forward-error-correction data transmission system to correct errors in transmitted data.

34. The device of claim 33 wherein the data transmission system comprises a modem.

35. The device of claim 33 wherein the data transmission system comprises is an asymmetric digital subscriber loop.

36. The device of claim 22 wherein the plurality of accumulators for evaluating the sub-polynomial equations simultaneously evaluate a plurality of sub-polynomial equations.

37. The device of claim 22 wherein the multiplierying means comprises a multiplication look-up table stored in memory.

38. The device of claim 22 wherein the adder comprises Exclusive-OR logic.

39. The device of claim 22 wherein the control means logic comprises programmed software.

40. The device of claim 22 wherein the control logic comprises digital logic hardware.

41. The device of claim 22 wherein the plurality of accumulators comprise locations in computer memory.

42. The device of claim 22 wherein the plurality of accumulators comprise computer processor registers.

43. The device of claim 22 wherein the sub-polynomial equations comprise a first sub-polynomial equation having even-order terms and a second sub-polynomial equation having odd-order terms.

44. The device of claim 22 wherein the sub-polynomial equations comprise a plurality of sub-polynomial equations appropriate for the number of the clock cycles required to access the multiplication table.

45. A method of calculating a syndrome using a dividend polynomial, a generator polynomial, and a pre-computed multiplication table of the products of the generator polynomial stored in the memory of a programmable computer comprising the steps of:

calculating a remainder polynomial from the division of the dividend polynomial by the generator polynomial using the pre-computed multiplication table, the remainder polynomial being of lower order than the generator polynomial; and

calculating the syndrome using the lower-order remainder polynomial and the generator polynomial;

wherein the step of calculating the remainder polynomial further comprises an iterative procedure comprising the steps of;

multiplying the generator polynomial to form a product of the generator polynomial using the multiplication table stored in computer memory;

subtracting the product of the generator polynomial from a remainder to form a new remainder;

multiplying the generator polynomial to form a new product using the multiplication table stored in computer memory;

subtracting the new product from the new remainder to form a newer remainder; and

repeating the iterative procedure continues until the product of the generator polynomial can no longer be subtracted from the remainder from the previous iteration;

wherein the subtracting step from a previous iteration is performed by the computer processor during a time when the latent memory operation is accessing the multiplication table for the next iteration.