Method and apparatus for fast retraining of ethernet transceivers based on trickling error

Information

  • Patent Grant
  • 11115151
  • Patent Number
    11,115,151
  • Date Filed
    Friday, March 22, 2019
    6 years ago
  • Date Issued
    Tuesday, September 7, 2021
    3 years ago
Abstract
A method of operation for an Ethernet transceiver is disclosed. The method includes operating the Ethernet transceiver in a data mode, and triggering a fast retrain sequence of steps based on trickling error information. The triggering includes detecting error information, averaging the detected error information over a time interval to generate the trickling error information, comparing the averaged detected error information to a selected threshold value, and initiating the fast retrain sequence of steps based on the comparing.
Description
TECHNICAL FIELD

The disclosure herein relates to communications systems, and more specifically to high-speed Ethernet systems and methods.


BACKGROUND

Modern high-speed Ethernet protocols, such as 10GBASE-T and NBASE-T, rely on adaptive filters and digital signal processing circuitry to address noise that may affect the Ethernet link. Prior to operation of the link in an “online” mode, the link undergoes autonegotiation and a full training sequence to place the link in an initial state that's capable of overcoming the noise. While operating in the “online” mode, the link may briefly go “offline” due to extraneous alien crosstalk or other noise. Fast retrain sequences may bring the link back online in a very short period of time without the need to carry out a full training sequence.


Conventional standardized fast retraining sequences are generally triggered by a predefined error threshold, such as a given number of consecutive frame errors, regardless of the time interval over which those consecutive errors occur. While such a trigger may be beneficial in some situations, the lack of flexibility in triggering based on other forms of error information over a selectable time interval may be undesirable.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the disclosure are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:



FIG. 1 illustrates a high-level transmitter/receiver (transceiver) channel architecture for an NBASE-T Ethernet transceiver.



FIG. 2 illustrates a high-level flow diagram of general steps employed during operation of the Ethernet transceiver of FIG. 1.



FIG. 3 illustrates a graph showing multiple time interval windows, and the numbers of consecutive errors during those windows.



FIG. 4 illustrates a flowchart of steps for one embodiment of a method for performing a fast retrain sequence for a link based on an averaged trickling error.





DETAILED DESCRIPTION


FIG. 1 is a block diagram illustrating one embodiment of a communication system 100. The system includes a first transceiver integrated circuit (IC) or chip 102 and a second transceiver chip 104 that can communicate with each other. The first transceiver 102 includes “transceiver components” including one or more transmitters TXA-TXD and one or more receivers RXA-RXD. Similarly, the second transceiver 104 includes various transceiver components including one or more transmitters TXE-TXH and one or more receivers RXE-RXH. The transmitters TXA-TXH shown in FIG. 1 can be considered individual “transmitters,” as typically referenced herein, or can be considered individual transmitter channels which a transmitter block within the transceiver can independently transmit signals on. Similarly, receivers RXA-RXH can be considered individual “receivers,” as typically referenced herein, or can alternately be considered individual receiver channels which a receiver block within the transceiver can independently receive signals on. The transmitters and receivers are connected to one or more components (not shown) of a computer system, device, processor, or other “controller” associated with each respective transceiver which wants to communicate data over the communication network. For example, the transmitters receive data and control signals from the controller connected to the first transceiver 102 in order to send the data over the network to other transceivers and controllers, while the receivers receive data from other transceivers and controllers via the network in order to provide the data to the controller connected to the first transceiver 102.


The first transceiver chip 102 can communicate with the second transceiver chip 104 over one or more communication channels of a communication link 106. In one embodiment, such as one similar to the 10GBASE-T and NBASE-T Ethernet standards, four communication channels are provided on the communication link 106, each channel including a twisted pair cable. Thus, in that standard, there are four transmitters TX and four corresponding receivers RX provided in each of the transceivers 102 and 104, each transmitter associated with one of the local near-end receivers in the same transceiver, and each such transmitter/receiver pair dedicated to one channel used for duplex communication. A transmitter/receiver pair in the first transceiver 102 communicates across a channel of the link 106 to a far-end transmitter/receiver pair in the second transceiver 104. A transmitter TX and a receiver RX that are connected to the same channel/link, or two transceivers connected by the communication link 106, are considered “link partners.” In accordance with the 10GBASE-T standard, the transmitters cooperate with precoders (not shown), and more specifically Tomlinson-Harashima precoders (THP) that apply THP coefficients to transmit signals to pre-compensate for channel imperfections and expected noise/distortion.


