Method of equalising a channel and apparatus therefor

• US 20060203899A1
• Filed: 01/31/2006
• Published: 09/14/2006
• Est. Priority Date: 02/03/2005
• Status: Abandoned Application

• Current Assignee: Avago Technologies General IP PTE Limited (Broadcom, Inc.)
• Original Assignee: Avago Technologies General IP PTE Limited (Broadcom, Inc.)
• Inventors: Gee, David Martin
• Application Number:
  US11/344,337
• Publication Number:
  US 20060203899A1
• Time in Patent Office: Days
• US Class Current: 375/232
• CPC Class Codes: H04L 2025/03484 time-recursive
• CPC Class Codes: H04L 2025/03611 Iterative algorithms
• CPC Class Codes: H04L 2025/03662 to a fixed value
• CPC Class Codes: H04L 2025/03681 Control of adaptation
• CPC Class Codes: H04L 25/0305 using blind adaptation

Abstract

In the field of optical communications, a number of techniques are known for channel equalisation. However, these techniques are, for various different technical and/or economic reasons, unsuitable for application in relation to optical communications at a data rate of 10 Gbps. Consequently, the present invention provides a dithered linear search algorithm adapted to change tap weights (45, 75) of a filter (15) in accordance with a heuristic tap modification scheme.

Claims

1. A method of equalising a channel by adapting tap coefficients of a filter, the method comprising the steps of:

setting the tap coefficients to a seed solution, the seed solution being a minimum iteration distance from a set of plausible solutions;

making a heuristic change to the tap coefficients; and

measuring a link quality associated with an output signal resulting from the heuristic change to the tap coefficients.

2. A method as claimed in claim 1, further comprising the step of:

generating cumulative-type vector information by integrating data corresponding to the heuristic change to the tap coefficients.

3. A method as claimed in claim 2, wherein the cumulative-type vector information is DLS-type vector information.

4. A method as claimed in claim 2, wherein the data corresponding to the heuristic change to the tap coefficients is correlated the output signal.

5. A method as claimed in claim 2, further comprising the step of:

applying a correction factor to a gradient of the cumulative-type vector information.

6. A method as claimed in claim 1, further comprising the step of:

retaining the heuristic change in response to the link quality having improved.

7. A method as claimed in claim 6, further comprising the step of:

making another similar heuristic change.

8. A method as claimed in claim 6, further comprising the step of:

repeating the heuristic change to the tap coefficients.

9. A method as claimed in claim 1, further comprising the steps of:

discarding the heuristic change in response to the link quality not having improved; and

making a different heuristic change to the tap coefficients.

10. A method as claimed in claim 1, further comprising the step of:

using an Minimum Square Error (MSE) function to measure the link quality.

11. A method as claimed in claim 10, further comprising the step of:

changing a quantiser gain for the MSE function in response to tap coefficients over- or under-flowing.

12. A method as claimed in claim 1, the method further comprising the step of:

varying each of the tap coefficients in turn once the filter has substantially converged to the channel.

13. A method as claimed in claim 1, wherein the heuristic change comprises the step of:

heuristically varying up to a maximum of a predetermined number of the tap coefficients.

14. A method as claimed in claim 1, further comprising the step of:

limiting the quantum of change to any given tap coefficient to a predetermined number of Least Significant Bits (LSB).

15. A method as claimed in claim 14, wherein the predetermined number of LSBs is one.

16. A method as claimed in claim 1, further comprising the step of:

randomly discarding a predetermined proportion of changes to be made.

17. A method as claimed in claim 1, further comprising the step of:

prohibiting changes to the tap coefficients that result in overflow or wrap-around of one or more of the taps.

18. A method as claimed in claim 1, wherein the taps comprise a cursor tap and the method further comprises the steps of:

identifying the cursor taps and whether the value of a tap coefficient corresponding to the cursor tap exceeds a maximum or falls below a minimum predetermined value;

varying a gain in relation to the link quality measure in response the value of the tap coefficient corresponding to the cursor tap exceeding the maximum or falling below the minimum predetermined value.

19. A computer program element comprising computer program code means to make a computer execute the method as claimed in claim 1.

20. A computer program element as claimed in claim 19, embodied on a computer readable medium.

21. An apparatus for equalising a communications channel, the apparatus comprising:

a filter for receiving a bit stream, the filter comprising taps; and

a processing resource arranged to set, when in use, coefficients of the taps to a seed solution, the seed solution being a minimum iteration distance from a set of plausible solutions, and make a heuristic change to the tap coefficients of the filter;

wherein the processing resource is further arranged to measure, when in use, a link quality associated with an output signal resulting from the heuristic change to the tap coefficients.

23. An adaptive equaliser apparatus comprising the apparatus for equalising a communications channel as claimed in claim 22.

24. An optical receiver comprising the apparatus for equalising a communications channel as claimed in claim 22.

25. A method of equalising a channel substantially as hereinbefore described with reference to accompanying FIGS. 2 to 17.

26. An apparatus for equalising a communications channel substantially as hereinbefore described with reference to accompanying FIGS. 1 to 17.