Method and apparatus for efficient fast retraining of ethernet transceivers

Information

  • Patent Grant
  • 10771100
  • Patent Number
    10,771,100
  • Date Filed
    Friday, March 22, 2019
    6 years ago
  • Date Issued
    Tuesday, September 8, 2020
    4 years ago
Abstract
A method of operation for an Ethernet transceiver is disclosed. The method includes entering a fast retrain sequence of steps. The fast retrain sequence of steps includes transferring two-level symbols to a link partner; and directly following transferring of the two-level symbols, transferring multi-level symbols to the link partner, the multi-level symbols having greater than two symbol levels.
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 fast retraining sequences for high-speed Ethernet links generally take approximately 30 milliseconds. For many applications, such time durations for retraining functions 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 one embodiment of an FIR (finite impulse response) implementation of the correlated noise canceller for use with the receiver circuits of FIG. 1.



FIG. 3 illustrates a flow diagram of one embodiment of a method of cancelling correlated noise.





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 Ethernet standard, 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.


Further referring to FIG. 1, each of the receiver circuits includes a correlated noise canceller, such as canceller CNCA for receiver RXA. As more fully described below, the correlated noise cancellers enable faster retrain sequences by enabling a receive side of a link to cancel interference resulting from alien crosstalk or noise without resorting to a need for changing and exchanging precoder THP coefficients during the fast retrain sequence.


Referring to FIG. 2, in one embodiment, each correlated noise canceller 200 is realized as an adaptive filter that continually adapts, and more particularly a finite impulse response (FIR) filter. While the structure and operation of FIR filters are generally well-known to those skilled in the art, FIG. 2 illustrates a high-level implementation that includes a plurality of delay elements D0-Dn, for delaying respective data samples. A number of taps T0-Tn corresponding to the delay elements are respectively coupled to delay output nodes. The taps receive respective weights or coefficients h0-hn+1 that represent factors applied to a sequence of data samples. A summing circuit 202 receives weighted samples, averages them, and outputs a filtered value.


The length of the adaptive filter, or number of samples to evaluate and average to determine an output, is selectable for a user depending on the application involved. Implications involving amplifier gain may warrant the use of only one sample (weighted with a gain or tap value of 1) or many samples (weighted with a corresponding number of low-gain values). Generally, however, the longer the filter, the less correlation in the noise, and correspondingly less predictability. As discussed below, high gain values may have a tendency to promote error propagation, and possibly cause filter non-convergence.


A variety of algorithms may be employed to derive values for the selected number of tap weights, or coefficients. Least mean squares (LMS) and minimum mean square error are 2 of well known algorithms. One variant to adapt the coefficients is to “regularize” the filter by utilizing a least squares algorithm, as is well-known in the art. As an example, one might use the least squares algorithm to find a solution that minimizes gain for the coefficients. Another possible algorithm to employ is the least mean squares method, which provides a leakage term that allows each adaptation step to “leak” a little bit away from the result so that the output doesn't grow too large too fast (thus, avoiding a high gain situation). In a further embodiment, the taps may have programmable saturation levels to maximize tap gain levels. Further details regarding the circuitry and function of one embodiment of a correlated noise canceller may be found in U.S. Pat. No. 8,861,663, titled “Correlated Noise Canceller For High-Speed Ethernet Receivers”, filed Jan. 13, 2012, assigned to the Assignee of the present disclosure, and expressly incorporated by reference herein in its entirety.


In operation, the receiver circuits described above take advantage of the fact that correlated noise, such as that typically associated with RFI, may be predictable in many cases based on historical statistics. Thus, by sampling correlated noise over time, and assuming that the sampled noise is correlated between samples, evaluating the history of the noise may be a reliable predictor of future noise. Further, by predicting the future noise, it can be filtered/canceled from a current sample to enhance the signal fidelity of the system. Note that the use of the term “cancellation” is not meant to require a complete cancellation of a target signal, but rather a significant mitigation or reduction of the target signal that provides the advantages noted herein.


