Fast skew detector

Abstract

Signal processing apparatus, including a circuit which processes signals received on multiple channels so as to extract therefrom at least first and second sequences of symbols, and a FIFO, which receives and stores at least one bit of each of the symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval.

Description

FIELD OF THE INVENTION

[0002] The present invention relates generally to data communication, and specifically to communicating data using multiple physical lines.

BACKGROUND OF THE INVENTION

[0003] As communication speeds have increased, the demands to transmit signals over existing infrastructures have become significantly harder to meet. Four twisted pair Ethernet cabling, originally conceived for conveying signals at 1 or 10 Mb/s, is now required to convey signals at rates of the order of 1 Gb/s. Inter alia, the increased throughput leads to increased processing requirements for received signals as well as increased impairment of the received signals.

[0004] An IEEE standard 802.3ab, published by the Institute of Electronic and Electrical Engineers, New York, N.Y., describes an Ethernet protocol wherein data may be transmitted as five-level pulse amplitude modulation (PAM-5) signals over category-5 cables, comprising four pairs of twisted wires. The data may be transmitted in a full-duplex mode at rates of the order of 1 Gb/s. As in most data transmission systems, signal degradation along a transmission path means that signal recovery becomes increasingly more difficult as the path length increases, and/or as the rate of transmission increases. In particular, recovering the clocks for such degraded signals is a significant problem as signal frequencies increase, both because of the increased degradation of the signals and also because of the reduced time available for processing the signals.

[0005] In a paper by Mueller and Muller, “Timing recovery in digital synchronous data receivers,” IEEE Transactions on Communications, pp 516-531, Vol. 24, May 1976, the authors propose a timing recovery algorithm. The paper is accepted in the art as the basis for timing recovery algorithms, and relies on selecting a timing function of a best sampling point. The phase of the sampling point is then adjusted until its timing function is zero.

[0006] U.S. Pat. No. 6,192,072, to Azadet et al., whose disclosure is incorporated herein by reference, describes a parallel processing decision feedback equalizer (DFE) which may be applied to recovering the clocks from IEEE 802.3ab signals transmitted on four pairs of wires. The method relies on multiple clock domains, respective clock recovery being performed on each pair of wires.

[0007] With the increase of data speeds, receivers operating at the increased frequencies increasingly suffer from extraneous noise introduced into the data transmission lines. The receivers require filters to reduce the effects of such noise. However, filters known in the art occupy considerable chip area, and also consume significant amounts of power.

[0008] Transmitting signals over more than one line inherently incurs the risk that the received signals may be skewed, i.e., that signals which are transmitted simultaneously are received at different times. The time difference between the lines is termed the skew of the signal, and the skew must first be corrected before the original signal can be recovered. (IEEE standard 802.3ab states that for systems operating under the standard the skew shall not exceed 50 ns.) Typically, methods known in the art for correcting the skew rely on a trial and error approach. An originally matched set of symbols from a transmitter is received on different lines, and different delays are inserted into each of the lines until the received symbols match. However, using this method consumes considerable time before the skew is determined.

[0009] A further problem in determining skew is that the receiver may not know exactly which matched symbols are transmitted. For example, IEEE standard 802.3ab defines a variable loc_rcvr_status, which flags whether the status of an overall receive link is satisfactory or not. The matched symbols from the transmitter differ depending on the value of loc_rcvr_status. If the receiver does not know which value of loc_rcvr_status the transmitter is using, the receiver must test for both situations; if a trial and error approach is used the time before the skew is determined is further lengthened.

SUMMARY OF THE INVENTION

[0010] It is an object of some aspects of the present invention to provide a fast method to determine skew in a signal received on a plurality of channels.

[0011] In preferred embodiments of the present invention, a transmitter conveys symbols over multiple channels to a receiver. The transmitter determines sets of respective symbols to be transmitted simultaneously on the multiple channels according to a predetermined protocol. Because of the use of multiple transmission lines, skew may occur between the symbols in a set, as occurs in multi-channel Gigabit Ethernet transmission, for example. Symbols from respective channels are stored in cells of respective columns of a first-in-first-out (FIFO) memory of the receiver, which must de-skew the symbols in order to properly decode the transmitted data stream.

[0012] In order to enable the receiver to de-skew the symbols, the transmitter transmits a known start-up sequence of symbols on all the channels. One of the channels is chosen as a reference channel, and the receiver decodes the sequence of symbols on the reference channel. Symbols transmitted on the reference channel are stored in a reference column of the FIFO. Symbols transmitted on the one or more non-reference channels are stored in respective columns of the FIFO. Alternatively, a part of the symbols is stored in the FIFO columns. The columns of the FIFO overlap by an interval that accommodates a maximum skew permitted by the protocol.

[0013] A first symbol from the reference column generates, via the protocol, expected symbols for the one or more non-reference columns. The expected symbols are compared with each of the symbols stored in the non-reference FIFO columns and the results of the comparison are stored in an elimination memory. The memory records matches and non-matches between the expected symbols and each of the symbols stored in the non-reference FIFO columns, as well as positions of the matches in the columns. Symbols in the FIFO are then advanced by one cell, and a second symbol from the reference column generates a second set of expected symbols for the non-reference columns. The second set of expected symbols are compared with the symbols in the non-reference FIFO columns which correspond with matches from the first comparison, and further non-matches are recorded in the memory. The process of advancing the symbols in the FIFO by one cell, and recording further non-matches cumulatively, continues until there is only one match for each non-reference column in the elimination memory.

[0014] For each non-reference column, the position of its remaining match gives the skew of the respective non-reference channel. The process of comparing stored symbols and storing the comparisons in a cumulative manner, as described above, leads to a very fast determination of the skew of the channel.

[0015] In some preferred embodiments of the present invention, the start-up sequence of symbols may be dependent on a communication mode of the transmitter and/or the receiver. If the mode is initially unknown to the receiver, the first symbol generates expected symbols for all possible modes of the one or more non-reference channels, and comparisons are made as described above until there is only one match for each non-reference column in the elimination memory. In addition to determining the skew, each match now also indicates the mode for the respective non-reference channel.

[0016] There is therefore provided, according to a preferred embodiment of the present invention, signal processing apparatus in a data receiver for receiving communication signals from a transmitter over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, the signal processing apparatus including:

[0017] an input circuit, which is coupled to process the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols;

[0018] a first-in-first-out (FIFO) memory, which is coupled to the input circuit so as to receive and store at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval;

[0019] a symbol predictor, which is adapted, based on the predetermined relation between the first and second symbols, to determine for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval; and

[0020] comparison logic, which is adapted to compare the expected value with the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a relative skew between the first and at least the second channel.

[0021] Preferably, the comparison logic generates, for each comparison performed by the logic, one of a matched and a non-matched result, and the logic includes an elimination memory array wherein are stored the results of the comparisons.

[0022] Further preferably, the comparison logic is adapted to perform iterations of the comparisons performed by the logic, wherein for each iteration the logic compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison.

[0023] Preferably, the comparison logic is adapted to perform the iterations until only one matched result remains in the elimination array, and the relative skew is determined from a position of the one matched result in the elimination array.

[0024] Preferably, the FIFO memory includes a first column wherein are stored sequentially the at least one bit of each of the received symbols of the first sequence, and at least one second column wherein are stored sequentially and respectively the at least one bit of each of the received symbols of the at least one second sequence, and wherein for each iteration the comparison logic is adapted to sequentially advance the at least one bit of the first column and the at least one bit of the at least one second column, so as to generate for the symbol predictor the received symbol in the first interval and the at least one bit in the corresponding one of the second symbols in the second interval.

[0025] Preferably, the transmitter and the data receiver are adapted to exist in a plurality of communication modes, and the symbol predictor is adapted to generate a respective plurality of expected values, included in the expected value, in response to the communication modes, and the comparison logic is adapted to determine a communicating state, included in the communication modes, responsive to comparisons between the respective plurality of expected values and the at least one bit of each of the received second symbols in the FIFO memory.

[0026] Preferably, the comparison logic generates, for each comparison performed by the logic, one of a matched and a non-matched result, and the logic includes an elimination memory array wherein are stored the results of the comparisons, and the comparison logic is adapted to perform iterations of the comparisons, wherein for each iteration the logic compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison, and wherein the comparison logic is adapted to perform the iterations until only one matched result remains in the elimination array, and wherein the communicating state is determined from a position of the one matched result in the elimination array.

[0027] Preferably, the at least one second channel comprises three channels, and further preferably, each of the symbols includes a plurality of levels, and the input circuit is adapted to translate the levels to unique bit strings.

[0028] Preferably, the data receiver and the transmitter communicate via a communication protocol which defines a maximum value of the relative skew, and the first interval and the second interval are respective predetermined functions of the maximum value, and an overlap between the first interval and the second interval is a predetermined function of the maximum value.

[0029] There is further provided, according to a preferred embodiment of the present invention, a method for receiving communication signals from a transmitter transmitted over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, including:

[0030] processing the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols;

[0031] receiving and storing in a first-in-first-out (FIFO) memory at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval;

[0032] determining for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval, based on the predetermined relation between the first and second symbols; and

[0033] performing comparisons between the expected value and the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a relative skew between the first and at least the second channel.

[0034] The method preferably also includes generating, for each comparison performed, one of a matched and a non-matched result, and storing the results of the comparisons in an elimination memory array.

[0035] Preferably, the method includes performing iterations of the comparisons, wherein in each iteration the comparison compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison.

[0036] The method preferably also includes performing the iterations until only one matched result remains in the elimination memory array, and the relative skew is determined from a position of the one matched result in the elimination memory array.

[0037] Preferably, the FIFO memory includes a first column wherein are stored sequentially the at least one bit of each of the received symbols of the first sequence, and at least one second column wherein are stored sequentially and respectively the at least one bit of each of the received symbols of the at least second sequence, and the method includes, for each iteration, sequentially advancing the at least one bit of the first column and the at least one bit of the at least one second column, so as to generate the received symbol in the first interval and the at least one bit in the corresponding one of the second symbols in the second interval.

[0038] Preferably, the transmitter is adapted to transmit the communication signals in a plurality of communication modes, and wherein determining for each of the received symbols in the first interval of the first sequence the expected value includes generating a respective plurality of expected values, in response to the communication modes, and determining a communicating state, included in the communication modes, responsive to comparisons between the respective plurality of expected values and the at least one bit of each of the received second symbols in the FIFO memory.

[0039] The method preferably further includes:

[0040] generating, for each comparison performed, one of a matched and a non-matched result;

