The present invention relates to communications systems circuits generally, and more particularly to the configuration, control, and management of high-speed multi-wire serial interfaces used for chip-to-chip communication, including compensation of differential propagation delay.
In modern digital systems, digital information has to be processed in a reliable and efficient way. In this context, digital information is to be understood as information available in discrete, i.e., discontinuous values. Bits, collection of bits, but also numbers from a finite set can be used to represent digital information.
In most chip-to-chip, or device-to-device communication systems, communication takes place over a plurality of wires to increase the aggregate bandwidth. A single or pair of these wires may be referred to as a channel or link and multiple channels create a communication bus between the electronic components. At the physical circuitry level, in chip-to-chip communication systems, buses are typically made of electrical conductors in the package between chips and motherboards, on printed circuit boards (“PCBs”) boards or in cables and connectors between PCBs. In high frequency applications, microstrip or stripline PCB traces may be used.
Common methods for transmitting signals over bus wires include single-ended and differential signaling methods. In applications requiring high speed communications, those methods can be further optimized in terms of power consumption and pin-efficiency, especially in high-speed communications. More recently, vector signaling methods have been proposed to further optimize the trade-offs between power consumption, pin efficiency and noise robustness of chip-to-chip communication systems. In those vector signaling systems, the digital information is transformed into a different representation space in the form of a vector codeword that is chosen in order to optimize the power consumption, pin-efficiency and speed trade-offs based on the transmission channel properties and communication system design constraints. Herein, this process is referred to as “encoding”. At the receiver side, the received signals corresponding to the codeword are transformed back into the original digital information representation space. Herein, this process is referred to as “decoding”.
At the other side of bus 130, a receive unit 140 maps the n received physical signals from wires 135 back into k information symbols 145. Receive unit 140 comprises a bus receiver in the form of a signal-to-digital converter (“SDC”) 160 and a vector codeword decoder (“DEC”) 170. In
As an example, bus 130 might be a bus between a processor and memory. In that case, the physical wires may take the form of striplines or microstrips on a PCB. Another example of bus 130 might be a set of wires connecting two different devices.
High speed communications interfaces comprising multiple independent channels operating as a group introduce new operational issues not seen in single-circuit links. Beyond the usual requirements of clock recovery, data framing, and channel equalization, inter-channel effects such as differential link gain and differential link delay must also be addressed to insure that the signals received on all channels may be combined to accurately reproduce at the receiver the group-encoded symbols sent by the transmitter.
Methods are described to adjust channel receive characteristics to optimize data transfer, both as a link initialization procedure using known training sequences, and as a dynamic adjustment process performed during normal data transmission.
As described in Cronie I, Cronie II, Cronie III and Cronie IV, vector signaling codes may be used to produce extremely high bandwidth data communications links, such as between two integrated circuit devices in a system. Multiple data communications channels transmit symbols of the vector signaling code, acting together to communicate codewords of the vector signaling code. Thus, proper operation of the communications interface requires two levels of operational management and control: adjustment of each individual channel so as to accurately communicate individual symbols, and coordination across all channels so as to deliver coherent codewords of the vector signaling code for decoding.
Depending on the particular vector signaling code used, the number of channels comprising a communications link may range from two to eight or more. Individual symbols, e.g. transmissions on any single communications channel, may utilize multiple signal levels, often three or more. Operation at channel rates exceeding 10 Gbps may further complicate receive behavior by requiring deeply pipelined or parallelized signal processing, precluding reception methods that require the previous received value to be known as the current value is being received.
Embodiments described herein can also be applied to prior art permutation sorting methods not covered by the vector processing methods of Cronie II, Cronie III, Cronie IV and/or Cronie V. More generally, embodiments of the present invention can apply to any communication or storage methods requiring coordination of multiple channels or elements of the channel to produce a coherent aggregate result.
Vector Processing Background
In this disclosure, the methods disclosed in Cronie II, Cronie III, and Cronie IV are collectively described as “vector processing” methods, including permutation modulation codes as in Cronie III and sparse signaling codes as in Cronie IV. A permutation modulation code or sparse signaling code CW1 is defined by a basis vector, x0, where the code consists of all permutations of x0.
One permutation modulation code used in examples herein is the “8b8w” code, so named as it can encode eight binary bits of data for communication over eight wires. The 8b8w code is balanced and ternary, and consists of the symbol values “+1”, “0”, and “−1” in any permutation of the basis vector “+1, +1, 0, 0, 0, 0, −1, −1”, as described in Cronie III. Another permutation modulation code is the “H4” code, derived from the 4×4 Hadamard matrix as described in Cronie I. The H4 code consists of all permutations of the symbol values “+1, −⅓, −⅓, −⅓” and “−1, +⅓, +⅓, +⅓”. Thus, it is balanced and quaternary, although any one H4 codeword utilizes only two of the four possible symbol values.
A common theme in vector processing methods is that permutation modulation methods are most efficiently decoded by integrating a sorting decoder at the communication receiver, as illustrated as 160 in
The rank-order sorting operation may determine a full ordering of the sampled values on the wires or a partial order. A full ordering would mean that all values on the n wires are sorted. A partial ordering would mean that only a subset of the wires are determined that carry some of the largest and some of the smallest values, which is enough when the other values are non-quiescent, in particular in the case of a sparse modulation code. For purposes of explanation, the following descriptions assume the sampled values are ordered from a most positive or “highest” value, to a most negative or “lowest” value, where values representing “+1” symbols are higher than those representing “0” which are in turn higher than those representing “−1”. In practice, these values may span positive and negative signal voltages including zero, or may be exclusively positive or exclusively negative signal voltage values.
Possible detailed embodiments of rank-order units 190 and codeword decoder 170 have been taught in Cronie III. For instance, in some embodiments, rank-order units 190 may further comprise a max-detector unit to select the highest (positive) values and a min-detector unit to select the lowest (negative) values out of the n components of the sampled y vector signal.
An example of a sampled 8b8w vector signal may be:
y=[1.1 0.2 −1.3 0.19 −0.9 0.01 −0.3 1.2] Eqn. 3
where the largest value 1.2 is detected on wire 8, the second largest value 1.1 is detected on wire 1, the smallest value −1.3 is detected on wire 3 and the second smallest value is detected on wire 5. The remaining elements are treated as corresponding to “0” elements. Thus, the rank order unit may output a vector [2, 3, 8, 4, 7, 5, 6, 1], or in some embodiments, [2, x, 8, x, 7, x, x, 1]. The outputs may be binary values, thermometer codes, or another suitable format.
Codeword decoder 170 can then reconstruct the original vector CW1 as:
CW1=[+1 0 −1 0 −1 0 0+1] Eqn. 4
Codeword decoder 170 can then further reconstruct the k output bits 145 by mapping back vector CW1 into the initial representation space, by applying the reverse operation of encoder 110.
Example Receiver Architecture
For purposes of description, one example embodiment of the receiver component of a vector signaling code communications architecture in accordance with the invention is illustrated in
Thus, multiwire bus design rules adequate to support Megahertz signaling rates and simple differential links may be found to be insufficient at Gigahertz speeds and wider communications channels, requiring the introduction of active equalization to provide adequate signal edge definition, and skew control to compensate for differential delay characteristics among the channels.
A separate receive channel circuit 210 is provided for each receive signal line comprising the vector signaling code communications link as shown in
For the purposes of this document, the use of a track-and-hold circuit with an output that is not used in further processing until its hold step shall be considered equivalent to the described sample-and-hold circuit.
As illustrated in
The operation of ranking or sorting circuit 270 is further detailed in
The relationship between the symbol-rate master receive clock and the signal sampling interval on each channel is show in greater detail in
As previously described, each receive channel 306 produces a digital output signal 307 proportionate to receive channel input 320 signal level. These digital output signals 307 are compared 308 (as an example, as pulse-position-encoded signals compared by an arbiter circuit) producing ranked outputs 309 which may be decoded 310 for computational convenience into a permuted enumeration 311 for analysis by CDR phase decision system 312 and channel phase decision system 316, respectively producing CDR phase adjustments 313 and channel phase adjustments 317.
There are thus two phase control loops—a first loop controlling overall phase of sample clock 303, and a second loop which controls offset from sample clock 303 to each individual channel sampling clocks 305.
Example embodiments of the component circuits of such a receiver are taught in Tajalli I and Cronie V.
Impact of Selecting Sample Time
When codewords composed of multiple symbols are transmitted on multiple channels, this effect may cause variations in signal arrival times between different channels to appear as variations in receive signal amplitudes on those channels, if all channels are sampled simultaneously. These variations subsequently result in different sort orders obtained from the sorting decoder, potentially resulting in incorrect symbol identification. Thus, the single-link concept of “eye opening” is seen to have two distinct components in systems utilizing vector signaling codes; a per-wire component focused on producing normalized signal levels by sampling that wire in the center of its stable time, and an aggregate component dedicated to delivering correctly-formed codewords composed of symbols coherent in time, that is, originally transmitted together and equitably combined by the receiver. Operationally, this implies two levels of parameter manipulation are also required, to control adjustment of individual channel gain, equalization, and sample timing, and to manage cross-channel variations including differential gain and timing skew.
Measuring Channel Gain Characteristics
At least one embodiment in accordance with the invention does not include separate channel measurement sensors to, as examples, measure absolute signal levels on individual circuits or signal edge transitions independent of the selected sampling window. Addition of such additional measurement components would significantly impact complexity, performance, and cost of the communications system. Therefore, it is advantageous to identify solutions allowing analyses of both initial and ongoing signal characteristics using metrics already present in the existing receiver and decoder systems.
As an example, consider the operation of the sorting decoder. Its output is a ranking of inputs by amplitude which are subsequently categorized into, using the example of the 8b8w code of Cronie III, two positive values corresponding to symbols herein called “+1”, four quiescent values corresponding to symbols herein called “0”, and two negative values corresponding to symbols herein called “−1”.
No absolute numeric values are available for the measured signal levels. However, analysis of the symbol categorization results over time can provide indications of differential behavior among channels. For example, if the absolute signal amplitudes of channels 1 and 2 were identical, then it follows that “+1” symbols identified as appearing simultaneously on the two channels should, on average, appear in first-to-last sorted channel results in {1, 2, . . . . } and {2, 1, . . . } orders with equal probability. Conversely, a bias of channel 1 always being ranked ahead of (in this example, more positive than) channel 2 in such measurements may indicate a differential gain imbalance between those channels. Similar arguments may be made for “−1” symbols, and for “0” symbols, addressing other adjustable characteristics such as voltage-to-time converter scale and offset voltage, rather than channel gain.
In at least one embodiment in accordance with the invention, the information available for analysis consists of the raw ranking results 280 provided by the ranking decoder 270 of
To distinguish steady-state and transient signal effects, triplets of ranking information obtained in three consecutive clock intervals are analyzed rather than individual interval data. Thus, as an example, consecutive identification of ranked results that would be interpreted as [+1, +1, +1] symbols simultaneously occurring on both channel 1 and channel 2 provides an excellent opportunity to compare steady-state differential gain on those two channels, as the middle of the three samples will be relatively unaffected by transient effects such as equalization or skew.
At least one embodiment in accordance with the invention stores results obtained from the rank decoder on consecutive symbol intervals for analysis by a control processor. For the example 8b8w code and highest to lowest ranks numbered 1 to 8, ranks 1 and 2 correspond to “+1” symbols, ranks 3 through 6 correspond to “0” symbols, and ranks 7 and 8 correspond to “−1” symbols. In a well-balanced system (uniform gain and equalization across all channels, well calibrated measurement circuits, etc.) a given wire should have equal probability of being ranked 1 or 2 in the middle sample of three consecutive “+1” symbols. Similarly, a middle sample of three consecutive “−1” symbols should have equal probability of being ranked 7 or 8, and a middle sample of three consecutive “0” symbol should have equal probability of being ranked 4 or 5, and equal probability of being ranked 3 or 6. Symbol triplets suitable for steady-state voltage adjustments such as gain and DC offset are listed in Table 1.
In at least one embodiment, results are stored using a memory device. The memory device may include (or take the form of) random access memory (RAM), flash memory, volatile memory devices, non-volatile memory devices, transistors, flip flops, latches, capacitors, or any other memory device as known to one of skill in the art.
At least one embodiment in accordance with the invention encapsulates such desirable sequences as pattern-matching “rules”, which are evaluated by an out-of-band control processor. Rules utilizing analysis of a signal characteristic over time (such as “equal probability of rank 1 and 2”) may be called “statistical” rules, and require assessment of many comparison events and thus storage of ongoing statistical measurements. More conveniently, rules may directly compare the values seen when desirable patterns simultaneously occur on two different wires; so-called “direct comparison” rules. For direct comparison rules, all of the information necessary for analysis is contained in the rule pattern, identification of the two wires associated with the pattern, and an identifier of which wire has the more positive sorted or ranked value in the middle value of the triplet, which may be provided by a single bit of information.
It should be noted that such pattern-matching rules do not necessarily require the intentional transmission of known data patterns or sequences, as in a link start-up or “training” code pattern. At least one embodiment in accordance with the invention utilizes such training patterns to calibrate and adjust link characteristics. Known training patterns facilitate adjustment of systems where there is no a priori knowledge of channel loss, skew, or noise characteristics, as an example at system startup time. This allows gross calibration adjustments of, as an example, receive clock phase to be made without risk of data corruption. However, the described measurement and adjustment methods may be applied equally well to incremental adjustments using data patterns found to occur during normal data transmission. At least one embodiment in accordance with the invention performs incremental adjustments of link characteristics non-disruptively during normal data transmission, for purposes of continually optimizing link operation and dynamically adapting to changing signal characteristics.
Various embodiments in accordance with the invention present data to the control processor for analysis using a serial or parallel interface, FIFO data structure, shared memory, and/or message-passing interface. The data for analysis may consist of raw output results from the sorting decoder, such results converted into wire ranking form, or such results filtered or pre-processed to present only the information necessary for analysis. Data may be provided continuously, or as bursts of consecutive measurements sent periodically, and the control processor may be implemented as a dedicated logic circuit, programmed logic finite state machine, or software running on a general-purpose processor.
At least one embodiment in accordance with the invention encodes the sorting decoder ranks using the permuted enumeration shown in Table 2. Using this permutation, the most-significant bit or bits of the number identifies the symbol value represented to allow quick comparison when identifying triplets, and the least-significant bit or bits of the number shows relative rank within the same symbol value to permit two wires of the same symbol value to be quickly compared in relative rank.
An embodiment using such a permuted enumeration to identify the ranking of eight wires will transmit to the control processor 8×3 bits of information per symbol interval, for sufficient consecutive symbol intervals to provide reasonable expectation that suitable simultaneously-occurring triplets may be identified within the set.
Measuring Dynamic Channel Characteristics
Additional triplet patterns may be considered which correspond to rules for analysis of dynamic channel characteristics, including line equalization, sampling clock phase, and incremental clock offset (also known as “skew compensation.”)
Consider a pattern of consecutive symbols such as [“0”, “+1”, “0”]. In an ideal well-equalized system, the peak amplitude of the single-interval “+1” pulse would be the same as a steady-state “+1” signal on the same wire, and rise- and fall-times would be fast and without overshoot so that “0” values preceding and following the pulse would also be comparable to those seen during steady-state “0” on the same wire. Variations from this ideal may indicate under-equalization, resulting in slow rise/fall times which will be seen as lower pulse amplitude and/or higher pre- and post-pulse amplitude, or over-equalization which presents itself as overshoot or ringing which will be seen as anomalous high pulse amplitudes and/or low pre- or -post pulse levels. Triplets suitable for equalization adjustment are listed in Table 3.
In at least one embodiment of the invention, an out-of-band control processor responds to identification of incorrect equalization, as evidenced as one example as observation that a different rank ordering always occurs on the middle sample of a “pulse” triplet versus on the middle sample of a “reference flat line” triplet, for a first wire as compared to a second wire.
Sampling Clock Phase Measurement
Similarly, asymmetries in the pre- and post-pulse values may indicate a timing window error in that channel's sample-and-hold circuit. Using the same example pattern, early sampling may cause the pre-pulse value to appear to be slightly high, and the pulse value to appear to be slightly low, as the measurement window will incorrectly include portions of the adjacent time period.
At least one embodiment in accordance with the invention identifies timing window errors more directly, using symbol triplets that cover time periods in which there is a single monotonic rising or single monotonic falling signal transition on each of a pair of wires, as enumerated in Table 4 for the example of an 8b8w vector signaling code.
In at least one embodiment in accordance with the invention, a master symbol-interval sample clock is generated which corresponds to the periodic reception of valid symbols across all wires. Adjustable delay elements (herein called Phase Interpolators) are used to allow each individual wire's receive channel sampling time to be offset incrementally from that master clock, allowing each wire's signal to be sampled at the appropriate time for its particular propagation delay characteristics.
For the master clock phase adjustment, identified as CDR Phase Interpolator 302 in
The same triplets in Table 4 are also used to adjust the incremental delay of the individual Phase Interpolators associated with each wire, identified as Lane Align Phase Interpolators 304 in
The described application of the signal amplitude measurements performed during this triplet analysis to discern errors in sampling time is graphically illustrated in
It is noted that the sensitivity of both master clock and incremental delay measurements are heightened under slightly degraded signal conditions.
This reduction in loop sensitivity under optimum signal characteristics is similar to the “dead zone” around the set value that is often seen in traditional closed-loop feedback systems. At least one embodiment in accordance with the invention intentionally reduces high-frequency compensation under good signal conditions to increase the slope of the eye bottom 504, thus reducing the time adjustment dead zone without impacting overall error rate.
Measurement and Control Loop
The relationship between the existing elements of a vector signaling code receive data path and the measurement and control loop in accordance with at least one embodiment of the invention is shown in
As previously described, the control loop that manages this receive operation re-uses many of the existing data path functions, rather than requiring separate measurement devices. Different embodiments in accordance with the invention may implement this management of receive operation using an out-of-band control processor herein simply called the control processor, implemented as dedicated logic circuits, a programmed logic finite state machine, or as software running on a general-purpose processor. The control processor examines ranked results 606 to identify 620 data patterns 621, such as the consecutive triplets of results of Tables 1, 3, and 4. These data patterns are analyzed 622 to determine if a channel secondary characteristic such as gain, offset, equalization, or sample timing requires adjustment 623. If so, the control processor issues commands 624 to initiate the adjustments 625 to the data path receiver resulting in changes to one or more of its operational functions or parameters.
Various embodiments in accordance with the invention interface these command/control operations issued by the control processor to in-band data processing circuitry to perform the desired adjustment, using a serial or parallel interface, FIFO data structure, shared memory, and/or message-passing interface. Alternate and equivalent embodiments of the invention may co-located elements of these control, interface, and adjustment circuits within with the data channels (i.e. in-band), at the control processor, or distributed between the data channels and control processor. Elements of such adjustment circuits, as one example a Digital-to-Analog converter (DAC), may be dedicated to a single wire or adjustment function or may be shared by two or more wires or functions. In the latter case, multiplexing elements such as sample-and-hold circuits may also be incorporated to facilitate such DAC sharing.
In at least one embodiment of the invention, the control processor response to identification of a gain variation is to adjust the gain of at least one wire's input amplifier. As is well known in the art, such gain adjustment may be implemented by modifying the current available to an amplification stage, changing the resistance of a voltage- or current-controlled variable resistance element, switching resistance elements into the circuit in series or in parallel combinations, or utilizing a resistive ladder structure controlled by switching transistors to produce a binary or other hierarchy of resistive values applied to the circuit at a predetermined gain adjustment node.
In at least one embodiment of the invention, the control processor response to identification of a frequency compensation or equalization variation is to electronically adjust one ore more resistive, inductive, or capacitive elements of one or more wire continuous time linear equalizer (CTLE) circuits, as one example. Such adjustment methods are well known in the art, and may utilize electronic switching of passive resistive, inductive, or capacitive elements, or adjustment of inherently variable active devices such as varactors, MOS channel resistors, etc.
In at least one embodiment of the invention the control processor response to identification of a voltage offset variation is to modify the bias or baseline voltage output level of at least one wire's input amplifier. As is also well known in the art, this modification may be produced by modifying the current entering a node of the amplifier, providing an offsetting voltage to a node of the amplifier, modifying the input bias provided to the amplifier, or adjusting the resistive value of an element within the amplifier using one of the previously described methods.
In at least one embodiment of the invention, the control processor response to a timing-related variation is to adjust one or more Phase Interpolators controlling timing in one or more data path receivers. As is well known in the art, phase interpolators mix two or more phases of a multiphase clock so as to synthesize an output clock with the desired phase relationship. Embodiments are known in which such mixing is performed in the analog and in the digital domain. Alternative embodiments may utilize variable delay structures known in the art, such as tapped delay lines or variable delay lines controlled by the control processor to provide equivalent timing adjustment.
In at least one embodiment, a system comprises a plurality of receive channel circuits, each receive channel circuit configured to receive an input signal of a set of input signals, each input signal representing a symbol of a codeword of a vector signaling code; a plurality of sample units configured to generate a set of signal sample values based on the set of input signals; a rank-order unit configured to provide a set of rank order values comprising a respective rank order value for each signal sample value, each rank order value indicative of a relative magnitude of the corresponding signal sample value with respect to other signal sample values; a decoder unit configured to receive the set of rank order values and to responsively determine symbols of a codeword; and, a control processor configured to receive the set of rank order values and to process at least two rank order values from the set of rank order values, and to generate a channel receiver control signal for at least one receive channel circuit corresponding to one of the at least two rank order values.
In at least one embodiment, the control processor generates the channel receiver control signal based on a predetermined symbol sequence. In at least one embodiment, the predetermined symbol sequence is a known pattern of symbols. In at least one embodiment, the control processor receives the predetermined symbol sequence from the decoder unit. In at least one embodiment, the control processor is configured to decode the set of rank order values into symbols of a codeword, and identify a known pattern of symbols.
In at least one embodiment, the system further comprises a memory circuit configured to store previously transmitted rank order values. In at least one embodiment, each channel receive circuit comprises an amplifier configured to receive the channel receiver control signal from the control processor and to adjust a gain and/or a DC offset of the channel receive circuit. In at least one embodiment, each channel receive circuit comprises a line equalizer configured to receive the channel receiver control signal from the control processor and to compensate for frequency-dependent channel loss.
In at least one embodiment, the system further comprises a clock-and-data recovery (CDR) phase interpolator configured to receive the channel receiver control signal from the control processor and to responsively adjust a phase of a master clock associated with the plurality of sample units.
In at least one embodiment, each channel receive circuit comprises a lane align phase interpolator configured to receive channel receiver control signal from the control processor, and to responsively adjust a sample timing of an individual sample unit associated with a respective channel receive circuit.
In at least one embodiment, the vector signaling code comprises codewords based on permutations of a basis vector [+1 +1 0 0 0 0 −1 −1].
In at least one embodiment, the set of rank order values corresponds to a full sorting. In another embodiment, set of rank order values corresponds to a partial sorting.
In at least one embodiment, the known pattern of symbols comprises a first wire and a second wire receiving a sequence from the group consisting of a [+1, +1, +1], a [0 0 0], and a [−1 −1 −1].
In at least one embodiment, the known pattern of symbols comprises a first wire and a second wire receiving a sequence from the group consisting of a [0 +1 0], a [+1 0 +1], [0 −1 0], and a [−1 0 −1].
In at least one embodiment, the known pattern of symbols comprises a first wire and a second wire receiving a sequence from the group consisting of a [+1 +1 0], a [+1 +1 −1], a [+1 0 0], a [+1 −1 −1], a [0 +1 +1], a [0 −1 −1], a [0 0 +1], a [0 0 −1], a [−1 −1 0], a [−1 −1 +1], a [−1 0 0], a [−1 +1 +1], a [+1 0 −1], and a [−1 0 +1].
In at least one embodiment in accordance with the invention, a method is carried out, the method comprising: receiving a plurality of input signals into a plurality of receive channel circuits, wherein the input signals represent symbols of a codeword of a vector signaling code, generating a set of signal sample values based on the set of input signals by a plurality of sample units, generating a set of rank order values based on the set of signal sample values by a rank-order unit, wherein the set of rank order values comprises a respective rank order value for a corresponding signal sample value, each rank order value indicative of a relative magnitude of the corresponding signal sample value with respect to other signal sample values, determining symbols of a codeword based on the set of rank order values by a decoder, and, processing at least two rank order values of the set of rank order values by a control processor, and responsively generating a channel receiver control signal for at least one receive channel circuit corresponding to one of the at least two rank order values.
In at least one embodiment, the channel receiver control signal is generated based on a predetermined symbol sequence. In at least one embodiment, the predetermined symbol sequence is a known pattern of symbols. In at least one embodiment, the method further comprises receiving the predetermined symbol sequence from the decoder.
In at least one embodiment, the method further comprises the control processor decoding the set of rank order values into symbols of a codeword, and identifying a known pattern of symbols.
In at least one embodiment, the method further comprises storing previously transmitted rank order values.
In at least one embodiment, the method further comprises adjusting a gain of a respective channel receive circuit by an amplifier associated with the respective channel receive circuit based on the channel receiver control signal.
In at least one embodiment, the method further comprises adjusting a DC offset of a respective channel receive circuit by an amplifier associated with the respective channel receive circuit based on the channel receiver control signal.
In at least one embodiment, the method further comprises compensating for frequency-dependent channel loss of a respective channel receive circuit by a line equalizer associated with the respective channel receive circuit based on the channel receiver control signal.
In at least one embodiment, the method further comprises adjusting a phase of a master clock associated with the plurality of sample units by a clock-and-data recovery (CDR) phase interpolator based on the channel receiver control signal.
In at least one embodiment, the method further comprises adjusting a sample timing of a respective channel receive circuit by a lane align phase interpolator associated with the respective channel receive circuit based on the channel receiver control signal.
In at least one embodiment, the vector signaling code comprises codewords based on a permutation vector [+1 +1 0 0 0 0 −1 −1].
The examples presented herein illustrate the use of vector signaling codes for point-to-point wire communications. However, this should not been seen in any way as limiting the scope of the described invention. The methods disclosed in this application are equally applicable to other network topologies and other communication media including optical and wireless communications. Thus, descriptive terms such as “voltage” or “signal level” should be considered to include equivalents in other measurement systems, such as “optical intensity”, “RF modulation”, etc. Similarly, examples may reference a particular vector signaling code, number of channels, or codeword size for purposes of description without implying a limitation. Any described algorithm, method, or process may be performed by a hardware circuit, programmed or hardwired finite state machine, or by software executing on a control processor.
As used herein, the term “physical signal” includes any suitable behavior and/or attribute of a physical phenomenon capable of conveying information. Physical signals may be tangible, measurable, and non-transitory.
This application is a Continuation-in-Part of U.S. application Ser. No. 13/839,094, filed Mar. 15, 2013, naming Richard Simpson and Roger Ulrich, entitled “Control Loop Management and Differential Delay Correction for Vector Signaling Code Communications Links”. The following prior applications are herein incorporated by reference in their entirety for all purposes: U.S. Patent Publication 2011/0268225 of application Ser. No. 12/784,414, filed May 20, 2010, naming Harm Cronie and Amin Shokrollahi, entitled “Orthogonal Differential Vector Signaling” (hereinafter “Cronie I”). U.S. Patent Publication 2011/0302478 of application Ser. No. 12/982,777, filed Dec. 30, 2010, naming Harm Cronie and Amin Shokrollahi, entitled “Power and Pin Efficient Chip-to-Chip Communications with Common-Mode Resilience and SSO Resilience” (hereinafter “Cronie II”). U.S. patent application Ser. No. 13/030,027, filed Feb. 17, 2011, naming Harm Cronie, Amin Shokrollahi and Armin Tajalli, entitled “Methods and Systems for Noise Resilient, Pin-Efficient and Low Power Communications with Sparse Signaling Codes” (hereinafter “Cronie III”). U.S. patent application Ser. No. 13/176,657, filed Jul. 5, 2011, naming Harm Cronie and Amin Shokrollahi, entitled “Methods and Systems for Low-power and Pin-efficient Communications with Superposition Signaling Codes” (hereinafter “Cronie IV”). U.S. Patent Application No. 61/697,540, filed Sep. 6, 2012, naming Harm Cronie and Brian Holden, entitled “Sorting Decoder” (hereafter called “Cronie V”.) U.S. patent application Ser. No. 13/542,599, filed Jul. 5, 2012, naming Armin Tajalli, Harm Cronie, and Amin Shokrollhi entitled “Methods and Circuits for Efficient Processing and Detection of Balanced Codes” (hereafter called “Tajalli I”.) The following additional reference to prior art has been cited in this application: [Buchwald1] U.S. Pat. No. 6,509,773, filed Apr. 30, 2001 by Buchwald et al., entitled “Phase interpolator device and method.”
Number | Name | Date | Kind |
---|---|---|---|
3196351 | Slepian | Jul 1965 | A |
3636463 | Ongkiehong | Jan 1972 | A |
3939468 | Mastin | Feb 1976 | A |
4163258 | Ebihara et al. | Jul 1979 | A |
4181967 | Nash | Jan 1980 | A |
4206316 | Burnsweig | Jun 1980 | A |
4276543 | Miller | Jun 1981 | A |
4486739 | Franaszek | Dec 1984 | A |
4499550 | Ray, III | Feb 1985 | A |
4774498 | Traa | Sep 1988 | A |
4864303 | Ofek | Sep 1989 | A |
4897657 | Brubaker | Jan 1990 | A |
4974211 | Corl | Nov 1990 | A |
5053974 | Penz | Oct 1991 | A |
5166956 | Baltus et al. | Nov 1992 | A |
5168509 | Nakamura | Dec 1992 | A |
5283761 | Gillingham | Feb 1994 | A |
5287305 | Yoshida | Feb 1994 | A |
5412689 | Chan et al. | May 1995 | A |
5449895 | Hecht | Sep 1995 | A |
5459465 | Kagey | Oct 1995 | A |
5511119 | Lechleider | Apr 1996 | A |
5553097 | Dagher | Sep 1996 | A |
5599550 | Kohlruss | Feb 1997 | A |
5659353 | Kostreski | Aug 1997 | A |
5802356 | Gaskins | Sep 1998 | A |
5809430 | D'Amico | Sep 1998 | A |
5825808 | Hershey et al. | Oct 1998 | A |
5875202 | Venters | Feb 1999 | A |
5945935 | Kusumoto | Aug 1999 | A |
5995016 | Perino | Nov 1999 | A |
6005895 | Perino et al. | Dec 1999 | A |
6084883 | Norrell | Jul 2000 | A |
6119263 | Mowbray et al. | Sep 2000 | A |
6172634 | Leonowich | Jan 2001 | B1 |
6175230 | Hamblin | Jan 2001 | B1 |
6232908 | Nakaigawa | May 2001 | B1 |
6278740 | Nordyke | Aug 2001 | B1 |
6346907 | Dacy | Feb 2002 | B1 |
6359931 | Perino et al. | Mar 2002 | B1 |
6404820 | Postol | Jun 2002 | B1 |
6417737 | Moloudi | Jul 2002 | B1 |
6452420 | Wong | Sep 2002 | B1 |
6483828 | Balachandran | Nov 2002 | B1 |
6504875 | Perino | Jan 2003 | B2 |
6509773 | Buchwald et al. | Jan 2003 | B2 |
6556628 | Poulton et al. | Apr 2003 | B1 |
6563382 | Yang | May 2003 | B1 |
6621427 | Greenstreet | Sep 2003 | B2 |
6624699 | Yin | Sep 2003 | B2 |
6650638 | Walker | Nov 2003 | B1 |
6661355 | Cornelius et al. | Dec 2003 | B2 |
6766342 | Kechriotis | Jul 2004 | B2 |
6839429 | Gaikwad et al. | Jan 2005 | B1 |
6839587 | Yonce | Jan 2005 | B2 |
6865234 | Agazzi | Mar 2005 | B1 |
6865236 | Terry | Mar 2005 | B1 |
6954492 | Williams | Oct 2005 | B1 |
6990138 | Bejjani et al. | Jan 2006 | B2 |
6999516 | Rajan | Feb 2006 | B1 |
7023817 | Kuffner | Apr 2006 | B2 |
7053802 | Cornelius | May 2006 | B2 |
7085153 | Ferrant | Aug 2006 | B2 |
7142612 | Horowitz et al. | Nov 2006 | B2 |
7142865 | Tsai | Nov 2006 | B2 |
7167019 | Broyde et al. | Jan 2007 | B2 |
7180949 | Kleveland et al. | Feb 2007 | B2 |
7184483 | Rajan | Feb 2007 | B2 |
7269212 | Chau | Sep 2007 | B1 |
7335976 | Chen | Feb 2008 | B2 |
7356213 | Cunningham | Apr 2008 | B1 |
7358869 | Chiarulli et al. | Apr 2008 | B1 |
7362130 | Broyde et al. | Apr 2008 | B2 |
7389333 | Moore et al. | Jun 2008 | B2 |
7428273 | Foster | Sep 2008 | B2 |
7456778 | Werner | Nov 2008 | B2 |
7462956 | Lan | Dec 2008 | B2 |
7570704 | Nagarajan | Aug 2009 | B2 |
7633850 | Ahn | Dec 2009 | B2 |
7643588 | Visalli | Jan 2010 | B2 |
7656321 | Wang | Feb 2010 | B2 |
7697915 | Behzad | Apr 2010 | B2 |
7706524 | Zerbe | Apr 2010 | B2 |
7746764 | Rawlins et al. | Jun 2010 | B2 |
7787572 | Scharf | Aug 2010 | B2 |
7841909 | Murray | Nov 2010 | B2 |
7869497 | Benvenuto | Jan 2011 | B2 |
7882413 | Chen | Feb 2011 | B2 |
7933770 | Kruger et al. | Apr 2011 | B2 |
8050332 | Chung et al. | Nov 2011 | B2 |
8064535 | Wiley | Nov 2011 | B2 |
8091006 | Prasad et al. | Jan 2012 | B2 |
8106806 | Toyomura | Jan 2012 | B2 |
8159375 | Abbasfar | Apr 2012 | B2 |
8159376 | Abbasfar | Apr 2012 | B2 |
8185807 | Oh | May 2012 | B2 |
8199849 | Oh | Jun 2012 | B2 |
8204014 | Mondal et al. | Jun 2012 | B2 |
8218670 | Abou Rjeily | Jul 2012 | B2 |
8253454 | Lin | Aug 2012 | B2 |
8279094 | Abbasfar | Oct 2012 | B2 |
8295250 | Gorokhov | Oct 2012 | B2 |
8310389 | Chui | Nov 2012 | B1 |
8406315 | Tsai | Mar 2013 | B2 |
8429495 | Przybylski | Apr 2013 | B2 |
8442099 | Sederat | May 2013 | B1 |
8442210 | Zerbe | May 2013 | B2 |
8443223 | Abbasfar | May 2013 | B2 |
8462891 | Kizer | Jun 2013 | B2 |
8498368 | Husted | Jul 2013 | B1 |
8520493 | Goulahsen | Aug 2013 | B2 |
8539318 | Cronie et al. | Sep 2013 | B2 |
8547272 | Nestler | Oct 2013 | B2 |
8578246 | Mittelholzer | Nov 2013 | B2 |
8588280 | Oh | Nov 2013 | B2 |
8593305 | Tajalli | Nov 2013 | B1 |
8601338 | Kolze | Dec 2013 | B2 |
8638241 | Sudhakaran | Jan 2014 | B2 |
8649445 | Cronie et al. | Feb 2014 | B2 |
8649460 | Ware et al. | Feb 2014 | B2 |
8649840 | Sheppard, Jr. | Feb 2014 | B2 |
8780687 | Clausen | Jul 2014 | B2 |
8782578 | Tell | Jul 2014 | B2 |
8879660 | Peng | Nov 2014 | B1 |
8949693 | Ordentlich | Feb 2015 | B2 |
8951072 | Hashim | Feb 2015 | B2 |
8989317 | Holden | Mar 2015 | B1 |
9036764 | Hossain | May 2015 | B1 |
9069995 | Cronie | Jun 2015 | B1 |
9077386 | Holden | Jul 2015 | B1 |
9093791 | Liang | Jul 2015 | B2 |
9100232 | Hormati | Aug 2015 | B1 |
9106238 | Cronie | Aug 2015 | B1 |
9106465 | Walter | Aug 2015 | B2 |
9143362 | Wiley | Sep 2015 | B2 |
9281785 | Sjoland | Mar 2016 | B2 |
9331962 | Lida | May 2016 | B2 |
9362974 | Fox | Jun 2016 | B2 |
20010006538 | Simon | Jul 2001 | A1 |
20010055344 | Lee | Dec 2001 | A1 |
20020034191 | Shattil | Mar 2002 | A1 |
20020044316 | Myers | Apr 2002 | A1 |
20020057592 | Robb | May 2002 | A1 |
20020154633 | Shin | Oct 2002 | A1 |
20020163881 | Dhong | Nov 2002 | A1 |
20020174373 | Chang | Nov 2002 | A1 |
20030048210 | Kiehl | Mar 2003 | A1 |
20030071745 | Greenstreet | Apr 2003 | A1 |
20030105908 | Perino | Jun 2003 | A1 |
20030146783 | Bandy | Aug 2003 | A1 |
20030227841 | Tateishi | Dec 2003 | A1 |
20040003336 | Cypher | Jan 2004 | A1 |
20040003337 | Cypher | Jan 2004 | A1 |
20040057525 | Rajan | Mar 2004 | A1 |
20040086059 | Eroz | May 2004 | A1 |
20040156432 | Hidaka | Aug 2004 | A1 |
20040174373 | Stevens | Sep 2004 | A1 |
20050057379 | Jansson | Mar 2005 | A1 |
20050135182 | Perino | Jun 2005 | A1 |
20050149833 | Worley | Jul 2005 | A1 |
20050152385 | Cioffi | Jul 2005 | A1 |
20050174841 | Ho | Aug 2005 | A1 |
20050213686 | Love | Sep 2005 | A1 |
20050286643 | Ozawa | Dec 2005 | A1 |
20060018344 | Pamarti | Jan 2006 | A1 |
20060115027 | Srebranig | Jun 2006 | A1 |
20060133538 | Stojanovic | Jun 2006 | A1 |
20060159005 | Rawlins | Jul 2006 | A1 |
20060269005 | Laroia | Nov 2006 | A1 |
20070030796 | Green | Feb 2007 | A1 |
20070188367 | Yamada | Aug 2007 | A1 |
20070260965 | Schmidt | Nov 2007 | A1 |
20070263711 | TheodorKramer | Nov 2007 | A1 |
20070283210 | Prasad | Dec 2007 | A1 |
20080086670 | Krouk et al. | Apr 2008 | A1 |
20080104374 | Mohamed | May 2008 | A1 |
20080169846 | Lan | Jul 2008 | A1 |
20080273623 | Chung | Nov 2008 | A1 |
20080284524 | Kushiyama | Nov 2008 | A1 |
20090059782 | Cole | Mar 2009 | A1 |
20090063292 | Cole | Mar 2009 | A1 |
20090092196 | Okunev | Apr 2009 | A1 |
20090132758 | Jiang | May 2009 | A1 |
20090154500 | Diab | Jun 2009 | A1 |
20090185636 | Palotai | Jul 2009 | A1 |
20090193159 | Li | Jul 2009 | A1 |
20090212861 | Lim | Aug 2009 | A1 |
20090257542 | Evans | Oct 2009 | A1 |
20100020898 | Stojanovic | Jan 2010 | A1 |
20100046644 | Mazet | Feb 2010 | A1 |
20100104047 | Chen | Apr 2010 | A1 |
20100177816 | Malipatil | Jul 2010 | A1 |
20100180143 | Ware | Jul 2010 | A1 |
20100205506 | Hara | Aug 2010 | A1 |
20100296550 | Abou Rjeily | Nov 2010 | A1 |
20100296556 | Rave | Nov 2010 | A1 |
20110014865 | Seo | Jan 2011 | A1 |
20110051854 | Kizer | Mar 2011 | A1 |
20110084737 | Oh | Apr 2011 | A1 |
20110127990 | Wilson | Jun 2011 | A1 |
20110235501 | Goulahsen | Sep 2011 | A1 |
20110268225 | Cronie | Nov 2011 | A1 |
20110299555 | Cronie | Dec 2011 | A1 |
20110302478 | Cronie | Dec 2011 | A1 |
20110317559 | Kern | Dec 2011 | A1 |
20120063291 | Hsueh | Mar 2012 | A1 |
20120152901 | Nagorny | Jun 2012 | A1 |
20120161945 | Single | Jun 2012 | A1 |
20120213299 | Cronie | Aug 2012 | A1 |
20120257683 | Schwager | Oct 2012 | A1 |
20130010892 | Cronie | Jan 2013 | A1 |
20130051162 | Amirkhany | Feb 2013 | A1 |
20130163126 | Dong | Jun 2013 | A1 |
20130259113 | Kumar | Oct 2013 | A1 |
20140016724 | Cronie | Jan 2014 | A1 |
20140132331 | Gonzalez Diaz | May 2014 | A1 |
20140198837 | Fox | Jul 2014 | A1 |
20140226455 | Schumacher | Aug 2014 | A1 |
20140254730 | Kim | Sep 2014 | A1 |
20150010044 | Zhang | Jan 2015 | A1 |
20150078479 | Whitby-Strevens | Mar 2015 | A1 |
20150199543 | Winoto | Jul 2015 | A1 |
20150333940 | Shokrollahi | Nov 2015 | A1 |
20150381232 | Ulrich | Dec 2015 | A1 |
20160020796 | Hormati | Jan 2016 | A1 |
20160020824 | Ulrich | Jan 2016 | A1 |
20160036616 | Holden | Feb 2016 | A1 |
Number | Date | Country |
---|---|---|
2010031824 | Mar 2010 | WO |
Entry |
---|
Slepian, Permutation Modulation, IEEE, vol. 53, No. 3, Mar. 1965, pp. 228-236. |
International Search Report and Written Opinion for PCT/EP2011/002170 mailed Jul. 14, 2011. |
Stan et al., Bus-Invert Coding for Low-Power I/O, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 3, No. 1, Mar. 1995, pp. 49-58. |
Tallini et al., Transmission Time Analysis for the Parallel Asynchronous Communication Scheme, IEEE Transactions on Computers, vol. 52, No. 5, May 2003, pp. 558-571. |
International Search Report and Written Opinion for PCT/EP2012/052767 mailed May 11, 2012. |
International Search Report and Written Opinion for PCT/EP2011/074219 mailed Jul. 4, 2012. |
International Search Report and Written Opinion for PCT/EP2011/059279 mailed Sep. 22, 2011. |
Burr, Spherical Codes for M-ARY Code Shift Keying, University of York, Apr. 2, 1989, pp. 67-72, United Kingdom. |
Ericson et al., Spherical Codes Generated by Binary Partitions of Symmetric Pointsets, IEEE Transactions on Information Theory, vol. 41, No. 1, Jan. 1995, pp. 107-129. |
Farzan et al., Coding Schemes for Chip-to-Chip Interconnect Applications, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 14, No. 4, Apr. 2006, pp. 393-406. |
Abbasfar, A. “Generalized Differential Vector Signaling,” IEEE International Conference on Communications, ICC '09, (Jun. 14, 2009), pp. 1-5. |
DaSilva, et al., “Multicarrier Othogonal CDMA Signals for Quasi-Synchronous Communications Systems”, IEEE Journal on Selected Areas in Communications, vol. 12, No. 5 (Jun. 1, 1994), pp. 842-852. |
Wang et al., “Applying CDMA Technique to Network-on-chip,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Oct. 1, 2007, vol. 15., No. 10, pp. 1091-1100. |
International Search Report and Written Opinion of the International Searching Authority, mailed Nov. 5, 2012, in International Patent Application S.N. PCT/EP2012/052767, 7 pages. |
Healey, A., et al., “A Comparison of 25 Gbps NRZ & PAM-4 Modulation used in Legacy & Premium Backplane Channels”, DesignCon 2012, 16 pages. |
International Search Report for PCT/US2014/053563, dated Nov. 11, 2014, 2 pages. |
Clayton, P., “Introduction to Electromagnetic Compatibility”, Wiley-Interscience, 2006. |
She et al., “A Framework of Cross-Layer Superposition Coded Multicast for Robust IPTV Services over WiMAX,” IEEE Communications Society subject matter experts for publication in the WCNC 2008 proceedings, Mar. 31, 2008-Apr. 3, 2008, pp. 3139-3144. |
Poulton, et al., “Multiwire Differential Signaling”, UNC-CH Department of Computer Science Version 1.1, Aug. 6, 2003. |
Skliar et al., A Method For the Analysis of Signals: the Square-Wave Method, Mar. 2008, Revista de Matematica: Teoria y Aplicationes, pp. 109-129. |
International Search Report and Written Opinion from PCT/US2014/034220 mailed Aug. 21, 2014. |
International Search Report and Written Opinion for PCT/US14/052986 mailed Nov. 24, 2014. |
Burr, “Spherical Codes for M-ARY Code Shift Keying”, University of York, Apr. 2, 1989, pp. 67-72, United Kingdom. |
Notification of Transmittal of The International Search Report and The Written Opinion of the International Searching Authority, or The Declaration for PCT/EP2013/002681, dated Feb. 25, 2014, 15 pages. |
Brown, L., et al., “V.92: The Last Dial-Up Modem?”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ., USA, vol. 52, No. 1, Jan. 1, 2004, pp. 54-61. XP011106836, ISSN: 0090-6779, DOI: 10.1109/tcomm.2003.822168, pp. 55-59. |
Notification of Transmittal of International Search Report and The Written Opinion of the International Searching Authority, for PCT/US2015/018363, mailed Jun. 18, 2015, 13 pages. |
Counts, L., et al., “One-Chip Slide Rule Works with Logs, Antilogs for Real-Time Processing,” Analog Devices Computational Products 6, Reprinted from Electronic Design, May 2, 1985, 7 pages. |
Design Brief 208 Using the Anadigm Multiplier CAM, Copyright 2002 Anadigm, 6 pages. |
Grahame, J., “Vintage Analog Computer Kits,” posted on Aug. 25, 2006 in Classic Computing, 2 pages, http.//www.retrothing.com/2006/08/classic—analog—.html. |
Schneider, J., et al., “ELEC301 Project: Building an Analog Computer,” Dec. 19, 1999, 8 pages, http://www.clear.rice.edu/elec301/Projects99/anlgcomp/. |
Tierney, J., et al., “A digital frequency synthesizer,” Audio and Electroacoustics, IEEE Transactions, Mar. 1971, pp. 48-57, vol. 19, Issue 1, 1 page Abstract from http://ieeexplore. |
“Introduction to: Analog Computers and the DSPACE System,” Course Material ECE 5230 Spring 2008, Utah State University, www.coursehero.com, 12 pages. |
Notification of Transmittal of The International Search Report and The Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2014/015840, dated May 20, 2014. 11 pages. |
Notification of Transmittal of The International Search Report and The Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2014/043965, dated Oct. 22, 2014, 10 pages. |
Notification of Transmittal of The International Search Report and The Written Opinion of the International Searching Authority, or The Declaration, dated Mar. 3, 2015, for PCT/US2014/066893, 9 pages. |
Jiang, A., et al., “Rank Modulation for Flash Memories”, IEEE Transactions of Information Theory, Jun. 2006, vol. 55, No. 6, pp. 2659-2673. |
Zouhair Ben-Neticha et al, “The 'streTched”-Golay and other codes for high-SNR finite-delay quantization of the Gaussian source at 1/2 Bit per sample, IEEE Transactions on Communications, vol. 38, No. 12 Dec. 1, 1990, pp. 2089-2093, XP000203339, ISSN: 0090-6678, DOI: 10.1109/26.64647. |
Oh, et al., Pseudo-Differential Vector Signaling for Noise Reduction in Single-Ended Ended Signaling, DesignCon 2009. |
Loh, M., et al., “A 3×9 Gb/s Shared, All-Digital CDR for High-Speed, High-Density I/O” , Matthew Loh, IEEE Journal of Solid-State Circuits, Vo. 47, No. 3, Mar. 2012. |
Notification of Transmittal of the International Search Report and The Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/039952, dated Sep. 23, 2015, 8 pages. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/041161, dated Oct. 7, 2015, 8 pages. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/043463, dated Oct. 16, 2015, 8 pages. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/037466, dated Nov. 19, 2015. |
Number | Date | Country | |
---|---|---|---|
20150256326 A1 | Sep 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13839094 | Mar 2013 | US |
Child | 14717717 | US |