Referring now to FIG. 3, one embodiment of a fast retrain method, generally designated 300, provides multiple fast retrain modes of operation in an Ethernet transceiver that can enable a fast link recovery for a link affected by a change in noise or some other undesirable distortion characteristic. In response to detecting a drop in link quality, such as a minimum SNR or rate of LDPC error frames or other LDPC statistics, a fast retrain sequence may be initiated, at 302. As noted above, a fast retrain is a brief link training sequence that resets a minimal number of link parameters to allow for changes in link parameters without necessarily requiring the link to go offline for a full auto-negotiation and training cycle, which may take a few seconds.


Further referring to FIG. 3, in one embodiment, the fast retrain sequence may first provide a PAM2-THP transmission sequence, at 304. During the PAM2-THP sequence, a PAM-2 training signal is transmitted with precoding, using appropriate coefficients and other parameters. The precoding applied to the PAM-2 signal allows the far-end receiver to retune its filters for the potential difference between optimal operating points with and without the precoding, so that the same adaptation can be used during normal transmission. For some embodiments, the PAM2-THP step may be omitted entirely, such as disclosed in copending U.S. patent application Ser. No. 16/362,479; titled “RAPID TRAINING METHOD FOR HIGH-SPEED ETHERNET”, filed Mar. 22, 2019, assigned to the Assignee of the present disclosure, and expressly incorporated herein by reference in its entirety. Following the PAM2-THP sequence, a determination may be made as to whether the receiver can recover the link by itself, without a THP coefficient exchange, at 306. The determination may be based on an evaluation of how far off the new precoder coefficients are from prior coefficients, and so forth.


With continued reference to FIG. 3, in the case where the receiver cannot recover the link by itself, then newly updated THP coefficients may be exchanged between link partners and the receiver synchronized with precoded transmission data from the far-end link partner transmitter, at 308. In other embodiments, other signal types, modulations, or formats can be used for training signals as appropriate.


Further referring to FIG. 3, following the THP coefficient exchange, a transition period occurs, at 312, to allow the link to transition from transmitting the precoded PAM-2 signals, to transmitting a multi-PAM type of signal having characteristics more closely resembling those actually used during nominal operation, such as a PAM-16 or DSQ128 signal. After the transition period, actual PAM-16 training signals encoded with the THP coefficients, and modulated via a DSQ128 type of modulation may be transmitted, at 314. After sending the PAM-16 training signal for an appropriate time to adapt the filters, equalizers, timing, and other components, the training sequence ends and normal operation begins, in which actual data is transmitted and received over the link as PAM-16 signals.


While the “legacy” fast retrain mode described above works well for its intended applications, the time expended to carry out the coefficient exchange step at 308 may take up a significant portion of the timing budget allotted to each fast retrain sequence.


With the above in mind, should the receiver be able to recover the link by itself, at step 306, one embodiment provides for a reduced-processing fast retrain mode, beginning at 316, that omits the legacy THP coefficient exchange step. This is possible due to the filtering activities of the correlated noise cancellers, which are receive-side adaptive filters that do not utilize transmit-side THP coefficients. This results in a significant training time reduction. Note that in some embodiments, a separate “legacy” mode of fast retraining may not be provided as a separate mode from the reduced-processing training mode.


With further reference to FIG. 3, for some embodiments, and after confirming that the signal quality meets a certain threshold, a communication between link partners in the reduced-processing training mode is carried out, at 316. This is carried out so that the partners are synchronized in knowing that the reduced-processing fast retrain mode will be followed, instead of the legacy mode. This communication may be made by, for example, an InfoField protocol that includes one or more bits flagging use of the reduced-processing training mode.


Following the communication step, at 316, and an associated transition time, at 320, the reduced-processing mode goes straight to a PAM-16THP step, at 322, to run a training sequence of THP-encoded PAM-16 signals.


By eliminating the THP coefficient exchange step, a fast retrain sequence may be shortened significantly. Since fast retrains may occur often during normal operation of the link, repetitive fast retrain sequences of shorter duration saves appreciable time.