[0041] storing the results of the comparisons in an elimination memory array;

[0042] performing iterations of the comparisons, wherein each iteration comprises comparing the expected value with the at least one bit of each of the received second symbols that generated the matched result in a previous comparison, until only one matched result remains in the elimination array; and

[0043] determining the communicating state from a position of the one matched result in the elimination array.

[0044] Preferably, the at least one second channel includes three channels.

[0045] Further preferably, each of the symbols includes a plurality of levels, and the method includes translating the levels to unique bit strings.

[0046] Preferably, the communication signals are generated in response to a communication protocol which defines a maximum value of the relative skew, and the first interval and the second interval are respective predetermined functions of the maximum value, and an overlap between the first interval and the second interval is a predetermined function of the maximum value.

[0047] There is further provided, according to a preferred embodiment of the present invention, in a data receiver for receiving communication signals from a transmitter over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, signal processing apparatus, including:

[0048] an input circuit, which is coupled to process the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols;

[0049] a first-in-first-out (FIFO) memory, which is coupled to the input circuit so as to receive and store at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval;

[0050] a symbol predictor, which is adapted, based on the predetermined relation between the first and second symbols, to determine for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval; and

[0051] comparison logic, which is adapted to compare the expected value with the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a communication mode between the transmitter and the data receiver.

[0052] The present invention will be more fully understood from the following detailed description of the preferred embodiments thereof, taken together with the drawings, in which:

BRIEF DESCRIPTION OF THE DRAWINGS

[0053] FIG. 1 is a schematic block diagram of a transceiver, according to a preferred embodiment of the present invention;

[0054] FIG. 2 is a schematic block diagram of a sub-receiver module in the transceiver, according to a preferred embodiment of the present invention;

[0055] FIG. 3 is a schematic block diagram of a fractionally spaced equalizer in the sub-receiver, according to a preferred embodiment of the present invention;

[0056] FIG. 4 is a schematic block diagram of a combined feed forward and blind equalizer in the sub-receiver, according to a preferred embodiment of the present invention;

[0057] FIG. 5 shows configurations for third and fourth taps of the equalizer of FIG. 4, and a configuration of a blind error producer of the equalizer, according to a preferred embodiment of the present invention;

[0058] FIG. 6 is a diagram showing detail of a least mean square coefficients update block of the equalizer of FIG. 4, according to a preferred embodiment of the present invention;

[0059] FIG. 7 is a schematic block diagram of a single tap decision feedback equalizer (DFE) and of a “tail” DFE, according to a preferred embodiment of the present invention;

[0060] FIG. 8 is a schematic block diagram of a coefficient generator, according to a preferred embodiment of the present invention;

[0061] FIG. 9 is a schematic block diagram of a decoder in the transceiver of FIG. 1, according to a preferred embodiment of the present invention;

[0062] FIG. 10 is a schematic diagram of a timing sensors block, according to a preferred embodiment of the present invention;

[0063] FIG. 11 is a schematic diagram of a phase control block, according to a preferred embodiment of the present invention;

[0064] FIG. 12 is a schematic block diagram of a digital signal processing block, according to a preferred embodiment of the present invention,

[0065] FIG. 13 is a schematic block diagram of near-end cross-talk (NEXT) cancellers, an echo canceller, and control logic associated with the cancellers, comprised in the sub-receiver module of FIG. 2, according to a preferred embodiment of the present invention;

[0066] FIG. 14 is a schematic block diagram of an adaptive finite impulse response (FIR) filter, according to a preferred embodiment of the present invention;

[0067] FIG. 15 is a schematic block diagram of an alternative adaptive FIR filter, according to a preferred embodiment of the present invention;

[0068] FIG. 16 is a schematic block diagram of yet another adaptive FIR filter, according to a preferred embodiment of the present invention;

[0069] FIG. 17 is a schematic block diagram of a structure of an adaptive FIR filter, according to a preferred embodiment of the present invention;

[0070] FIGS. 18A and 18B are schematic block diagrams of an echo canceller, according to a preferred embodiment of the present invention;

[0071] FIGS. 19A and 19B are schematic block diagrams of a near-echo filter comprised in the echo canceller of FIGS. 16A and 16B, according to a preferred embodiment of the present invention;

[0072] FIG. 20 is a flowchart illustrating a process followed by a round trip delay (RTD) controller, according to a preferred embodiment of the present invention; and

[0073] FIG. 21 is a schematic block diagram of the NEXT cancellers of FIG. 11, according to a preferred embodiment of the present invention.

[0074] FIG. 22 is a schematic block diagram showing components used in a process for determining skew of signals entering the transceiver of FIG. 1, according to a preferred embodiment of the present invention;

[0075] FIG. 23 is a logical flow diagram which schematically illustrates the process of FIG. 22, according to a preferred embodiment of the present invention;

[0076] FIG. 24 is a flowchart showing steps in the process of FIG. 22, according to a preferred embodiment of the present invention; and

[0077] FIG. 25 is a state diagram illustrating an example of states of a first-in first-out memory and an elimination memory array used in the process of FIG. 22, according to a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0078] Reference is now made to FIG. 1, which is a schematic block diagram of a transceiver 20, according to a preferred embodiment of the present invention. Transceiver 20 is most preferably implemented from one or more custom devices, such as one or more application specific integrated circuits (ASICs). Alternatively, transceiver 20 is implemented from semi-custom or discrete devices, or a combination of custom, semi-custom and/or discrete devices. Transceiver 20 is coupled to a communication line 22, comprising four twisted pairs of conductors preferably implemented as Category 5 cables, so as to transmit and receive data at rates of the order of 1 Gb/s. Alternatively, communication line 22 may be implemented by other methods, known in the art, for conveying data at these rates. The data is transmitted as five-level pulse amplitude modulation (PAM-5) signals, according to an Ethernet protocol described in IEEE standard 802.3ab, each of the pairs of conductors transmitting and receiving data at an effective rate of 250 Mb/s by conveying two-bit symbols at a rate of 125 Msymbols/s. A transformer 24, also known as a magnetics section, acts as a coupling interface between transceiver 20 and line 22.

[0079] Transceiver 20 communicates via line 22 with a remote transceiver 33, which is coupled to the line and which operates according to the Ethernet protocol. Transceiver 33 is preferably implemented substantially as described herein for transceiver 20. Alternatively, transceiver 33 comprises any transceiver which operates according to the Ethernet protocol. As described in the protocol, an initialization phase, when transceivers 20 and 33 are to communicate, comprises an auto-negotiation stage followed by a start-up stage which may include an equalization stage. During these stages, transceivers 20 and 33 agree on which transceiver is to act as a master in the ensuing communication, and which transceiver is to act as a slave. The transceiver which is assigned to be the master starts to transmit immediately. The slave starts to transmit after completing the equalization stage.

[0080] Transceiver 20 consists of a substantially analog section 21, and a substantially digital section 23. Analog section 21 comprises four substantially similar analog transmitter modules 40A, 40B, 40C, and 40D, each of which transmits data to one of the conductor pairs in line 22. Transmitter modules 40A, 40B, 40C, and 40D are also collectively referred to herein as transmitter module 40. Each module 40 receives digital data from a physical coding sub-layer (PCS) 32, and converts the digital data to analog two-bit symbols using a digital to analog converter (DAC) 29 present in each module. The conversion is performed every 8 ns, according to a single 125 MHz clock signal received from a phase locked loop clock generator (PLL) 38, the single clock signal providing a common shared clock domain within which elements of transceiver 20 operate.

[0081] Analog section 21 also comprises four substantially similar analog receiver modules 26A, 26B, 26C, and 26D, each of which receives data from one of the conductor pairs in line 22. Receiver modules 26A, 26B, 26C, and 26D are also collectively referred to herein as receiver module 26. In order to reduce interference between each transmitter module 40 and its corresponding receiver module 26, each transmitter module includes a programmable hybrid circuit 31. The hybrid circuit conveys a delayed portion of a transmitted signal from each transmitter module 40 to the respective receiver module 26, the receiver module using the delayed portion to reduce echo in the received signal. Such methods for reducing echo are known in the art.

[0082] A variable gain amplifier (VGA) 25 in each receiver module 26 receives the signal from its respective conducting pair, and adjusts the signal level to a value suited to a respective following analog to digital converter (ADC) 27. Each ADC 27, preferably a 7 bit flash ADC, receives the 125 MHz clock generated by PLL 38 and performs sampling at 4 ns intervals, so generating two samples for each clock period of 8 ns. The two samples are transferred, in parallel, for processing in digital section 23, as is described below.

[0083] It will be appreciated that by sampling each ADC 27 with the same clock signal, no fluctuation between sampling times of analog receiver modules 26 occurs, not even short-term fluctuations. In contrast, receivers using separate clocks to sample each receiver will of necessity experience at least short-term fluctuations between clock signals. Because of the absence of fluctuations between sampling times, there is substantially no interference between conducting pairs in line 22, and near end cross talk (NEXT) cancellation is thus significantly improved, especially at clock frequencies.

[0084] Raw digitized samples produced by each ADC 27 in receiver modules 26A, 26B, 26C, and 26D are transferred to respective sub-receiver modules 28A, 28B, 28C, and 28D, herein collectively referred to as sub-receiver module 28, in digital section 23. Each sub-receiver 28 processes the raw digitized samples in order, inter alia, to generate initial five-level values for a subsequent decoder 30, common to all sub-receivers. Decoder 30 uses the five-level values to generate a combined output which is transferred to PCS 32, and from there to a Gigabit Media Independent Interface (GMII).

[0085] Each sub-receiver 28 also generates information for controlling attenuation levels of hybrid circuit 31 (in the corresponding transmitter module 40) and VGA 25 (in the corresponding receiver module 26). In addition, each sub-receiver 28 generates information which is used within a digital signal processing (DSP) management block 36 for setting a phase of PLL 38, when transceiver 20 acts as a slave, as is described in more detail below.

[0086] FIG. 2 is a schematic block diagram of sub-receiver module 28, according to a preferred embodiment of the present invention. Each sub-receiver 28 comprises a controller 67 which operates elements of the sub-receiver. Each sub-receiver 28 comprises a first-in-first-out (FIFO) memory 50 which stores the two samples received every 8 ns from respective ADC 27. During operation of transceiver 20, each FIFO 50 is used as a buffer enabling each of the four channels to be approximately aligned before further processing of signals stored in each FIFO is performed. It will be appreciated that such approximate alignment is necessary, since especially for extended runs of line 22, considerable skew, of the order of fifty nanoseconds, may occur between pairs of conductors of line 22. The approximate coarse alignment is provided by an increment/decrement signal from a phase control block 66, described in more detail with reference to FIG. 11. FIFO 50 also receives alignment data from PCS 32. Preferred embodiments of the present invention most preferably use a method for determining skew as described with reference to FIGS. 23-25 below.