An interface 108 can be provided in the first transceiver chip 102 and an interface 110 can be provided in the second transceiver chip 104 to allow data transmissions between the transceivers to be routed to the appropriate transceiver blocks. For example, the interfaces 108 and 110 can include transformers, and circuitry used for directing signals or data (alternatively, some or all circuitry can be included in other components, such as transmitters TX and receivers RX).


For one embodiment, the interface 108 for each chip includes training logic 112 that manages and controls rapid retrain operations, as more fully explained below. The training logic associated with the interface 108 may be shared amongst the channels, or provided as separate resources for each of the transceiver channels.


Referring to FIG. 2, in one embodiment, the Ethernet transceiver 100 undergoes a full training prior to entering a data mode of operation. The full training involves a predefined sequence of stages or steps known by each of the link partners, although the boundaries of each step in the sequence may be overlapped or blurred in some embodiments. The sequence typically occurs at a predefined point of operation, such as at startup when a transceiver is powered on or is first connected to a communication link. During nominal operation, after the full training sequence, the transceiver continues to adapt parameters to changing characteristics of the link based on received data. However, some characteristics change so quickly that the receiver cannot adapt quickly enough, due to noise, interference, or other disturbances, which sometimes cause the loss of the link. In existing standards, the full training sequence is used to re-train transceiver parameters when a transceiver loses a communication link in a manner such that a fast retrain sequence cannot bring up the link.


Further referring to FIG. 2, the full training process, generally designated 200, may optionally first include a calibration process, at 202. The calibration process is typically not part of a communication standard, but is often employed to allow the transceiver components to operate near optimal condition. For example, the calibration process may include calibration of analog front end (AFE) components of the transceiver such as a digital-to-analog converter (DAC), line driver, low pass filter, gain stage, and analog-to-digital converter (ADC). For some embodiments, the calibration does not occur only in step 202, but may continue to occur during parts or all of the training or retraining sequence.


With continued reference to FIG. 2, the full training 200 includes an autonegotiation step, at 204. The autonegotiation step involves having the link partners communicate across the communication link to establish the common conditions under which normal data communication will operate. For example, the autonegotiation step can include determining which communication standard to use (10GBASE-T, NBASE-T, etc.), and determining which link partner will be the Master and which one will be the Slave (the Slave recovers timing information from the Master needed for communication). Additional information such as support for fast retrains may also be advertised between the link partners.


Following the autonegotiation step, full training-specific steps are then carried out, at 206, to properly adapt various filters. Depending on the embodiment, the full training sequence may involve PAM-2 signaling sequences, precoder coefficient determinations, and PAM-16 signaling sequences. Once the training sequences are complete, the link may enter a data mode of operation, at 208.


Operation of the link in a normal operation mode, after a full training sequence, often runs very well in transferring data at very high data rates without interruption. In some situations, however, extraneous noise such as crosstalk or interference may prevent the link from transferring data optimally. The link may monitor for extraneous noise by determining whether a quality metric is met, such as at 210. If detected noise is greater than a trigger threshold, then restoring the link to optimal operation may involve a fast retrain, at 212, which involves retraining the link with fewer steps than a full retrain, and which is far faster (on the order of 30 milliseconds, instead of two full seconds).


Conventionally, a standardized fast retrain is triggered when forty consecutive frame errors are detected. At data rates of 10 Gbps and 5 Gbps, the forty consecutive frame errors may define a time window of approximately 320 ns. At a data rate of 2.5 Gbps, the forty consecutive frame errors may define a time window of approximately 640 ns. FIG. 3 illustrates a graph of frame error information versus time. The conventional consecutive error trigger may initiate a fast retrain due to a spike in errors, such as at 302, resulting from, for example, alien crosstalk caused by an RFI source adjacent an Ethernet cable. However, other more widely dispersed errors (referred to herein as “trickling error”) may occur that may undesirably affect the link without causing a fast retrain to optimize the link. Further, some applications may successfully tolerate a short interval interrupt without the need for a fast retrain. In many circumstances, error information averaged over a user-programmed time interval provides a beneficial compromise in link error tolerance over an acceptable time interval.