Those skilled in the art will appreciate the benefits and advantages provided by the embodiments described herein. Reducing fast retraining steps for high speed Ethernet transceivers minimizes link downtime while improving processing efficiency.


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 “/” 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: entering a fast retrain sequence of steps, the fast retrain sequence of steps including transferring two-level symbols to a link partner without transferring Tomlinson-Harashima Precoder (THP) coefficient information; anddirectly following transferring of the two-level symbols, transferring multi-level symbols to the link partner, the multi-level symbols having greater than two symbol levels.
  • 2. The method according to claim 1, wherein the transferring two-level symbols to a link partner comprises: selectively transferring uncoded two-level symbols to a link partner; andselectively transferring coded two-level symbols to the link partner.
  • 3. The method according to claim 2, wherein the coded two-level symbols are encoded in accordance with Tomlinson-Harashima Precoder (THP) coefficients.
  • 4. The method according to claim 1, further comprising: informing the link partner to proceed directly to transferring the multi-level symbols following the transferring of the two-level symbols.
  • 5. The method according to claim 4, wherein the informing is carried out via an InfoField protocol.
  • 6. The method according to claim 1, wherein: the two-level symbols comprise PAM-2 symbols; andthe multi-level symbols comprise PAM-16 symbols.
  • 7. The method according to claim 1, further comprising: during the fast retrain sequence of steps, cancelling correlated noise received by a receiver with a correlated noise canceller.
  • 8. An integrated circuit (IC) Ethernet transceiver chip comprising: receiver circuitry including correlated noise canceller circuitry; andtraining logic to control a fast retrain sequence, the fast retrain sequence including a transfer of uncoded two-level symbols to a link partner;a transfer of coded two-level symbols to the link partner following the transfer of the uncoded two-level symbols without transferring Tomlinson-Harashima Precoder (THP) coefficient information; anddirectly following the transfer of the coded two-level symbols, the training logic to control a transfer of multi-level symbols to the link partner, the multi-level symbols having greater than two symbol levels.
  • 9. The IC Ethernet transceiver chip of claim 8, wherein the transfer of two-level symbols comprises: a transfer of uncoded two-level symbols to a link partner; anda transfer of coded two-level symbols to the link partner.
  • 10. The IC Ethernet transceiver chip according to claim 9, wherein: the coded two-level and multi-level symbols are encoded in accordance with a Tomlinson-Harashima Precoder (THP) encoding.
  • 11. The IC Ethernet transceiver chip according to claim 8, wherein: the two-level symbols comprise PAM-2 symbols; andthe multi-level symbols comprise PAM-16 symbols.
  • 12. The IC Ethernet transceiver chip according to claim 8, realized as an NGBASE-T IC Ethernet transceiver chip.
  • 13. A method of operation for an Ethernet transceiver, the method comprising: for a first mode of operation, performing a training sequence by transferring two-level symbols to a link partner; anddirectly following transferring of the two-level symbols, transferring multi-level symbols to the link partner, the multi-level symbols having greater than two symbol levels; andfor a second mode of operation, performing the training sequence by transferring uncoded two-level symbols to a link partner;exchanging updated precoder coefficients with the link partner,transferring coded two-level symbols to the link partner, the coding consistent with the updated precoder coefficients, andtransferring multi-level symbols to the link partner, the multi-level symbols encoded consistent with the exchanged updated precoder coefficients and having greater than two symbol levels.
  • 14. The method according to claim 13, wherein for the first mode of operation, the transferring two-level symbols to a link partner comprises: selectively transferring uncoded two-level symbols to a link partner; andselectively transferring coded two-level symbols to the link partner.
  • 15. The method according to claim 13, wherein a selection between using the first mode of operation or the second mode of operation is based on a signal quality parameter.
  • 16. The method according to claim 13, wherein the precoder encoding comprises: a Tomlinson-Harashima Precoder (THP) encoding.
  • 17. The method according to claim 13, wherein the first mode of operation further comprises: informing the link partner to proceed directly to transferring the multi-level symbols following the transferring of the coded two-level symbols to the link partner.
  • 18. The method according to claim 17, wherein the informing is carried out via an InfoField protocol.
US Referenced Citations (131)
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
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
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
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
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”.