[0087] A fractionally spaced interpolator (FSI) 52 receives two samples per symbol, within an 8 ns period, from its respective FIFO 50. The FSI interpolates the two samples, and outputs one interpolated result at a phase derived from phase control block 66. The FSI also provides fine alignment to further correct skew occurring between pairs of conductors. By interpolating the samples, the interpolator improves the signal to noise ratio (SNR) of the signals by 3 dB, and also eliminates clock frequency noise.

[0088] FIG. 3 is a schematic block diagram of FSI 52, according to a preferred embodiment of the present invention. FSI 52 comprises two substantially similar processing blocks 90 and 92, each comprising a pair of multipliers, 96, 100 and 102, 106, feeding respective summers 98 and 104. During each clock cycle of TS=8 ns, FSI 52 receives two samples x(n×TS) and x((n−0.5)×TS) generated in the cycle, and two samples x((n−1)×Ts) and x((n−1.5)×TS) generated in the previous cycle, where n is a whole number and x(p) corresponds to a level of the sample at a time p. FSI 52 also receives a value of an interpolation coefficient “c” from phase control block 66.

[0089] Processing block 90 operates on samples x((n−0.5)×TS), x((n−1)×TS) and x((n−1.5)×TS) to produce an output fse_o2(n×TS) given by equation (1):

fse — o 2=c·x((n−1.5)×TS)+x((n−1)×TS)+c·x((n−0.5)×TS)  (1)

[0090] Processing block 92 operates on samples x(n×TS), x((n−0.5)×TS), and x((n−1)×TS) to produce an output fse_o1(n×TS) given by equation (2):

fse — o 1=c·x((n−1)×TS)+x((n−0.5)×TS)+(1−c)·x(n×TS)  (2)

[0091] A linear interpolation of the four samples is produced by adding fse_o1(n×TS) and fse_o2(n×TS) in a summer 94 to produce an output fse_out(n×TS) given by equation (3):

fse — out=c·x ((n−1.5)×TS)+(1+c)·x((n−1)×TS)+(2−c)·x((n−0.5)×TS)+(1−c)·x(n×TS)  (3)

[0092] Outputs fse_o1(n×TS) and fse_o2(n×TS) are used as control inputs for a timing sensors block 62 (FIG. 2); output fse_out(n×TS) is transferred to an equalizer 54, which performs further filtration on the signal. The outputs are produced every 8 ns.

[0093] The interpolation provided by FSI 52 uses a relatively simple system of interpolation wherein the interpolator, in addition to providing interpolation, acts as a low-pass filter and removes clock frequency noise completely. The filtration provided by FSI 52, when taken with a later adaptive equalizer of transceiver 20, substantially completely equalizes the channel it is operating on. It will be appreciated that the simple implementation of FSI 52, taken together with the later equalizer, provides a complete solution for equalizing the channel.

[0094] FIG. 4 is a schematic block diagram of equalizer 54, according to a preferred embodiment of the present invention. Equalizer 54 comprises a programmable adaptive finite impulse response (FIR) filter, most preferably comprising fourteen taps, which may be implemented as either a blind adaptive equalizer or as a feed forward adaptive equalizer (FFE). A block 186 conceptually represents all taps of the FIR. Equalizer 54 also comprises a least mean squares (LMS) FFE coefficients update block 184 which receives an FFE/Blind control input and, responsive to the control input, provides outputs to block 186 of the filter. The control input is preferably toggled between an FFE value and a Blind value by a selector 183. Selector 183 in turn receives an input from a state machine 69, operated by controller 67, which controls operations of transceiver 20 during start-up of the transceiver. Alternatively, the state machine may be configured to provide the FFE/Blind control input directly, in which case the state machine acts as selector 183.

[0095] The control input configures equalizer 54 to operate as a blind equalizer when the equalizer is beginning to receive communications from remote transceiver 33, i.e., after the initialization phase (described above) between transceiver 20 and transceiver 33 has completed, and during a start-up phase of transceiver 20. The control input configures equalizer 54 to operate as an FFE when conditions in the blind equalizer configuration have stabilized, whereupon transceiver 20 enters an operational phase. Equalizer 54 also comprises a blind error producer 182, which generates a blind error value when the equalizer operates as a blind equalizer.

[0096] FIG. 5 shows configurations for third and fourth taps of equalizer 54, and blind error producer 182, according to a preferred embodiment of the present invention. The third and fourth taps, the latter acting as a main tap, are included in filter taps block 186. For clarity, only registers 208, 212, and 222, corresponding to third, fourth, and fifth time delays for the FIR, are shown in FIG. 5. All other taps of the FIR are preferably configured according to a standard configuration for FIR taps known in the art.

[0097] Initially, when transceiver 20 is not receiving a signal, i.e., when remote transmitters which would normally provide the transceiver with a signal are inactive, all tap coefficients of equalizer 54 are set to zero, apart from fourth tap coefficient c4(n), which is set equal to 4. Setting all tap coefficients to zero, apart from setting the fourth tap coefficient to 4, enables the filter to operate substantially transparently without performing equalization. Thus, coefficient c3(n) is set to a value 0 and is applied via the “0” path of a multiplexer 206 to a multiplier 210. Also, the “0” path of a multiplexer 218 is activated, so that a summer 214 is used.

[0098] FIG. 6 is a diagram showing detail of LMS coefficients update block 184 of equalizer 54, according to a preferred embodiment of the present invention. Block 184 updates coefficients in equalizer 54, when the equalizer operates as a blind equalizer or as an FFE equalizer, using an input ξ(n). Operating as a blind equalizer, an absolute value of ξ(n) is generated in an absolute-value device 230, and paths “0” in multiplexers 232 and 234 are followed, multiplexer 234 receiving a blind error signal generated from a summer 202 (FIG. 5), as described below. Operating as an FFE equalizer, paths “1” are followed, multiplexer 234 receiving an error signal from a slicer 58, via a baseline wander (BLW) canceller 68, three near end cross-talk (NEXT) cancellers 70 (each for the non-corresponding transmitters 40 of transceiver 20) and an echo canceller 72 for the corresponding transmitter of the transceiver. BLW canceller 68 may be implemented as any canceller known in the art. NEXT cancellers 70 and echo canceller 72 are described below with reference to FIGS. 13-21. Slicer 58 is also described in more detail below. The values from multiplexers 232 and 234 are fed to a multiplier 236 which also receives a value of a constant μblind or μffe, depending whether the equalizer is operated as a blind or an FFE equalizer. In a preferred embodiment of the present invention, μffe has an approximate value of 2−7, and μblind has an approximate value of 2−5.

[0099] Multiplier 236 outputs its value to a summer 238, a register 240 which provides a time delay and which feeds back to the summer, and a fixed point transformation (FPT) converter 242 to give a final coefficient output ci(n+1):

c i (n+1)=ci(n)+μtype·err(n)·ξ(n)  (4)

[0100] where

[0101] i is a coefficient index and n is a time index;

[0102] μtype is μblind or μffe, according to the operational state of the equalizer;

[0103] err(n) is the blind or the FFE error signal; and

[0104] ξ(n) is the signal value ν(n), after time n, derived from time delays such as delay 208 or 212 (FIG. 5).

[0105] Returning to FIGS. 2, 4 and 5, when a signal is initially received, equalizer 54 operates as a blind equalizer and searches for optimal initial coefficients ffe_coeffi(n), which are then used to operate the equalizer as an FFE equalizer. In the blind equalizer, summer 214 generates a difference signal ν(n−1)—ν(n), from signals ν(n) and ν(n−1) after delays 208 and 212 respectively. The difference signal is used as ξ(n−1) in equation (4), as is also shown in FIG. 5. The difference signal is multiplied by c4(n) in a multiplier 216, and the result, y(n), is transferred via a summer 220 to blind error producer 182. The value y(n) is given by:

y (n)=ξ(n)·c3(n)+[ν(n−1)−ν(n)]·c4(n)  (5)

[0106] where the terms on the right side of equation (5) correspond to the output from multipliers 210 and 216 respectively.

[0107] In producer 182 a blind error, err(n), is determined by subtracting a threshold THLD value from |y(n)| (|y(n)| is generated in device 200) in a summer 202:

err (n)=|y(n)|−THLD  (6)

[0108] The value of THLD is set according to whether the particular sub-receiver 28 comprising equalizer 54 operates as a master or as a slave. If the sub-receiver operates as a master THLD is set to be approximately 1.8. If the sub-receiver operates as a slave, THLD is set to be approximately 1.7.

[0109] Coefficient c3(n) is updated using equation (4). Coefficient c4(n) is modified using “differential” adaptation based on a value of (ν(n−1)—ν(n)), as shown in equation (5).

[0110] Equalizer 54 continues to operate as a blind equalizer until coefficients generated by the equalizer have converged to approximately constant values. At this point the equalizer is converted to an FFE equalizer by allowing paths “1” in multiplexer 206 and 218 to be followed, and by using the following transformations at the time of change-over:

ffe — coeff 3 (n)=c3(n)—c4(n),

ffe — coeff 4 (n)=c4(n),

ffe — coeff i (n)=0, i≠3,4.  (7)

[0111] Returning to FIG. 2, equalizer 54 provides an output (after delay 222 (FIG. 5) and subsequent delays) to a first summer 56. Summer 56 adds correcting factors to the output, and generates a “soft” decision, corresponding to a first approximation of the received signal level. The correcting factors are received from the BLW, NEXT, and Echo cancellers, and from a “tail” decision feedback equalizer (DFE) 60, described in more detail below. The soft decision is input to decoder 30, and is also adjusted in a second summer 57, which receives feedback from a single tap DFE 59, and the adjusted first approximation is transferred to slicer 58. Slicer 58 compares levels received from second summer 57 with ideal levels corresponding to 2, 1, 0, −1, and −2, and chooses the closest of these as a “hard” decision level. Slicer 58 also calculates an error value between the level received from summer 56 and the hard output level. The hard decisions are used as an input to single tap DFE 59 and tail DFE 60, and also for adaptation. The error signal is used as a feedback input to equalizer 54, as described above, and also to tail DFE 60.