Referring now to FIG. 4, one embodiment of a flexible fast retrain method, generally designated 400, provides a programmable trigger mechanism for fast retrains that balances the tolerance levels for different applications between short interrupt scenarios and relatively constant trickling error streams. The method generally runs during the data mode of operation, and involves detecting error information indicative of signal-to-noise ratio (SNR), at 402. For some embodiments, the error information may include one from a variety of error predictors or indicators, such as LDPC error codes, consecutive error frames, or LDPC loop iterations, to name but a few. For one embodiment, the IEEE standard fast retrain error threshold of 40 consecutive error frames may be employed as a worst-case threshold, at 404, in determining whether to initiate a fast retrain. Other embodiments may exclude this threshold entirely. If the worst-case threshold isn't met, then the detected error information may be averaged over a selected time interval, at 406. Referring back to FIG. 3, averaging the error information over a first time interval T1 such as between t1 and t2 results in a much higher value than an average of the error information over a second time interval T2 between t1 and t3. Having the flexibility to smooth the error detection process in this manner may add finer granularity to the fast retrain triggering process by providing a triggering threshold between a perfect channel and a worst-case error threshold.


Further referring to FIG. 4, once the averaging of the error information is complete, then it is compared to a pre-programmed sub-metric to determine whether a fast retrain should be initiated, at 408. If the value exceeds the sub-metric, then the fast retrain process begins, at 410. The steps involved in a fast retrain may involve one or more PAM2 sequences, PAM16 sequences, filter coefficient updating, etc., without the need for an autonegotiation process. One embodiment of a detailed fast-retrain process is described in copending U.S. patent application Ser. No. 16/362,479, entitled: “RAPID TRAINING METHOD FOR HIGH-SPEED ETHERNET,” filed Mar. 22, 2019, owned by the assignee of the instant application, and expressly incorporated by reference in its entirety herein.


Those skilled in the art will appreciate the benefits and advantages provided by the embodiments described herein. By adding flexibility to the fast retrain triggering process, finer granularity and control in maintaining an optimal link may be achievable for a wider range of Ethernet applications.


When received within a computer system via one or more computer-readable media, such data and/or instruction-based expressions of the above described circuits may be processed by a processing entity (e.g., one or more processors) within the computer system in conjunction with execution of one or more other computer programs including, without limitation, net-list generation programs, place and route programs and the like, to generate a representation or image of a physical manifestation of such circuits. Such representation or image may thereafter be used in device fabrication, for example, by enabling generation of one or more masks that are used to form various components of the circuits in a device fabrication process.