[0112] Equalizer 54, when operating as an FFE equalizer, removes all the inter-symbol interference (ISI) caused by the symbol transmitted two cycles ago, i.e., the symbol prior to an immediately previous symbol. This allows each sub-receiver 28 to have a DFE without a second tap, i.e., having a second coefficient set effectively to zero, as is described in more detail below with respect to FIG. 7. In addition to reducing hardware, setting the second coefficient of the DFE to zero simplifies the complexity of multiple DFEs comprised in decoder 30 by a factor of five, compared to implementations where the second coefficient of the DFE is non-zero, as is also explained in more detail below with respect to FIG. 9.

[0113] FIG. 7 is a schematic block diagram of single tap DFE 59 and tail DFE 60, according to a preferred embodiment of the present invention. DFE 59 and DFE 60 respectively comprise a first single tap section and a second multi-tap “tail” section of a combined DFE 65. DFE 65 receives preliminary equalized output from slicer 58 and provides further equalization in the form of feedback to summers 56 and 57, in response.

[0114] Single tap 59 comprises a summer 244 and a multiplier 246. Multiplier 246 receives a hard decision from slicer 58 and a first coefficient C1, and their product is input to summer 244 after a delay of a single clock cycle. Summer 244 also receives the delayed output of tail DFE 60, via a register 61, as described below. The summer's output is used as an input to summer 57.

[0115] DFE 60 comprises ten substantially similar taps, a third tap to a twelfth tap, the third and fourth taps receiving respective preliminary decisions P3, P4, from a Viterbi decoder in decoder 30, the fifth and sixth taps receiving a preliminary decision P5, and the seventh to twelfth taps receiving a preliminary decision P6. Each tap comprises a summer 248, and a multiplier 250 which also receives a coefficient C3, . . . , C12. The output of tail DFE 60 is provided, via a register 61 providing a time delay, to summer 56 wherein it is subtracted. The delayed output of DFE 60 is also provided to single tap DFE 59. A second tap 63 of combined DFE 65 has a coefficient set to zero, so that the second tap of the combined DFE comprises substantially only a time delay, with no coefficient multiplication.

[0116] FIG. 8 is a schematic block diagram of a coefficient generator 252, according to a preferred embodiment of the present invention. (A generator generally similar to generator 252 may be used for Echo canceller 72 and/or for NEXT cancellers 70.) Each of coefficients C1, C3, . . . , C12, herein termed Cn, is produced by a substantially similar coefficient generator block 252. Each block 252 comprises a right-shifter 268 which receives the error signal “err” from slicer 58 as well as a value of a constant μ which determines a number of places by which err is shifted right. The right shifted error signal err_μ is input to a multiplexer 256, which also receives an inverted value err_μ_n formed by an inverter 254.

[0117] Block 252 also receives the hard decision, herein termed hdec, produced by slicer 58. As described below, block 252 alters a value of coefficients Cn if |hdec| is 2; if |hdec| is not 2, Cn is unaltered. In comparators 262 and 264 hdec is evaluated and outputs of the comparators feed an OR gate 266. Gate 266 outputs 1 if |hdec|=2, and 0 if |hdec|≠2. The output cyin of comparator 262, checking if hdec is −2, is also input as a select signal to multiplexer 256. The output muxout of multiplexer 256 is err_μ_n if hdec is −2, otherwise muxout is err_μ.

[0118] A summer 258 receives outputs from multiplexer 256, comparator 262, and a time delay 260. Delay 260 receives the output of gate 266, and is enabled if the output is 1. The output of block 252 is thus given by equations (8a) and (8b):

C i+1 =C i +mux out +cy in (|hdec|=2)  (8a)

C i+1 =C i (|hdec|≠2)  (8b)

[0119] FIG. 9 is a schematic block diagram of a decoder 30 (FIG. 1), according to a preferred embodiment of the present invention. Decoder 30 comprises four substantially similar multiple DFE (MDFE) channels 278 and a Viterbi decoder 276. Each MDFE channel 278 receives data from a respective sub-receiver 28, and is constructed from five generally similar first DFE taps 280A, 280B, 280C, 280D, and 280E, also referred to generically hereinbelow as tap 280. Each tap 280 comprises a multiplier 270, a register 272, and a summer 274. In each tap 280 multiplier 270 multiplies coefficient C1 by a different PAM-5 reference level {−2,−1,0,1,2}, and the result, delayed by a clock cycle in register 272, is transferred to a summer 274. Summer 274 also receives soft decisions from summer 56 and provides its output to Viterbi decoder 276.

[0120] The five parallel first DFE taps 280A, 280B, 280C, 280D, and 280E of decoder 30 for each channel of the decoder, while receiving five-level data from two cycles, need to predict only five possible levels of an existing symbol, rather than 25 combinations as is described in prior art systems such as that of U.S. Pat. No. 6,192,072, to Azadet, referred to in the Background of the Invention, so that the complexity of the MDFEs is correspondingly reduced.

[0121] FIG. 10 is a schematic diagram of timing sensors block 62, according to a preferred embodiment of the present invention. Block 62 comprises two sensors, an energy sensor 310 and a coefficients sensor 312. Energy sensor 310 receives its inputs from FSI 52 (FIG. 3). Coefficients sensor 312 most preferably receives, from DFE 65 the first coefficient of DFE 65 (FIG. 7), i.e., the coefficient C1 of single tap DFE 59, and the third coefficient of FFE 54 (FIGS. 4 and 5) i.e., the coefficient before the main tap. In some preferred embodiments of the present invention coefficients sensor 312 receives an alternative indication of the coefficients, such as a change in value of the coefficients. During operation of a sub-receiver one of the two sensors is chosen by the specific sub-receiver 28 to generate a-timing error signal, which is in turn used to control a phase of FIFO 50 and FSI 52 of the sub-receiver. The four timing errors from all sub-receivers 28 are also used, via DSP management block 36 (FIG. 1), to generate a phase control signal for PLL 38 when the transceiver operates as a slave.

[0122] In energy sensor 310 inputs fseo2 and fseo1 are respectively filtered in filters 316 and 318, and an absolute value of each filtered output is generated in devices 320 and 322. Filters 316 and 318 are implemented to emphasize their inputs, and preferably have a transfer function given by equation (9): 1$\begin{array}{cc}\frac{1-z^{-1}}{1+\frac{1}{3}{z}^{-1}}& \left(9\right)\end{array}$

[0123] where z−1 represents a delay of one clock cycle.

[0124] A summer 324 calculates the difference between the two absolute outputs, the difference is filtered in a leakage filter 325, and transferred to a multiplexer 314. It will be appreciated that the difference (between the filtered values of fseo2 and fseo1) provides an error signal which is zero when fseo2 and fseo1 are equal.

[0125] Coefficients sensor 312 performs the operation given by equation (10):

Δtcoeff(n)=ffe—coeff3(n)−dfe—coeff1(n)−TO  (10)

[0126] where

[0127] Δtcoeff(n) is the timing error;

[0128] ffe_coeff3(n) is the coefficient of the third tap of FFE 54;

[0129] dfe_coeff1(n) is the coefficient of the tap of DFE 59, also referred to herein as C1;

[0130] TO is a timing offset.

[0131] As stated above, each sub-receiver may operate as a master or as a slave. As a master, TO is assigned to be between approximately −4 and −3. As a slave, once the coefficients of the equalizers have converged, TO is assigned to be equal to (ffe_coeff3(n)−dfe_coeff1(n)).

[0132] The output Δtcoeff(n) is transferred to multiplexer 314. Multiplexer 314 selects between the two timing errors, from energy sensor 310 and coefficients sensor 312, depending on a state of operation of sub-receiver 28. If the sub-receiver is operating as a master only, the output from the coefficients sensor is used. If the sub-receiver operates as a slave, and there is no transmission from the corresponding transmitter 40, the output from the energy sensors is used, since there is substantially no echo noise. After the sub-receiver that is operating as a slave starts to transmit, the output from the coefficients sensor is used. The facility to switch between energy sensor 310 and coefficients sensor 312 significantly improves the robustness of operation of transceiver 20.

[0133] FIG. 11 is a schematic diagram of phase control block 66, according to a preferred embodiment of the present invention. Block 66 computes a value of c, the FSI 52 interpolation coefficient. The selected timing error output from multiplexer 314 is input, via a filter 64, to a multiplier 440 in block 66, implemented as a shifter. Multiplier 440 also receives a shift coefficient from a shifts array 442, and multiplies the error according to the coefficient to generate a preliminary value of c. The shift coefficient may be different according to whether transceiver 20 is operating as a master or as a slave. In a preferred embodiment of the present invention the coefficient is assigned a value of 13 when transceiver 20 operates as a master, and a value of 7 when the transceiver operates as a slave.

[0134] The preliminary value of c is input to a summer 444, which also receives a delayed value of c from a calculation block 446 so as to provide integration of c. The summed result from summer 444 is output to a c calculation block 446, which outputs the value of c, and an increment (+1) or decrement (−1) signal which is sent to FIFO 50, according to table I below.

TABLE I
Initial c value	Increment/Decrement	c value output
c > 1	−1	0
c < 0	+1	1
0 ≦ c ≦ 1	0	c

[0135] c is then transferred to FSI 52, where it is used as described above with reference to FIG. 3. The value of the timing error from each sub-receiver 28 is also input to DSP block 36 (FIG. 1), for use in controlling timing error selection

[0136] FIG. 12 is a schematic block diagram of DSP block 36, according to a preferred embodiment of the present invention. Block 36 comprises a multi-phase lock loop (MPLL) block 480, which provides an output that alters the phase of the clock generated by PLL block 38. MPLL block 480 receives in a summer 462 all the timing errors from each timing sensor 62 of sub-receivers 28. The errors are averaged, using a shift multiplier 464, and input to a multiplexer 466. In addition, all the timing errors are transferred to a timing error selector 460. Selector 460 is used after the initialization phase (described above) between transceiver 20 and transceiver 33 has completed, to choose the timing error from the sub-receiver 28 which has the signal with the best signal-to-noise value. The choice is made by a selection signal s_det.

[0137] Immediately after the initialization phase, multiplexer 466 selects and outputs the timing error from selector 460. Once the receiver has stabilized, i.e., the coefficients of each sub-receiver 28 have converged to approximately stable values, multiplexer 466 selects and outputs the averaged value of all the timing errors. The output of multiplexer 466 is transferred via a loop filter 482 to an increment/decrement control block. 484, which receives the increment/decrement control provided to FIFO 50. Responsive to the multiplexer output, block 484 generates an increment or a decrement signal to alter the phase of PLL 38.

[0138] Returning to FIG. 1, PLL 38 provides a common shared clock domain which operates the whole of transceiver 20, i.e., both analog section 21 and digital section 23. In analog section 21 all A/D converters 27 are thus sampled at substantially the same time, which has the advantage, inter alia, of substantially reducing overall receiver complexity, compared to receivers which use more than one clock signal for their operation.

[0139] FIG. 13 is a schematic diagram of NEXT cancellers 70 and echo canceller 72, and control logic associated with the cancellers, according to a preferred embodiment of the present invention. As described above with reference to FIG. 6, each receiver 26 comprises a respective echo canceller 72 and three NEXT cancellers 70. Control logic 500 receives transmit data from transmitters 40, and distributes the data to cancellers 70 and 72. Echo canceller 72 receives data from its receiver's corresponding transmitter, and NEXT cancellers 70 receive data from the three neighboring transmitters. In addition, control logic 500 receives adjustment parameters μ, which the logic uses as coefficients to adjust the error used by the cancellers, and other parameters, described below, which adjust settings of the cancellers. The error to be adjusted is either the error output from slicer 58, or a level used by the slicer in making its decisions, depending on a state of receiver 26. If receiver 26 is in an initialization state, the error is set to be the level used by the slicer. If receiver 26 has completed its initialization state, the error is set to the error output from slicer 58.

[0140] The error is then right shifted by μ, each μ preferably being set within a range from 9 to 16 depending on an adaptation step size desired. The values of μ are most preferably pre-set at implementation of receiver 28. How the values of μ are utilized is described in more detail below. In addition to the signals described above, control logic 500 receives other control inputs, also described below, for operation of cancellers 70 and 72. A summer 502, comprising registers, receives outputs from cancellers 70 and 72, and the summed output is input as described above to summer 56. As described below, echo canceller 70 also measures a round trip delay (RTD) of signals transmitted from a corresponding transmitter 40, and outputs a flag RTD_done which may be used by receiver 28 to determine if the receiver is in its initialization state.

[0141] Echo canceller 70 and NEXT cancellers 72 are implemented from adaptive finite impulse response (FIR) filters. FIGS. 14-16, described hereinbelow, schematically illustrate types of filters used in receiver 28.

[0142] FIG. 14 is a schematic block diagram of an adaptive FIR filter 510, according to a preferred embodiment of the present invention. Filter 510 has four taps arranged in a transpose-form architecture, as is known in the art, and comprises an adaptation pipeline 512 and an equalization pipeline 514. Adaptation pipeline 512, wherein coefficients are adaptively calculated, consists of a series of multipliers 516, shifters 518, adders 520, delays 522, and multipliers 524. Each section of pipeline 512, except the first section, also consists of a time delay 526. Equalization pipeline 514 consists of a series of adders 528 and delays 530.

[0143] Each section of adaptation pipeline 512 computes a coefficient of the form:

C n+1 m =C n m +err n ·x n ·2−μ  (10)

[0144] where

[0145] m is a coefficient index;

[0146] n is a time index;

[0147] Cn+1m is a new coefficient;

[0148] Cnm is a previous coefficient;

[0149] errn is an error value;

[0150] xn is an input to filter 510; and

[0151] μ is a positive integer giving an adaptation step size.

[0152] The output of equalization pipeline 514, i.e., the value output by the leftmost adder 528, is given by

y n =C n 0 ·x n +C n−1 1 ·x n−1 +C n−2 2 ·X n−2 +C n−3 3 ·x n−3   (11)

[0153] where xn−p is a value of xn delayed by p cycles.

[0154] FIG. 15 is a schematic block diagram of an adaptive FIR filter 600, according to a preferred embodiment of the present invention. Filter 600 has a hybrid-form architecture which combines the transpose-form architecture of filter 510 and a direct-form adaptive FIR architecture, which is known in the art. Apart from the differences described below, the operation of filter 600 is generally similar to that of filter 510, so that elements indicated by the same reference numerals in both filters 510 and 600 are generally identical in construction and in operation. Unlike filter 510, filter 600 does not have a delay 530 in every section of the equalization pipeline, but has a delay 602 at the input of later taps of the filter. Filter 600 has a hybrid factor of 2, (the number of consecutive tap outputs that can be combined into the same register) and the output of the filter is given by:

y n =C n 0 ·x n +C n−1 1 ·x n−1 +C n−1 2 ·x n−2 +C n−2 3 ·x n−3   (12)

[0155] The hybrid form of FIR architecture has a number of advantages, known in the art, compared to the transpose-form architecture illustrated in FIG. 12. In general, a hybrid-form filter with a hybrid factor of N has, for every N taps, N−1 input signals feeding a single tap and 1 input signal feeding two taps. As is also known in the art, a preferable value of N is given by N=2M−1, where M is a positive integer. Furthermore, input registers may be utilized to serve a dual purpose of adaptation and equalization.

[0156] Multipliers 524 in adaptive FIR filters of preferred embodiments of the present invention most preferably use ones complement multiplication in each tap of the filter. Using ones complement arithmetic reduces both area and power requirements compared to implementing twos complement arithmetic. An accumulator is used to adjust the final result, as shown in the following derivation.

[0157] Equations (11) and (12) may be represented by: 2$\begin{array}{cc}{Y}_n=\sum _{i=0}^N{X}_{n-i}·C_n^i& \text{(13a)}\end{array}$

[0158] which may be separated into positive Xn+ and negative Xn− values to give: 3$\begin{array}{cc}{Y}_n=\sum _{i=0}^N{X}_{n-i}^{+}·C_n^i+\sum _{i=0}^N{X}_{n-i}^{-}·C_n^i& \text{(13b)}\end{array}$

[0159] When Xn is negative, this can be rewritten: 4$\begin{array}{cc}{Y}_n=\sum _{i=0}^N{X}_{n-i}^{+}·C_n^i+\sum _{i=0}^N\&LeftBracketingBar;X_{n-i}^{-}\&RightBracketingBar;·C_n^i& \text{(13c)}\end{array}$

[0160] which can be further rewritten to: 5$\begin{array}{cc}{Y}_n=\sum _{i=0}^N{X}_{n-i}^{+}·C_n^i+\sum _{i=0}^N\&LeftBracketingBar;X_{n-i}^{-}\&RightBracketingBar;·\left[~C_n^i\right]+\sum _{i=0}^N\&LeftBracketingBar;X_{n-i}^{-}\&RightBracketingBar;·2^{-f}& \text{(13d)}\end{array}$

[0161] where ˜Cn in the second term in equation (13d) is the ones complement of coefficient Cn, f is a number of fractional bits in Cn, and the last term in equation (13d) is the adjustment needed for using ones complement arithmetic.

[0162] FIG. 16 is a schematic block diagram of an adaptive FIR filter 650, according to a preferred embodiment of the present invention. Filter 650 uses ones complement arithmetic, has a transpose-form architecture, and is implemented to operate substantially as described above with respect to equation 13d. Apart from the differences described below, the operation of filter 650 is generally similar to that of filter 510, so that elements indicated by the same reference numerals in both filters 650 and 510 are generally identical in construction and in operation. An element 652 determines a sign and an absolute value of Xn and these are used by later sections of the filter. Filter 650 comprises selectors 654, 658, and a ones complement generator 656, in each tap, which enable the tap to implement ones complement arithmetic. Selectors 654 and 658 make their selection according to a control signal also input to the selector. For example, each selector 658 selects between Cn and ˜Cn according to the sign of Xn input, used as the control signal, to the selector.

[0163] Filter 650 further comprises elements which act as an accumulator 660 for adjusting the overall result from the filter, enabling the filter to implement equation (13d). Accumulator 660 comprises selectors 659 that operate generally as selectors 654 receiving Xn and Xn−M, a summer 661 that sums the output of selectors 659, and a register 663 that inserts a delay into the output of the summer. Accumulator 660 is implemented to produce the adjustment corresponding to the last term of equation (13d), enabling filter 650 to transform back from ones complement to twos complement arithmetic. When an input Xn is negative its absolute value is added to accumulator 660; when data Xn−M leaving a last tap of the filter is negative, its absolute value is subtracted from the accumulator. The adjustment is added to the filter output in an adjustment-adder 529, which produces a final filter output. Those skilled in the art will be able to formulate a schematic, generally similar to that of FIG. 14 for filter 650, but having a hybrid-form or a direct-form architecture.

[0164] Echo canceller 72 and NEXT cancellers 70 preferably comprise hybrid-form or transpose-form FIR filters generally similar to filter 650. As described in more detail below with reference to FIG. 17, the numbers of taps and the hybrid factors of the FIR filters comprising the cancellers are set for each of the filters.

[0165] As stated above, input data to NEXT cancellers 70 and Echo canceller 72 are five-level signals {+2, +1, 0, −1, −2}. Some preferred embodiments of the present invention perform adaptation when values of the input are 2 or −2, and not for the other three values. In the initialization phase of receiver 28, inputs to the cancellers are also set to be +2, 0, or −2, so that during this phase there is no effect on the adaptation. After completion of the initialization phase, performing adaptation using only the +2 and −2 levels leads to significant savings of chip area and chip power consumption with minimal reduction in adaptation performance. The minimal reduction is due to the fact that most of the energy of the input values resides in the +2 and −2 levels.

[0166] During the initialization phase of receiver 28, filter coefficients of NEXT cancellers 70 and Echo canceller 72 are most preferably adapted without decimation. Once the initialization phase has concluded, however, the coefficients typically tend to vary relatively slowly, so that adaptation decimation may be implemented with relatively little loss of efficiency. Preferred embodiments of the present invention preferably implement adaptation decimation in a substantially random manner over time, so as to minimize any frequency dependent adaptation factor. Most preferably, the randomness is introduced by cyclically counting the number of +2 or −2 values on the input data. Each time the counter returns to a specific value, e.g., 0, the next +2 or −2 value is used for adaptation. The value is used one tap at a time, i.e., the value “traverses” the adaptation pipeline so that at a time tn it is used for tap 1, at a time tn+1 it is used for tap 2, and continues until the last tap. Most preferably, the adaptation rate generated by the counter is monitored, and in the event of the adaptation rate falling below a minimum frequency, the counter is overridden and adaptation is enforced for the next +2 or −2 input value, so ensuring a minimum adaptation rate.

[0167] In transferring the five levels {+2, +1, 0, −1, −2} between elements of the cancellers, the levels are encoded as binary strings. Toggling between the binary values because of level changes, as data is transferred, uses power. Some preferred embodiments of the present invention use an encoding scheme for the levels and strings defined by the following one-one relationship: {(level, string)}={(+2, 010), (+1, 001), (0, 000), (−1, 100), (+1, 110)}.