In the foregoing description and in the accompanying drawings, specific terminology and drawing symbols have been set forth to provide a thorough understanding of the present invention. In some instances, the terminology and symbols may imply specific details that are not required to practice the invention. For example, any of the specific numbers of bits, signal path widths, signaling or operating frequencies, component circuits or devices and the like may be different from those described above in alternative embodiments. Also, the interconnection between circuit elements or circuit blocks shown or described as multi-conductor signal links may alternatively be single-conductor signal links, and single conductor signal links may alternatively be multi-conductor signal links. Signals and signaling paths shown or described as being single-ended may also be differential, and vice-versa. Similarly, signals described or depicted as having active-high or active-low logic levels may have opposite logic levels in alternative embodiments. Component circuitry within integrated circuit devices may be implemented using metal oxide semiconductor (MOS) technology, bipolar technology or any other technology in which logical and analog circuits may be implemented. With respect to terminology, a signal is said to be “asserted” when the signal is driven to a low or high logic state (or charged to a high logic state or discharged to a low logic state) to indicate a particular condition. Conversely, a signal is said to be “deasserted” to indicate that the signal is driven (or charged or discharged) to a state other than the asserted state (including a high or low logic state, or the floating state that may occur when the signal driving circuit is transitioned to a high impedance condition, such as an open drain or open collector condition). A signal driving circuit is said to “output” a signal to a signal receiving circuit when the signal driving circuit asserts (or deasserts, if explicitly stated or indicated by context) the signal on a signal line coupled between the signal driving and signal receiving circuits. A signal line is said to be “activated” when a signal is asserted on the signal line, and “deactivated” when the signal is deasserted. Additionally, the prefix symbol “I” attached to signal names indicates that the signal is an active low signal (i.e., the asserted state is a logic low state). A line over a signal name (e.g., ‘<signal name>’) is also used to indicate an active low signal. The term “coupled” is used herein to express a direct connection as well as a connection through one or more intervening circuits or structures. Integrated circuit device “programming” may include, for example and without limitation, loading a control value into a register or other storage circuit within the device in response to a host instruction and thus controlling an operational aspect of the device, establishing a device configuration or controlling an operational aspect of the device through a one-time programming operation (e.g., blowing fuses within a configuration circuit during device production), and/or connecting one or more selected pins or other contact structures of the device to reference voltage lines (also referred to as strapping) to establish a particular device configuration or operation aspect of the device. The term “exemplary” is used to express an example, not a preference or requirement.


While the invention has been described with reference to specific embodiments thereof, it will be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. For example, features or aspects of any of the embodiments may be applied, at least where practicable, in combination with any other of the embodiments or in place of counterpart features or aspects thereof. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A method of operation for an Ethernet transceiver, the method comprising: operating the Ethernet transceiver in a data mode;selecting a time interval for monitoring error information; andtriggering a fast retrain sequence by detecting error information during the time interval,averaging at least two non-consecutive frame errors in the detected error information over the time interval to generate trickling error information,comparing the trickling error information to a selected threshold value, andperforming the fast retrain sequence-based on the comparing.
  • 2. The method according to claim 1, wherein the error information comprises an error predictor.
  • 3. The method according to claim 1, wherein the error information comprises Low-Density Parity Check (LDPC) error code information.
  • 4. The method according to claim 1, wherein the error information comprises LDPC loop iteration information.
  • 5. The method according to claim 1, further comprising: operating the Ethernet transceiver in accordance with an NBASE-T Ethernet protocol.
  • 6. The method according to claim 1, further comprising: prior to operating the Ethernet transceiver in the data mode, performing a full training sequence.
  • 7. An integrated circuit (IC) Ethernet transceiver chip comprising: training logic to trigger a fast retrain sequence during a data mode, the training logic including error detection circuitry to detect error information,circuitry to average at least two non-consecutive frame errors in the detected error information over a user-selected time interval to generate trickling error information,comparison circuitry to compare the trickling error information to a selected threshold value, andcircuitry to perform the fast retrain sequence based on the comparing.
  • 8. The IC Ethernet transceiver chip according to claim 7, wherein the error information comprises an error predictor.
  • 9. The IC Ethernet transceiver chip according to claim 7, wherein: the error detection circuitry comprises low density parity check (LDPC) decoding circuitry.
  • 10. The IC Ethernet transceiver chip according to claim 7, wherein the error information comprises Low-Density Parity Check (LDPC) error code information.
  • 11. The IC Ethernet transceiver chip according to claim 7, wherein the error information comprises LDPC loop iteration information.
  • 12. The IC Ethernet transceiver chip according to claim 7, realized as an NBASE-T IC Ethernet transceiver chip.
  • 13. A method of operation for an Ethernet transceiver, the method comprising: operating the Ethernet transceiver in a data mode;selecting a time interval for monitoring error information;establishing a consecutive frame error threshold and a trickling error threshold;detecting error information;averaging at least two non-consecutive frame errors in the error information over the time interval to generate trickling error information, andtriggering a fast retrain sequence based on a comparison of the trickling error information during the time interval to the consecutive frame error threshold and the trickling error threshold.
  • 14. The method according to claim 13, wherein the detecting error information comprises: detecting an error predictor.
  • 15. The method according to claim 14, wherein the error predictor is based on a detected signal-to-noise ratio (SNR) along a channel coupled to the Ethernet transceiver.