[0168] The encoding is a mapping between the two parameters level and string, and is also shown in Table II below.

TABLE II
Level String
+2    010
+1    001
0     000
−1    100
−2    110

[0169] Analysis of the encoding of Table II shows that a total of 32 transitions occurs for toggling between any level value to any other level value. The total of the transitions forms a measure of a switching activity value that would be caused by toggling between the levels in a random manner, as is typically the case when data is transferred. A prior art encoding scheme encodes −1 as 111, other encoding values being as given in Table II. Using the encoding scheme of Table II leads to a significant saving in numbers of transitions needed for toggling between any two data levels, and thus to a reduction in switching activity value, compared to the prior art scheme. The reduction in switching activity value leads to a corresponding reduction in power used.

[0170] FIG. 17 is a schematic block diagram of a structure 700 of an adaptive FIR filter, according to a preferred embodiment of the present invention. Structure 700 illustrates a general format of FIR filters comprised in Echo canceller 72 and each of NEXT cancellers 70. Structure 700 may be considered to be comprised of two regions, an equalization region 701 and an adaptation region 703. Equalization region 701 functions generally as equalization pipelines 514 (FIGS. 14, 15, and 16), and adaptation region 703 functions generally as adaptation pipelines 512. Most preferably, where possible registers in delay lines of both regions are combined to reduce redundant registers, so as to reduce power dissipation and chip area used. The number of taps for each delay line is detailed below in the respective descriptions for each canceller.

[0171] Equalization region 701 receives its raw data as one of five levels, {−2,−1,0,+1,+2}, and translates the data in a translation block 705 as described above with reference to Table II. The translated data is input to an equalization pipeline block 702, which comprises a number of delays according to the hybrid factor selected, so that block 702 is followed by an equalization select block 710, wherein appropriately delayed input data is applied to the corresponding filter taps according to the hybrid factor.

[0172] Data from block 710 is input to an equalization block 712, wherein the data is multiplied by filter coefficients, derived from the adaptation region, using ones complement arithmetic, as described above. As also described above, the ones complement arithmetic requires an adjustment Yadj, which is performed by an accumulator comprised in an equalization adjustment block 708, substantially as described above with reference to FIG. 16 and equation (13d).

[0173] An adder-register block 706 comprises adders and registers of the output path of the filter. The number of adders and registers is a function of the hybrid factor of the filter, and adders are preferably combined where possible. For example, a hybrid factor of 7 (23−1) requires, in the output path, seven consecutive adders between every two registers. Each seven adders may be combined into one 8-adder with eight inputs—one input from each respective filter tap plus one input from a neighboring register holding a previous partial result. The adder-register block 706 outputs the final result Yout of filter 700, before adjustment by the output of equalization adjustment block 708. The two outputs may be combined to give a final output of filter 700, or, for example when filter 700 is cascaded with other similar filters, the two outputs may be kept separate, as described in more detail with reference to FIGS. 18A, 18B and 19A, 19B below.

[0174] Adaptation region 703 also receives its input data as one of five levels, {−2,−1,0,+1,+2}, and translates the data in a translation block 707, substantially similar to block 705, and the two blocks may be effectively combined to one block. The translated data is filtered through a 3-level adaptation block 709, which only transfers {−2,0,+2}, so that region 703 performs adaptation on levels +2 and −2, as described above. The filtered values are received by an adaptation decimation block 711, which decimates the adaptation rate by a predetermined value, as described above.

[0175] The decimated adaptation data is input to an adaptation pipeline block 704, which comprises a delay for each tap of structure 700. The delayed adaptation data from block 704 is multiplied, in an adjustment block 713, by the error signal shifted by a pre-determined parameter μ, and the resultant product is output to update coefficient values of structure 700, and also as an input to equalization block 712.

[0176] FIGS. 18A and 18B are schematic block diagrams of Echo canceller 72 (FIGS. 2 and 13), according to a preferred embodiment of the present invention. Canceller 72 comprises a near-echo filter 750, which preferably consists of up to 56 filter taps arranged in blocks substantially similar to structure 700. Filter 750 is described in more detail with respect to FIGS. 19A and 19B below. Canceller 72 acts to cancel echo remaining after hybrid 31 (FIG. 1) of the transmitter 40, corresponding to the receiver 28 comprising the canceller, has performed its preliminary echo cancellation. Filter 750 receives its input signal data from the transmitter 40, and the input data is preferably delayed by five clock cycles in order to allow synchronization of adaptation data with the error signal. The output Yout of canceller 72 is derived from near-echo filter 750 and elements of the canceller which evaluate a round trip delay (RTD) of signals sent by corresponding transmitter 40.

[0177] An RTD controller 758, a delay line 752, and two RTD filters 754 and 756 implement parameters of the delay line and the RTD filters to correct the round trip delay. Delay line 752 preferably comprises two equivalent delay lines, one for the equalization data in filters 754 and 756, and a second for the adaptation data in the filters. Each delay line may preferably introduce a delay of up to 124 cycles, and the delay is most preferably set in steps of 4 cycles. Each of the delay lines in delay line 752 is preferably implemented from separately powered registers and delays comprised in the respective delay lines.

[0178] RTD controller 758 adjusts respective delays introduced into the input data by delay line 752, by setting two indices tap_index1 and tap_index2. The respective delays are used to position each of RTD filters 754 and 756, each comprising 16 taps, in the overall filter so as to absorb maximum echo energy. A preferred method of positioning the RTD filters is described below with reference to FIG. 20. Outputs y1 and y2 of filters 754 and 756 are summed in summers 760; summers 760 also receive adjustments a1, a2 and Yadj of filters 754, 756 and 750, most preferably in ones complement form, to produce the final output Yout of canceller 72.

[0179] FIGS. 19A and 19B are schematic block diagrams of near-echo filter 750, according to a preferred embodiment of the present invention. Filter 750 comprises four filter blocks, each having a structure substantially similar to structure 700 (FIG. 17), which most preferably enable filter 750 to have up to 56 taps. Block 780 preferably comprises five filter taps in a transpose-form architecture, as described with reference to FIG. 12. Block 782 preferably comprises 28 filter taps in a hybrid-form architecture with a hybrid factor of 7, as described with reference to FIG. 15. Blocks 784 and 786 preferably comprise 7 and 16 filter taps respectively, both in a transpose-form architecture. Most preferably, at least one of the filter blocks, preferably block 786, may be powered-down so as to shorten the filter length from its maximum 56 taps. Powering-down block 786 reduces the total number of taps to 40.

[0180] Filter blocks 780, 782, and 784 have an effective hybrid factor of 7, since the output of block 784 is the summation of the its seven taps, and since the five taps of block 780 are combined with its previous result, with the outputs of RTD filters 754 and 756 in summers 760 (FIG. 18A), and in the registers comprised in summer 502 (FIG. 13). A hybrid factor of 7 uses an 8-input adder, corresponding with the optimal factor of 23−1 described above. Filter blocks 780, 782, and 784 most preferably maintain a 22-bit coefficient with a dynamic range between +1 and −1 for internal operation, and the eleven most significant bits (MSBs) of the coefficient are used for equalization.

[0181] Filter block 786 and RTD filters 754 and 756 have a hybrid factor of 16, and so utilize a 16-input adder. These filters most preferably generate a 20-bit coefficient with a dynamic range between +¼ and −¼ for internal operation, and the nine MSBs of the coefficient are used for equalization. Reducing the number of MSBs allows optimal use of the 16-input adder.

[0182] As shown in FIGS. 19A and 19B, the input data (Din and Dadp) of filter 750 are cascaded from left to right through the filter blocks. The output data (Yout and Yadj) are cascaded in the reverse direction.

[0183] Blocks 780, 782, 784 and 786 may perform adaptation decimation, as described above with reference to structure 700, according to predetermined values set by decimation setting parameters adp_dec input to control logic 500. The decimation rate for blocks 780 and 782 can preferably be set at a value of 2, 4, or 8. The decimation rate for blocks 784 and 786, and for filters 754 and 756 (FIG. 18B) is preferably set to be a multiple, chosen from the values {1,2,4,8,16}, of the decimation rate set for blocks 780 and 782. Alternatively, the blocks may be implemented not to perform decimation. In addition, each block is implemented to have an adaptation rate monitor, as described above, which activates if the measured decimation rate falls below a predetermined value, preferably four times an effective decimation rate.

[0184] Dividing the canceller 72 into two tap regions—a “lower tap” region comprising blocks 780 and 782 with 33 taps, and a “higher tap” region comprising blocks 784, 786, 754, and 756 with 55 taps—allows for more flexibility in setting decimation values. The flexibility enables power to be saved, by having high decimation values, without performance degradation. Preferably, the lower taps are set to have low decimation values, and the higher taps are set to have high decimation values.

[0185] FIG. 20 is a flowchart illustrating a process 800 followed by RTD controller 758 (FIG. 18A), according to a preferred embodiment of the present invention. Controller 758 most preferably operates as a state machine to implement process 800, which sets the delays before RTD blocks 754 and 756 operate. The delays are set as tap indices, which are provided to delay line 752. Process 800 measures the energy absorbed by blocks 754 and 756, and alters the position of the blocks so that they absorb the maximum amount of energy, corresponding to most echo noise. Alternatively, the state machine may be disabled, so that process 800 is not followed; in this case, the tap indices for blocks 754 and 756 are most preferably allocated by predetermined setting parameters tap_index_mid and tap_index-far input to control logic 500.

[0186] In an initial state 802, before controller 758 activates, block 754 is set to be directly after the last tap of filter 750, and block 756 is set to be directly after the last tap of block 754. Thus, if block 786 in filter 750 is activated, blocks 754 and 756 have effective tap positions 57-72 and 73-88; if block 786 is not activated, blocks 754 and 756 have effective tap positions 41-56 and 57-72.

[0187] In an activation step 804, controller 758 activates during the initialization phase of receiver 28 and waits a pre-determined time for the taps of the active blocks in filter 750 to converge.

[0188] At a beginning of a recursion sequence step 806, controller 758 resets the coefficients of blocks 754 and 756, and allows the taps of these blocks to converge.

[0189] In an energy measurement step 808, the absolute values of the tap coefficients for each block 754 and 756 are summed. The two sums are used as a measure of the energy being input to the respective blocks.

[0190] In an index calculation step 810 controller 758 adjusts initial values of tap_index1 and tap_index2, the indices respectively governing the delays for RTD blocks 754 and 756. The indices are preferably adjusted in steps of 4 or 8 taps. After adjustment, the block with the lowest energy, as measured in step 808, moves to its new index, unless one of conditions 812 and 814 is true, as shown in a step 815.

[0191] In a check overlap condition 812, the positions of the taps of blocks 754 and 756 are checked. If there is no overlap between the blocks, process 800 continues to a check out-of-bounds condition 814. If there is overlap between the blocks, the process continues to an overlap-exists step 816.

[0192] In check out-of-bounds condition 814, controller 758 checks to see that the values of tap_index1 and tap_index2 are within a predetermined bound. If the values are within the bound, process 800 returns to step 806. If one of the indices exceed the bound, process 800 stops.

[0193] In overlap-exists step 816, rather than the block with the lowest energy moving, as in step 810, the block with the highest energy moves to the new index value. Controller resets the block taps and waits for the taps of the block in its new position to converge.

[0194] In a check-energy condition 818, controller 758 then checks if the energy of the block in the new index value is higher than the block's previous energy. If the energy is higher, then the block remains at the new index value. If the energy is not higher, then the block reverts to its previous index value. Process 800 then continues by returning to a position after step 808.

[0195] Once process 800 has completed, RTD blocks 754 and 756 are in positions having highest measured energies. It will be appreciated that the process enables blocks comprising 32 taps to be adaptively moved so that maximum echo energy is absorbed. It will be further appreciated that using blocks having adjustable positions saves considerable power compared to static systems, such as full echo cancellers known in the art, which require considerably more taps to absorb the maximum echo energy. Preferably, controller 758 is implemented to power down one of the RTD blocks if its measured energy is smaller by a predetermined factor than the other RTD block, further reducing power consumption of the filter. The predetermined factor is set by an rtd_pwrdn parameter input to control logic 500. Further preferably, controller 758 is preferably implemented to power down unused registers in delay line 752, further reducing power consumption of the filter.

[0196] FIG. 21 is a schematic block diagram of NEXT canceller 70, according to a preferred embodiment of the present invention. As shown in FIGS. 2 and 13, receiver 28 comprises three substantially similar NEXT cancellers, each canceller receiving data from a transmitter 40 transmitting on a neighboring channel to receiver, and using the data to cancel cross-talk generated by the transmitters. NEXT canceller 70 comprises a first filter block 850 and a second filter block 852, each block having a structure substantially similar to structure 700 (FIG. 17).

[0197] Filter block 850 preferably comprises 14 filter taps; filter block 852 preferably comprises 28 filter taps, and both filters are implemented with a hybrid factor of 7, and each adder in the output path is most preferably an 8-adder. In addition, the last 7 or the last 14 taps in filter block 852 may most preferably by powered down, according to a predetermined factor next-pwrdn input to control logic 500, so that the overall number of taps in canceller 70 may be set to be 28, 35, or 42.

[0198] Most preferably, filter block 850 maintains a 19-bit coefficient with a dynamic range between 6$+\frac{1}{8}$

[0199] and 7$-\frac{1}{8}$

[0200] for internal operation, and filter block maintains a 17-bit coefficient with the same resolution as those of block 852, but with a dynamic range between 8$+\frac{1}{32}$

[0201] and 9$-\frac{1}{32}$

[0202] for internal operation. Preferably, for equalization block 850 uses the eight MSBs of its coefficients, but block 852 uses the six MSBs of its coefficients. Both filters generate fixed point results, block 850 having a resultant dynamic range between +2 and −2, block 852 having a resultant dynamic range between 10$+\frac{1}{2}$

[0203] and 11$-\frac{1}{2}.$

[0204] Input data, Din, are cascaded from block 850 to block 852. The outputs Yout and Yadj, the latter most preferably comprising a ones complement adjustment as described above, are cascaded from block 852 to block 850. A summer 854 sums Yout and Yadj to produce the final Yout from canceller 70.

[0205] Most preferably, each NEXT canceller 70 is implemented to perform adaptation decimation according to one or more predetermined adaptation decimation parameters input to the canceller. The decimation is preferably implemented to be at a rate chosen from the values {4, 8, 16}; alternatively, no decimation may be implemented. In addition, canceller 70 is preferably implemented to have an adaptation rate monitor, as described above, which activates if the measured decimation rate falls below a predetermined value, preferably four times an effective decimation rate. Decimation and rate monitoring are preferably implemented by methods generally similar, mutatis mutandis, to those described above with reference to FIGS. 19A and 19B.

[0206] The final Yout outputs from each NEXT canceller 70, as shown in FIGS. 2 and 13, are combined together, and are further combined with the output of canceller 72 to produce the input to FFE/Blind equalizer 54.

[0207] It will be appreciated that the scope of the present invention is not limited to a specific number of transmission lines acting as channels of communication, and that the number of lines may be substantially any plurality of lines.

[0208] FIG. 22 is a schematic block diagram showing components used in a process 900 for determining skew of signals entering transceiver 20, according to a preferred embodiment of the present invention. As shown in FIG. 1, transceiver 20 receives signals on four twisted pairs of conductors acting as channels, each signal, because of the nature of the channels, having relative skew therebetween. The signals are assumed to be transmitted as respective symbols, most preferably according to a start-up procedure of IEEE standard 802.3ab, and the four channels are herein termed channel A, channel B, channel C, and channel D. PCS 32 acts as an input circuit for receiving the channel signals, and comprises a processor 37, a first-in-first-out (FIFO) memory 39, a de-scrambler 47, and an elimination array memory 45, which implement the process for determining the relative skew between the channels. After PCS 32 has determined the skew of each of the four channels, it provides skew values to FIFO 50 (FIG. 2) which the FIFO uses to align the incoming signals.

[0209] FIG. 23 is a logical flow diagram which schematically illustrates process 900, and FIG. 24 is a flowchart showing steps in the process, according to a preferred embodiment of the present invention.

[0210] Process 900 is most preferably implemented by transceiver 20 during the initialization stage (described above with reference to FIG. 1) when remote transceiver 33 transmits scrambled idle symbols generated according to IEEE standard 802.3ab, the idle symbols representing a transmitted character. It will be understood, however, that process 900 may be applied to substantially any type of symbols transmitted over multiple channels, where skew between the channels occurs.

[0211] Transceiver 33 generates idle symbols and scrambles the idle symbols, according to a predetermined polynomial defined in standard 802.3ab, so as to generate scrambled idle symbols SIA, SIB, SIC, SID. The idle symbols generated are a function of a mode of communication between transceiver 33 and transceiver 20, which is determined by the values of transceiver 33 parameters loc_rcvr_status and mod—2. loc_rcvr_status defines a status of the overall link as being satisfactory or not. mod—2 defines a type of idle symbol to be transmitted. mod—2 and loc_rcvr_status may each take a value of 0 or 1.

[0212] SIB and SID are dependent on mod—2, and so for a specific data-symbol there are two possible symbols SIB and two possible symbols SID. SIC is dependent on loc_rcvr_status and mod—2, and so for a specific character there are four possible symbols SIC. SIA, SIB, SIC, SID are, by way of example, assumed to be transmitted at levels 2, 0, or −2, although it will be understood that they may be transmitted at substantially any plurality of levels.

[0213] In a translation step 902, processor 37 translates each level of SIA, SIB, SIC, SID to a string of three binary bits, most preferably according to Table II above.

[0214] In a storage step 904, processor 37 stores one of the binary bits of each string, most preferably the central bit, in respective cells of FIFO 39. FIFO 39 preferably comprises a reference column 39A (FIG. 22) of n cells that store n bits of channel A, and three columns 39B, 39C, 39D, of (2n+1) cells each that store (2n+1) bits of channels B, C, and D, as illustrated in FIG. 22, where n is a whole number. The value of n is preferably chosen so that the number of samples in column 39A is greater than the allowed skew. Thus, if SIA, SIB, SIC, SID are transmitted with a period of 8 ns, and a maximum allowed skew is 50 ns, n is preferably set to be 7 or more. Hereinbelow, n is assumed to be 7.

[0215] In a synchronization step 906, processor 37 and de-scrambling code stored in storage memory 43 preferably operate as data de-scrambler 47. Alternatively, de-scrambler 47 is implemented by a substantially hardware system. Processor 37 synchronizes the de-scrambler to the scrambler of remote transceiver 33, using the data stored in column 39A, by methods which will be apparent to those skilled in the art.

[0216] In a generate idle codes step 908, processor 37 inputs the first bit in FIFO column 39A to de-scrambler 47, which calculates the four possible idle codes (corresponding to the possible values of loc_rcvr_status and mod—2) and the corresponding possible values for channel B (2 values), channel C (4 values), and channel D (2 values). De-scrambler 47 and processor 37 thus act as a symbol predictor, generating the four possible idle codes as expected values of channels B, C, and D.

[0217] In a comparison step 910, processor 37 compares the calculated expected idle codes with corresponding columns 39B, 39C, 39D in FIFO 39. The results of the comparison are stored in elimination memory array 45. Array 45 has a depth of (2n+1), corresponding to the depth of FIFO 39, and comprises 8 columns 45B0, 45B1, 45C00, 45C01, 45C10, 45C11, 45D0, 45D1, each column corresponding to a possible type of channel symbol, as described above. Thus, for the two possible idle codes generated for channel B, processor 37 compares each of the 2n+1 bits stored in column 39B with the calculated idle bits. The processor performs a similar process for each of the 2n+1 bits stored in column 39C (comparison with four idle codes) and for each of the 2n+1 bits stored in column 39D (comparison with two idle codes).

[0218] In an elimination step 912, processor 37 marks each of the cells in array 45 where the comparison indicates no match.

[0219] Processor 37 then advances the bits in FIFO 39 by one cell, in a continuation step 914, and repeats steps 908, 910, and 912. In step 910, however, the processor only compares bits in FIFO 39 which still show as being matched (after step 912).

[0220] Steps 908, 910, 912, and 914 are repeated until only a single match is present in one of columns 45B0, 45B1, one of columns 45C00, 45C01, 45C10, 45C11, and one of columns 45D0, 45D1, after which process 900 stops. It will be appreciated that at this point, the vertical displacement of each of the single matches corresponds to the skew of each of channels B, C, and D relative to channel A. In addition, the columns of array 45 having the single matches indicate the values of mod—2 and loc_rcvr_status, so indicating the mode of communication between transceiver 20 and transceiver 33.