US Referenced Citations (135)
Number Name Date Kind
3506906 Nestor Apr 1970 A
3671859 Miller Jun 1972 A
5680400 York Oct 1997 A
5832032 Overbury Nov 1998 A
5995566 Rickard et al. Nov 1999 A
5995567 Cioffi et al. Nov 1999 A
6052385 Kanerva Apr 2000 A
6052420 Yeap Apr 2000 A
6081523 Merchant et al. Jun 2000 A
6101216 Henderson Aug 2000 A
6121890 Rao Aug 2000 A
6137829 Betts Oct 2000 A
6195360 Raza et al. Feb 2001 B1
6345071 Hamdi Feb 2002 B1
6377640 Trans Apr 2002 B2
6385315 Viadella et al. May 2002 B1
6467092 Geile et al. Oct 2002 B1
6532277 Ulanskas et al. Mar 2003 B2
6690739 Mui Feb 2004 B1
6711207 Amrany et al. Mar 2004 B1
6734659 Fortner May 2004 B1
6922448 Jacobsen et al. Jul 2005 B1
6924724 Grilo et al. Aug 2005 B2
6959056 Yeap et al. Oct 2005 B2
7026730 Marshall et al. Apr 2006 B1
7027407 Diepstraten et al. Apr 2006 B2
7106833 Kerpez Sep 2006 B2
7113491 Graziano et al. Sep 2006 B2
7123117 Chen et al. Oct 2006 B2
7158563 Ginis et al. Jan 2007 B2
7200180 Verbin et al. Apr 2007 B2
7315592 Tsatsanis et al. Jan 2008 B2
7324511 Nishihara Jan 2008 B2
RE40149 Vitenberg Mar 2008 E
7353007 Carballo et al. Apr 2008 B2
7492840 Chan Feb 2009 B2
7525992 Shachal Apr 2009 B1
7567620 Rozental Jul 2009 B2
7593431 Lo et al. Sep 2009 B1
7646699 Tellado et al. Jan 2010 B2
7656956 King Feb 2010 B2
7664254 Bostoen et al. Feb 2010 B2
7693240 Mezer Apr 2010 B2
7697408 Schneider et al. Apr 2010 B2
7708595 Chow et al. May 2010 B2
7720075 Costo May 2010 B2
7738482 Thousand et al. Jun 2010 B2
7782852 Tellado et al. Aug 2010 B2
7860020 Taich et al. Dec 2010 B2
7936778 Ungerboeck et al. May 2011 B2
8112646 Tsai Feb 2012 B2
8196016 Langner et al. Jun 2012 B1
8201005 Wertheimer et al. Jun 2012 B2
8276013 Diab et al. Sep 2012 B2
8284799 Diab Oct 2012 B2
8320411 Sedarat et al. Nov 2012 B1
8442099 Sederat May 2013 B1
8520562 Taich et al. Aug 2013 B2
8665902 Powell Mar 2014 B2
8804582 Taich et al. Aug 2014 B1
8804793 Wu Aug 2014 B2
8804798 Malkin et al. Aug 2014 B2
8854986 Langner Oct 2014 B1
9001872 Farjadrad Apr 2015 B1
9130695 Dalmia Sep 2015 B1
9294355 Edwards Mar 2016 B2
9893756 Sedarat Feb 2018 B1
10069521 Farjadrad Sep 2018 B1
10148508 Sedarat Dec 2018 B1
20020006167 McFarland Jan 2002 A1
20020119783 Bourlas et al. Aug 2002 A1
20020180547 Staszewski Dec 2002 A1
20030026282 Gross Feb 2003 A1
20030040298 Heatley Feb 2003 A1
20030156603 Rakib Aug 2003 A1
20030186591 Jensen et al. Oct 2003 A1
20030223505 Verbin et al. Dec 2003 A1
20040023631 Deutsch et al. Feb 2004 A1
20040114503 Schneider et al. Jun 2004 A1
20040184810 Spilman et al. Sep 2004 A1
20040239465 Chen et al. Dec 2004 A1
20050025266 Chan Feb 2005 A1
20050030808 Brown et al. Feb 2005 A1
20050053229 Tsatsanis et al. Mar 2005 A1
20050055467 Campana et al. Mar 2005 A1
20050058152 Oksanen et al. Mar 2005 A1
20050152466 Maltsev et al. Jul 2005 A1
20050245216 Boos Nov 2005 A1
20050259685 Chang et al. Nov 2005 A1
20060109784 Weller et al. May 2006 A1
20060153106 Laakso et al. Jul 2006 A1
20060153307 Brown et al. Jul 2006 A1
20060159186 King Jul 2006 A1
20060215561 Wang et al. Sep 2006 A1
20060274824 Kroninger Dec 2006 A1
20070076722 Ungerboeck et al. Apr 2007 A1
20070081475 Telado Apr 2007 A1
20070140289 Tellado et al. Jun 2007 A1
20070162818 Shen et al. Jul 2007 A1
20070192505 Dalmia Aug 2007 A1
20070248024 Conway et al. Oct 2007 A1
20080034137 Whitby-Strevens Feb 2008 A1
20080089433 Cho et al. Apr 2008 A1
20080187028 Lida Aug 2008 A1
20080294919 Lida et al. Nov 2008 A1
20080310432 Ranjan Dec 2008 A1
20090080459 Barkan et al. Mar 2009 A1
20090097389 Diab Apr 2009 A1
20090097401 Diab Apr 2009 A1
20090097442 Diab Apr 2009 A1
20090150745 Langner et al. Jun 2009 A1
20090154455 Diab Jun 2009 A1
20090187778 Diab Jul 2009 A1
20090148161 Walker Aug 2009 A1
20090282277 Sedarat Nov 2009 A1
20100046543 Parnaby Feb 2010 A1
20100054315 Huang Mar 2010 A1
20100075704 McHenry et al. Mar 2010 A1
20100111202 Schley-May et al. May 2010 A1
20100115295 Diab May 2010 A1
20100188980 Desai et al. Jul 2010 A1
20100220612 Ikematsu Sep 2010 A1
20100322105 Diab Dec 2010 A1
20110051620 Taich Mar 2011 A1
20110206042 Rarrab Aug 2011 A1
20110249686 Langner Oct 2011 A1
20110249687 Diab Oct 2011 A1
20110261814 Matthews Oct 2011 A1
20120063295 Bliss Mar 2012 A1
20120106345 Diab May 2012 A1
20120170591 Diab et al. Jul 2012 A1
20120188894 Huschke et al. Jul 2012 A1
20130070823 Malkin et al. Mar 2013 A1
20140258813 Lusted Sep 2014 A1
20160308742 Bains Oct 2016 A1
Foreign Referenced Citations (1)
Number Date Country
WO2000021204 Apr 2000 WO
Non-Patent Literature Citations (9)
Entry
U.S. Appl. No. 12/977,844, filed Dec. 23, 2010, Sedarat.
U.S. Appl. No. 14/961,810, Sedarat.
Ken Christense et al., IEEE 802.3az The Road to Energy Efficient Ethernet, IEEE Communications Magazine, Nov. 2010, 7 Pages.
Hugh Barrass, EEE Exchange of Management Information, IEEE 802.3az EEE Task Force, Mar. 2009, Vancouver, British Columbia, 11 Pages.
Zimmerman et al., IEEE Power Backoff, Solarflare, Teranetics, Feb. 19, 2005, 12 pages.
Zimmerman et al., IEEE Power Backoff, Mar. 15, 2005, 16 pages.
Nariman Yousefi, Multi Rate PHY, IEEE Meeting Slides, Jul. 2003, 14 pages.
Zhang et al; IEEE Apr. 2010; pp. 843-855; “An Efficient 10GBASE-T Ethernet LDPC Decoder Design with Low Error Floors”.
Mankar et al.; ACEEE, Proc of Intl. Conf. on Recent Trends in Information, Telecommunication and Computing, ITC; 5 pages; “Algorithms and Architectures for Reduced Complexity LDPC Decoding”.