[0221] It will be appreciated that the above description applies to three non-reference channels, each of the channels possibly being in more than one state depending on a communication mode of transceiver 33 and transceiver 20, and that the number of columns of memory array 45 corresponds to the total number of combined channels and states. It will thus be appreciated that increasing the number of columns of array 45 allows process 900 to identify skew values and channel states in correspondingly greater numbers of channels and/or larger numbers of possible states of the channels.

[0222] FIG. 25 is a state diagram 920 illustrating an example of states of FIFO 39 and elimination array 45 as process 900 operates, according to a preferred embodiment of the present invention. For clarity, only columns 39A and 39B of FIFO 39 are illustrated, de-scrambler 47 is assumed to generate only one idle code, and only one column 45B of memory array 45 is shown. For the purposes of the example, the skew of channel B is assumed to be 2 symbols ahead of channel A, indicated by a broken line 922 being two cells ahead of a reference line 923; column 39A is assumed to comprise 7 cells, and column 39B is assumed to comprise 15 cells

[0223] At an initial time 924, columns 39A and 39B of FIFO 39 have been filled by incoming bits, as described above for steps 902 and 904. Bits in respective cells of column 39A are differentiated by letters a, b, c, d, e, f, and g. De-scrambler 47 then synchronizes to channel A, and identifies bit a as the bit to be operated on, de-scrambling bit a to generate 1—corresponding to the “1” directly above broken line 922. These operations correspond to steps 906 and 908.

[0224] In operations corresponding to steps 910 and 912 processor 37 compares the 1 generated by the de-scrambler with bits in FIFO column 39B to determine bits which match the 1, and stores the matches and “no matches” in array column 45B. Matched bits are shown as ✓, non-matched bits as x. After time 924 there are seven matched symbols in column 45B.

[0225] At a time 926, bits in FIFO 39 are advanced by one cell and the process described above for time 924 repeats. In this case, the de-scrambler identifies b as the bit to be de-scrambled, and generates from bit b the value 0—corresponding to the 0 directly above broken line 922. The 0 is compared with bits in column 39B where array column 45B indicates there is still a match. As shown in FIG. 25, after time 926 there are still four matched symbols in column 45B.

[0226] At a time 928, symbols in FIFO 39 are again advanced by one cell and the process repeats. The de-scrambler generates from symbol c the value 1, and this is compared with the four bits in column 39B where array column 45B indicates there is still a match. After this comparison there is one remaining match in array column 45B, and the process ends.

[0227] As is illustrated in FIG. 25, the displacement of the remaining match in memory array column 45B from reference line 923 is equal to the skew of channel B.

[0228] It will be appreciated that on a statistical basis, each comparison of processor 37 eliminates approximately half of the remaining matched symbols, until the single matched symbol corresponding to the skew remains. Furthermore, processor 37 is able to perform the comparisons for the different channels, and for the different possible idle codes for each channel, substantially in parallel. Thus, relatively few cycles of processor 37 are required to completely determine the skew of all incoming channels as well as the states of the different channels.

[0229] It will be understood that the principles described above may be applied to determining the skew between any multiplicity of channels upon which a signal is transmitted, by storing the skewed signals in a memory and sequentially comparing values using an elimination array until only one matched value remains in the array. It will be appreciated that the signals may be scrambled or non-scrambled. Furthermore, it will be appreciated that FIFO 39 and array 45 only need to have binary cells, regardless of the number of levels comprised in the incoming symbols. Alternatively, FIFO 39 may comprise cells which are capable of storing symbols having more than two levels.

[0230] The system described above with reference to FIGS. 22-25 determines skew between transmission lines and communication modes of signals transmitted on the lines. It will be appreciated that the system may be adapted to determine skew alone, for example if the communication mode is known, or the communication mode alone, for example if the skew is known. All such adaptations are assumed to be comprised within the scope of the present invention.

[0231] It will thus be appreciated that the preferred embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.

Claims

1. In a data receiver for receiving communication signals from a transmitter over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, signal processing apparatus comprising: an input circuit, which is coupled to process the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols; a first-in-first-out (FIFO) memory, which is coupled to the input circuit so as to receive and store at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval; a symbol predictor, which is adapted, based on the predetermined relation between the first and second symbols, to determine for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval; and comparison logic, which is adapted to compare the expected value with the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a relative skew between the first and at least the second channel.

2. Apparatus according to claim 1, wherein the comparison logic generates, for each comparison performed by the logic, one of a matched and a non-matched result, and wherein the logic comprises an elimination memory array wherein are stored the results of the comparisons.

3. Apparatus according to claim 2, wherein the comparison logic is adapted to perform iterations of the comparisons performed by the logic, wherein for each iteration the logic compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison.

4. Apparatus according to claim 3, wherein the comparison logic is adapted to perform the iterations until only one matched result remains in the elimination array, and wherein the relative skew is determined from a position of the one matched result in the elimination array.

5. Apparatus according to claim 3, wherein the FIFO memory comprises a first column wherein are stored sequentially the at least one bit of each of the received symbols of the first sequence, and at least one second column wherein are stored sequentially and respectively the at least one bit of each of the received symbols of the at least one second sequence, and wherein for each iteration the comparison logic is adapted to sequentially advance the at least one bit of the first column and the at least one bit of the at least one second column, so as to generate for the symbol predictor the received symbol in the first interval and the at least one bit in the corresponding one of the second symbols in the second interval.

6. Apparatus according to claim 1, wherein the transmitter and the data receiver are adapted to exist in a plurality of communication modes, and wherein the symbol predictor is adapted to generate a respective plurality of expected values, comprised in the expected value, in response to the communication modes, and wherein the comparison logic is adapted to determine a communicating state, comprised in the communication modes, responsive to comparisons between the respective plurality of expected values and the at least one bit of each of the received second symbols in the FIFO memory.

7. Apparatus according to claim 6, wherein the comparison logic generates, for each comparison performed by the logic, one of a matched and a non-matched result, and wherein the logic comprises an elimination memory array wherein are stored the results of the comparisons, and wherein the comparison logic is adapted to perform iterations of the comparisons, wherein for each iteration the logic compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison, and wherein the comparison logic is adapted to perform the iterations until only one matched result remains in the elimination array, and wherein the communicating state is determined from a position of the one matched result in the elimination array.

8. Apparatus according to claim 1, wherein the at least one second channel comprises three channels.

9. Apparatus according to claim 1, wherein each of the symbols comprises a plurality of levels, and wherein the input circuit is adapted to translate the levels to unique bit strings.

10. Apparatus according to claim 1, wherein the data receiver and the transmitter communicate via a communication protocol which defines a maximum value of the relative skew, and wherein the first interval and the second interval are respective predetermined functions of the maximum value.

11. Apparatus according to claim 1, wherein the data receiver and the transmitter communicate via a communication protocol which defines a maximum value of the relative skew, and wherein an overlap between the first interval and the second interval is a predetermined function of the maximum value.

12. A method for receiving communication signals from a transmitter transmitted over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, comprising: processing the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols; receiving and storing in a first-in-first-out (FIFO) memory at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval; determining for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval, based on the predetermined relation between the first and second symbols; and performing comparisons between the expected value and the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a relative skew between the first and at least the second channel.

13. A method according to claim 12, and comprising generating, for each comparison performed, one of a matched and a non-matched result, and storing the results of the comparisons in an elimination memory array.

14. A method according to claim 13, and comprising performing iterations of the comparisons, wherein in each iteration the comparison compares the expected value with the at least one bit of each of the received second symbols generating the matched result in a previous comparison.

15. A method according to claim 14, and comprising performing the iterations until only one matched result remains in the elimination memory array, and wherein the relative skew is determined from a position of the one matched result in the elimination memory array.

16. A method according to claim 14, wherein the FIFO memory comprises a first column wherein are stored sequentially the at least one bit of each of the received symbols of the first sequence, and at least one second column wherein are stored sequentially and respectively the at least one bit of each of the received symbols of the at least second sequence, and for each iteration sequentially advancing the at least one bit of the first column and the at least one bit of the at least one second column, so as to generate the received symbol in the first interval and the at least one bit in the corresponding one of the second symbols in the second interval.

17. A method according to claim 12, wherein the transmitter is adapted to transmit the communication signals in a plurality of communication modes, and wherein determining for each of the received symbols in the first interval of the first sequence the expected value comprises generating a respective plurality of expected values, in response to the communication modes, and determining a communicating state, comprised in the communication modes, responsive to comparisons between the respective plurality of expected values and the at least one bit of each of the received second symbols in the FIFO memory.

18. A method according to claim 17, and comprising: generating, for each comparison performed, one of a matched and a non-matched result; storing the results of the comparisons in an elimination memory array; performing iterations of the comparisons, wherein each iteration comprises comparing the expected value with the at least one bit of each of the received second symbols that generated the matched result in a previous comparison, until only one matched result remains in the elimination array; and determining the communicating state from a position of the one matched result in the elimination array.

19. A method according to claim 12, wherein the at least one second channel comprises three channels.

20. A method according to claim 12, wherein each of the symbols comprises a plurality of levels, and comprising translating the levels to unique bit strings.

21. A method according to claim 12, wherein the communication signals are generated in response to a communication protocol which defines a maximum value of the relative skew, and wherein the first interval and the second interval are respective predetermined functions of the maximum value.

22. A method according to claim 12, wherein the communication signals are generated in response to a communication protocol which defines a maximum value of the relative skew, and wherein an overlap between the first interval and the second interval is a predetermined function of the maximum value.

23. In a data receiver for receiving communication signals from a transmitter over multiple parallel channels, including a first channel and at least one second channel, the signals on the first channel carrying a first sequence of first symbols, and the signals on the at least one second channel carrying at least one second sequence of second symbols, which are transmitted by the transmitter in a predetermined relation to the first symbols, signal processing apparatus comprising: an input circuit, which is coupled to process the signals received on the multiple parallel channels so as to extract therefrom at least the first and second sequences of symbols; a first-in-first-out (FIFO) memory, which is coupled to the input circuit so as to receive and store at least one bit of each of the received symbols in a first interval of the first sequence and a second interval of at least the second sequence, the second interval at least partially overlapping the first interval; a symbol predictor, which is adapted, based on the predetermined relation between the first and second symbols, to determine for each of the received symbols in the first interval of the first sequence an expected value of the at least one bit in a corresponding one of the second symbols in the second interval; and comparison logic, which is adapted to compare the expected value with the at least one bit of each of the received second symbols in the FIFO memory, so as to determine a communication mode between the transmitter and the data receiver.