The following prior applications are herein incorporated by reference in their entirety for all purposes:
Present embodiments relate generally to the field of communications, and more particularly to the transmission and reception of signals for conveying information within and between devices.
In communication systems, a goal is to transport information from one physical location to another. It is typically desirable that the transport of this information is reliable, is fast and consumes a minimal amount of resources. One common information transfer medium is the serial communications link, which may be based on a single wire circuit relative to ground or other common reference, or multiple such circuits relative to ground or other common reference. A common example uses singled-ended signaling (“SES”). SES operates by sending a signal on one wire, and measuring the signal relative to a fixed reference at the receiver. A serial communication link may also be based on multiple circuits used in relation to each other. A common example of the latter uses differential signaling (“DS”). Differential signaling operates by sending a signal on one wire and the opposite of that signal on a matching wire. The signal information is represented by the difference between the wires, rather than their absolute values relative to ground or other fixed reference.
There are a number of signaling methods that maintain the desirable properties of DS while increasing pin efficiency over DS. Vector signaling is a method of signaling. With vector signaling, a plurality of signals on a plurality of wires is considered collectively although each of the plurality of signals might be independent. Each of the collective signals is referred to as a component and the number of plurality of wires is referred to as the “dimension” of the vector. In some embodiments, the signal on one wire is entirely dependent on the signal on another wire, as is the case with DS pairs, so in some cases the dimension of the vector might refer to the number of degrees of freedom of signals on the plurality of wires instead of exactly the number of wires in the plurality of wires.
Any suitable subset of a vector signaling code denotes a “subcode” of that code. Such a subcode may itself be a vector signaling code. With binary vector signaling, each component or “symbol” of the vector takes on one of two possible values. With non-binary vector signaling, each symbol has a value that is a selection from a set of more than two possible values. The set of all values required to represent all symbols is called the “alphabet” of the code. Thus, as examples, a binary vector signaling code requires at least an alphabet of two values, while a ternary vector signaling code requires at least an alphabet of three values. When transmitted as physical signals on a communications medium, symbols may be represented by particular physical values appropriate to that medium; as examples, in one embodiment a voltage of 150 mV may represent a “+1” symbol and a voltage of 50 mV may represent a “−1” symbol, while in another embodiment “+1” may be represented by 800 mV and “−1” as −800 mV.
A vector signaling code, as described herein, is a collection C of vectors of the same length N, called codewords. The ratio between the binary logarithm of the size of C and the length N is called the pin-efficiency of the vector signaling code. The Orthogonal Differential Vector Signaling or ODVS codes of [Cronie I], [Cronie II], [Shokrollahi I], and [Holden I] are examples of vector signaling codes, and are used herein for descriptive purposes.
Methods and systems are described for receiving, at a receiver, symbols of a codeword, the symbols received via wires of a multi-wire bus, the codeword representing an aggregate sum of a plurality of sub-channel constituent codewords, each sub-channel constituent codeword representing a weight applied to an associated sub-channel vector of a plurality of sub-channel vectors of an orthogonal matrix, generating a plurality of comparator outputs using a plurality of common-mode resistant multi-input comparators (MICs), each common-mode resistant MIC having a set of input coefficients representing a corresponding sub-channel vector of the plurality of sub-channel vectors, each sub-channel vector (i) mutually orthogonal and (ii) orthogonal to a common-mode sub-channel vector, each comparator output indicative of the weight applied to the corresponding sub-channel vector, outputting a set of forward-channel output bits formed based on the plurality of comparator outputs, obtaining a sequence of reverse-channel bits, and transmitting the sequence of reverse-channel bits by sequentially transmitting common-mode codewords over the wires of the multi-wire bus, each common-mode codeword transmitted by modulating weights of a common-mode sub-channel vector according to a corresponding bit in the sequence of reverse-channel bits.
In some embodiments, the set of forward-channel bits further comprises an output bit formed from a comparator output of a common-mode MIC. In some embodiments, the reverse-channel bits are selectively transmitted, and wherein the output bit formed from the common-mode MIC is formed in a time interval when the reverse-channel bits are not being transmitted.
In some embodiments, the reverse-channel bits are transmitted at a rate that is less than a symbol rate of the received symbols of the codeword. In some embodiments, the rate of the reverse-channel codeword is 256× slower than the symbol rate of the received symbols. In some embodiments, the symbol rate is 25 Gigabits per second, and wherein the rate of the reverse-channel codeword is 10 Megabits per second.
In some embodiments, the reverse-channel bits are obtained from a serializer.
In some embodiments, the reverse-channel bits are command bits. In some embodiments, the reverse-channel bits comprise error information. In some embodiments, the reverse-channel bits comprise management information, channel equalization information or wire-specific signal skew information.
Within communications receiver 130, detector 132 reads the voltages or currents on wires 125, possibly including amplification, frequency compensation, and common mode signal cancellation. In the present example, the received results 140, herein shown as R0, R1, R2, R3, R4, are provided directly by detector 132, without need of optional decoder 138. Similarly, Rclk 145 may be provided directly by detector 132 without need of optional decoder 138.
As will be readily apparent, different codes may be associated with different block sizes and different codeword sizes; for descriptive convenience and without implying limitation, the example of
Depending on which vector signaling code is used, there may be no decoder, or no encoder, or neither a decoder nor an encoder. For example, for the 8b8w code disclosed in [Cronie II], both encoder 112 and decoder 138 exist. On the other hand, for the 5b6w code of the present example, an explicit decoder is unnecessary, as the system may be configured such that detector 132 generates the received results 140 directly.
The operation of the communications transmitter 110 and communications receiver 130 have to be completely synchronized in order to guarantee correct functioning of the communication system. In some embodiments, this synchronization is performed by an external clock shared between the transmitter and the receiver. Other embodiments may combine the clock function with one or more of the data channels, as in the well-known Biphase encoding used for serial communications, or other methods described in the cited references and known art publications.
Receivers Using Multi-Input Comparators
As described in [Holden I] and further described in [Ulrich I], an efficient embodiment of an ODVS code receiver utilizes multiple-input weighted summation elements called a multi-input comparator or MIC. A MIC defined by coefficients a0, a1, . . . , am-1 is a summation circuit that accepts as its input a vector (x0, x1, . . . , xm-1) from a plurality of signal conductors and outputs
Result=(α0*x0+ . . . +am-1*xm-1) (Eqn. 2)
where (x0 . . . xm-1) is the signal weight vector for the summation circuit. In many embodiments, the desired output is a binary value, thus the value Result is sliced with an analog comparator or other such signal slicer circuit to produce a binary decision output. Because this is a common use case, the colloquial name of this circuit incorporates the term “comparator”, although other embodiments may apply the summation result to a PAM-3 or PAM-4 slicer to obtain ternary or quaternary outputs, or indeed may retain the analog output of Eqn. 2 for further computation.
Mathematically, the set of multi-input comparators comprising a code receiver may be concisely described using matrix notation, with the columns of the matrix corresponding to consecutive elements of input vector (x0, x1, . . . , xm-1) i.e. the plurality of signal conductor or wire inputs carrying the vector signaling code, and each row of the matrix corresponding to the vector defining a particular multi-input comparator and its output. In this notation, the value of matrix element corresponds to the weight vector or set of scaling factors applied to that column's input values by that row's multi-input comparator.
The matrix of Eqn. 3 describes one such set of multi-input comparators comprising a code receiver for the 5b6w code of [Shokrollahi I].
In this embodiment, six input wires, represented by the six matrix columns, are processed by five multi-input comparators represented by matrix rows 2-6. The rows 2-6 may also be referred to as sub-channel vectors. For purposes to be subsequently described, the first matrix row is a special case composed of all “1” values, creating a square 6×6 matrix, herein referred to as the common-mode sub-channel vector.
As used herein, a matrix M such as that of Eqn. 3 is called “orthogonal” if MTM=D that is, if the product of the matrix and its transpose is a diagonal matrix having non-zero values only on its diagonal. This is a weaker definition than commonly used, where the result is required to be the identity matrix, i.e. having diagonal values equal to 1. Matrix M may be normalized to satisfy the stronger conventional orthogonality requirement, but as described in [Shokrollahi I] such normalization is neither necessary nor desirable in practice.
In some embodiments, each vector of weights in a row is orthogonal to all other rows, and that other than the special case of the all “1” row (e.g., the common mode row), all rows sum to zero. As this implies the comparator outputs are also orthogonal (and therefore independent) they represent distinct communications modes, herein described as “sub-channels” or “sub-channel vectors” of the Vector Signaling Code communications system.
Given this modal interpretation, the initial row of the matrix may represent the common-mode sub-channel vector over the transmission medium. As it is desirable in a practical system for a data receiver to have common-mode rejection, the first row is set to all “1” values, maximizing the common mode contribution of each wire input to this one matrix row. As by definition all rows of the matrix are orthogonal, it follows that no other matrix row (i.e. no data receiver output) may then be impacted by common mode signals. Embodiments having such common mode rejection need not implement a physical comparator at the data receiver corresponding to the first row of their descriptive matrix.
Generating ODVS Codes Corresponding to a Receiver Matrix
As described in [Cronie I] and [Cronie II], an Orthogonal Differential Vector Signaling code may be constructed from a generator matrix by multiplication of an input modulation vector of the form (0, a1, a2, . . . an) by the matrix M In the simplest case, each ai of this vector is the positive or negative of a single value, as example ±1, representing one bit of transmitted information.
Given our understanding of M as describing the various communications sub-channels (modes) of the system, it may readily be seen that multiplication of the matrix by such an input vector comprises modulating each sub-channel vector by the ai, of that vector, with the zeroth mode corresponding to common mode transmission not being excited by the data transmitter at all. The modulated sub-channel vectors (sub-channel constituent codewords) are then when summed together to form a codeword to be transmitted on the bus. Although energy emitted by the data transmitter in the common mode is unnecessary for conventional data communication to the receiver, in some embodiments a nonzero amplitude for the common mode term is used to provide a nonzero bias or baseline value across the communications channel. In one embodiment, data transmission utilizes signals having a peak-to-peak swing of 300 mV, superimposed on a baseline voltage level of 450 mV provided to facilitate maintenance of proper input bias levels on the receiver front end.
As a further example, a code generated by this method from the matrix of Eqn. 3 is shown in Table 1.
As may be readily observed, the alphabet of this code consists of the values +1, +⅓, −⅓, −1, thus this is a quaternary code (e.g. having an alphabet size of four.) This code will subsequently be described herein as the 5b6w or “Glasswing” code, and its corresponding receive matrix of Eqn. 3 as the “Glasswing receiver”. Some embodiments of a Glasswing code transmitter and code receiver utilize two additional communications wires to transport a separate ODVS encoded channel carrying a Reference Clock signal generated by the transmitter and detected by the receiver, thus utilizing a total of eight communications wires for a complete unidirectional Glasswing interface.
In one embodiment, data transmission using the described code utilizes signals having a peak-to-peak swing of 300 mV, superimposed on a baseline voltage level of 450 mV provided to facilitate maintenance of input bias levels on the receiver front end. These signal levels may be efficiently generated using the multilevel series source terminated transmission line drivers of [Ulrich II] or other known art methods. The low power driver of [Amiri I] generates comparable output levels while using less transmission power, at the cost of greater variation in transmitter source impedance.
One compatible high-speed receiver embodiment illustrated in
Because the transmitted codeword is balanced, all line terminations 205 are connected at a common node 210, the voltage of which corresponds to the average or baseline voltage of the collective set of wires comprising the communications channel. Another embodiment incorporates bias source 211 to maintain the desired voltage at node 210, as one example if capacitive input coupling is used to break the DC path between transmitter and receiver. Another embodiment incorporates a bypass or filtering capacitor from common node 210 to ground, to reduce common-mode noise.
Secondary Communications Channel
It is common in communications systems for command, control, and management elements to maintain communications outside of the normal unidirectional data flow from transmitter to receiver. As one example, information such as error rates and other statistical data maintained by the receiver may need to be delivered to a management element co-located with the transmitter. As another example, the transmitter and receiver may need to coordinate adjustment or configuration of parameters such as equalization or sample timing, either during system initialization or as part of normal operation.
Embodiments having a full-duplex communication path (for example, comprised of Glasswing channels operating in both directions) can utilize a communication protocol that permits command/control/management information to be multiplexed with user data over the common communication path. But, such a solution is not available in a more restricted embodiment incorporating only simplex or unidirectional data communication, such as the single Glasswing channel from transmitter to receiver of the present examples. In prior art embodiments, this problem may have been resolved by incorporating a secondary data link such as a physically separate serial line, to provide communication from the receiving device back to the transmitting device.
In present embodiments, the previously unused common mode sub-channel vector of the ODVS code is used to provide this secondary data link via transmission of common-mode codewords. As previously mentioned, the common-mode codewords are orthogonal to all other sub-channel constituent codewords, thus its judicious use will not impact data communications. The above-described MICs are resilient to common-mode codewords, as a sum of the input coefficients to each MIC is equal to zero. Thus, any common-mode signals on the wires from common mode codewords will be canceled out due to the balanced nature of the MICs. However, as the common mode transmission characteristics with respect to noise, signal perturbations, etc. may be poorer than the primary data sub-channels, this secondary channel will typically be operated at a lower rate and optionally with additional signal filtering. As the actual wires of the communications medium are terminated identically at each end and the propagation time over the channel is very short compared to this lower signaling rate, the common mode of the channel may be driven from either (or indeed, both) ends.
In a first embodiment, the previously-described transmitter peak-to-peak swing of 300 mV superimposed on a baseline voltage level of 450 mV is augmented by a receiver-generated common mode signal of approximately 50 mV peak-to-peak, effectively causing the baseline voltage to vary between approximately 425 mV to 475 mV. This common-mode range is well within the normal operating region of the receiver front end, and the overall signal excursions of the combined transmit signal and baseline remain within the linear operating region of the receiver as well. Other embodiments may use lower or higher signaling levels on the common mode channel.
A receiver in accordance with this embodiment is shown in
Reverse-channel data Serializer 380 generates a serial stream of reverse channel data bits, with timing controlled by reverse channel clock 381 generated by Clock Recovery 360. For an example embodiment in which the primary channels are operating at 25 Gigabits/second (that is, with a transmit Unit Interval or UI of 40 psec) a clock division factor of 256× may be used within Clock Recovery 360 to produce clock 381, supporting a reverse channel data rate of approximately 10 Mbps.
A Glasswing transmitter embodiment is shown in
In some embodiments, each common-mode codeword is detected by summing values on the wires of the multi-wire bus and comparing the summation to a reference voltage. In such embodiments, a common-mode multi-input comparator (MIC) may sum the values and compares the summation to the reference voltage.
In some embodiments, the sequence of reverse-channel bits includes one or more control information bits, error performance bits, and/or command bits. In some embodiments, each common-mode codeword is received at a rate lower than a rate for transmitting the transmit codeword.
In some embodiments, the method further includes transmitting a transmit common-mode codeword by modulating the common-mode sub-channel vector according to an obtained sequence of forward-channel bits.
It should be noted that the usual source-series-terminated line drivers utilized in a Glasswing transmitter are shown in
An integrating slicer may also be used to sample the summed MIC output 451 prior to De-Serialization. To reduce the impact of noise on the received signal, a long integration window may be used, such as 1 nsec for a 10 Mbps reverse channel.
As the rate of reverse channel data transitions is locked by a known ratio to the primary data channel clock rate, there is no need for a full clock data recovery (CDR) system on the reverse channel. In one particular embodiment, the phase of reverse channel sample timing and framing of serial character sequences carried on that channel is derived by counting UI intervals from a fixed alignment point defined during system initialization. In another embodiment, these values are obtained by the reverse channel receiver detecting a startup sequence of known bit patterns that is transmitted over the reverse channel during system initialization.
It should be noted that the common mode signal levels observed at the transmitter will be influenced by changes in the terminating impedance provided by the transmit driver. Thus, the variable impedance presented by [Amiri I] may introduce spurious high frequency (i.e. UI rate) modulation of the received common mode signal.
In some embodiments, common-mode codewords may be driven from both ends of the channel. For example, a transmitter as shown in
In some embodiments, wherein the set of forward-channel bits further comprises an output bit formed from a comparator output of a common-mode MIC. In some embodiments, the reverse-channel bits are selectively transmitted, and wherein the output bit formed from a comparator output of a common-mode MIC is formed in a time interval when the reverse-channel bits are not being transmitted.
In some embodiments, the reverse-channel bits are transmitted at a rate that is less than a symbol rate of the received symbols of the codeword. In some embodiments, the rate of the reverse-channel codeword is 256× slower than the symbol rate of the received symbols. In some embodiments, the symbol rate is 25 Gigabits per second, and wherein the rate of the reverse-channel codeword is 10 Megabits per second.
In some embodiments, the reverse-channel bits are obtained from a serializer.
In some embodiments, the reverse-channel bits are command bits. In some embodiments, the reverse-channel bits comprise error information. In some embodiments, the reverse-channel bits comprise management information.
While the above embodiments describe use of a “Glasswing” code, it should be noted that other types of orthogonal differential vector signaling codes may be used as well. For example, the “Ensemble Non Return to Zero” (ENRZ) code may be used, also referred to herein as the “H4” code as it is based on the H4 Hadamard matrix. Such a transformation is described in [Cronie II]. As described by the equation below, 3 bits b[0]-b[2] are transformed into 4 symbols of an H4 codeword v[0]-v[3].
The above code includes 8 different codewords that are permutations of ±[1−⅓ −⅓−⅓].
A multi-input comparator circuit to detect the above code sums the received signal values on two selected wires, sums the received signal values on the remaining two wires, and outputs a comparison of the two summed results (e.g., by subtracting the two sums, and providing an analog output that may then be sampled or sliced), combining elements of line receiver and H4 code word detection operations. Another embodiment further may incorporate line equalization and amplification into the same circuit. Alternative embodiments utilizing separate summation, difference, and/or comparison functions are equivalent to the example integrated design.
For some mappings of host data to transmitted H4 code words, a direct relationship between the detected result of the three receive multi-input comparators and the receive host data exists, so no additional mapping logic is required at the receiver. At the receiver, three multi-input comparators perform the operations:
MIC0=(Wire 1+Wire 2)>(Wire 3+Wire 4)
MIC1=(Wire 1+Wire 3)>(Wire 2+Wire 4)
MIC2=(Wire 1+Wire 4)>(Wire 2+Wire 3)
An exemplary comparator network 230 in
The particular signal levels, data rates, and sampling methods described are provided for purposes of description, and do not suggest limitation. Further embodiments may incorporate described apparatus, methods, and known art in any combination.
The examples presented herein illustrate the use of vector signaling codes for point-to-point wire communications. For purposes of explanation, interconnection between a first transmitting device and a second receiving device have been described as unidirectional signaling networks. However, this should not been seen in any way as limiting the scope of the described embodiments. The methods disclosed in this application are equally applicable to networks for alternating signaling direction (i.e. half duplex), or of providing simultaneous communication between separate transmitters and receivers in both directions (i.e. full duplex.) Similarly, more than one instance of the described embodiments may be used essentially in parallel to communicate wider data words and/or provide higher overall communication bandwidth, with individual instances having individual embedded clocks, or two or more instances sharing a common clock. Other communication media including optical and wireless communications may similarly be used rather than the described wire interconnections. Thus, descriptive terms herein such as “voltage” or “signal level” should be considered to include equivalents in other measurement systems, such as “optical intensity”, “RF modulation”, etc. As used herein, the term “physical signal” includes any suitable behavior and/or attribute of a physical phenomenon for conveying information. Physical signals may be tangible and non-transitory.
This application is a continuation of U.S. application Ser. No. 16/808,252, filed Mar. 3, 2020, naming Ali Hormati, entitled “Low Power Chip-to-Chip Bidirectional Communications”, which is a continuation of U.S. application Ser. No. 16/174,147, filed Oct. 29, 2018, naming Ali Hormati, entitled “Low Power Chip-to-Chip Bidirectional Communications”, which is a continuation of U.S. application Ser. No. 15/636,309, filed Jun. 28, 2017, naming Ali Hormati, entitled “Low Power Chip-to-Chip Bidirectional Communications”, all of which are hereby incorporated herein by reference in their entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
3196351 | David | Jul 1965 | A |
3970795 | Allen | Jul 1976 | A |
4163258 | Ebihara et al. | Jul 1979 | A |
4499550 | Ray et al. | Feb 1985 | A |
5053974 | Penz | Oct 1991 | A |
5166956 | Baltus et al. | Nov 1992 | A |
5311516 | Kuznicki et al. | May 1994 | A |
5331320 | Cideciyan et al. | Jul 1994 | A |
5412689 | Chan et al. | May 1995 | A |
5449895 | Hecht et al. | Sep 1995 | A |
5553097 | Dagher | Sep 1996 | A |
5856935 | Moy et al. | Jan 1999 | A |
5982954 | Delen et al. | Nov 1999 | A |
6005895 | Perino et al. | Dec 1999 | A |
6084883 | Norrell et al. | Jul 2000 | A |
6084958 | Blossom | Jul 2000 | A |
6097732 | Jung | Aug 2000 | A |
6111895 | Miller et al. | Aug 2000 | A |
6154498 | Dabral et al. | Nov 2000 | A |
6226330 | Mansur | May 2001 | B1 |
6278740 | Nordyke | Aug 2001 | B1 |
6317465 | Akamatsu et al. | Nov 2001 | B1 |
6359931 | Perino et al. | Mar 2002 | B1 |
6452420 | Wong | Sep 2002 | B1 |
6483828 | Balachandran et al. | Nov 2002 | B1 |
6504875 | Perino et al. | Jan 2003 | B2 |
6556628 | Poulton et al. | Apr 2003 | B1 |
6621427 | Greenstreet | Sep 2003 | B2 |
6621945 | Bissessur | Sep 2003 | B2 |
6650638 | Walker et al. | Nov 2003 | B1 |
6661355 | Cornelius et al. | Dec 2003 | B2 |
6766342 | Kechriotis | Jul 2004 | B2 |
6865236 | Terry | Mar 2005 | B1 |
6876317 | Sankaran | Apr 2005 | B2 |
6898724 | Chang | May 2005 | B2 |
6954492 | Williams | Oct 2005 | B1 |
6990138 | Bejjani et al. | Jan 2006 | B2 |
6999516 | Rajan | Feb 2006 | B1 |
7023817 | Kuffner et al. | Apr 2006 | B2 |
7039136 | Olson et al. | May 2006 | B2 |
7075996 | Simon et al. | Jul 2006 | B2 |
7127003 | Rajan et al. | Oct 2006 | B2 |
7142612 | Horowitz et al. | Nov 2006 | B2 |
7167523 | Mansur | Jan 2007 | B2 |
7180949 | Kleveland et al. | Feb 2007 | B2 |
7184483 | Rajan | Feb 2007 | B2 |
7269212 | Chau et al. | Sep 2007 | B1 |
7356213 | Cunningham et al. | Apr 2008 | B1 |
7358869 | Chiarulli et al. | Apr 2008 | B1 |
7496130 | Rumney | Feb 2009 | B2 |
7633850 | Ahn | Dec 2009 | B2 |
7656321 | Wang | Feb 2010 | B2 |
7706456 | Laroia et al. | Apr 2010 | B2 |
7746764 | Rawlins et al. | Jun 2010 | B2 |
7868790 | Bae | Jan 2011 | B2 |
7869546 | Tsai | Jan 2011 | B2 |
7899653 | Hollis | Mar 2011 | B2 |
8050332 | Chung et al. | Nov 2011 | B2 |
8055095 | Palotai et al. | Nov 2011 | B2 |
8149906 | Saito et al. | Apr 2012 | B2 |
8159375 | Abbasfar | Apr 2012 | B2 |
8159376 | Abbasfar | Apr 2012 | B2 |
8199849 | Oh et al. | Jun 2012 | B2 |
8199863 | Chen et al. | Jun 2012 | B2 |
8218670 | Abou | Jul 2012 | B2 |
8245094 | Jiang et al. | Aug 2012 | B2 |
8279745 | Dent | Oct 2012 | B2 |
8279976 | Lin et al. | Oct 2012 | B2 |
8284848 | Nam et al. | Oct 2012 | B2 |
8289914 | Li et al. | Oct 2012 | B2 |
8295250 | Gorokhov et al. | Oct 2012 | B2 |
8365035 | Hara | Jan 2013 | B2 |
8472513 | Malipatil et al. | Jun 2013 | B2 |
8498368 | Husted et al. | Jul 2013 | B1 |
8520493 | Goulahsen | Aug 2013 | B2 |
8539318 | Shokrollahi et al. | Sep 2013 | B2 |
8577284 | Seo et al. | Nov 2013 | B2 |
8588254 | Diab et al. | Nov 2013 | B2 |
8588280 | Oh et al. | Nov 2013 | B2 |
8593305 | Tajalli et al. | Nov 2013 | B1 |
8620166 | Guha | Dec 2013 | B2 |
8644497 | Clausen et al. | Feb 2014 | B2 |
8649445 | Cronie et al. | Feb 2014 | B2 |
8687968 | Nosaka et al. | Apr 2014 | B2 |
8718184 | Cronie et al. | May 2014 | B1 |
8731039 | Sarrigeorgidis et al. | May 2014 | B1 |
8755426 | Cronie et al. | Jun 2014 | B1 |
8773964 | Hsueh et al. | Jul 2014 | B2 |
8780687 | Clausen et al. | Jul 2014 | B2 |
8831440 | Yu et al. | Sep 2014 | B2 |
8879660 | Peng et al. | Nov 2014 | B1 |
8938171 | Tang et al. | Jan 2015 | B2 |
8949693 | Ordentlich et al. | Feb 2015 | B2 |
8989317 | Holden et al. | Mar 2015 | B1 |
8996740 | Wiley et al. | Mar 2015 | B2 |
9015566 | Cronie et al. | Apr 2015 | B2 |
9071476 | Fox et al. | Jun 2015 | B2 |
9077386 | Holden et al. | Jul 2015 | B1 |
9100232 | Hormati et al. | Aug 2015 | B1 |
9197470 | Okunev | Nov 2015 | B2 |
9246713 | Shokrollahi | Jan 2016 | B2 |
9251873 | Fox et al. | Feb 2016 | B1 |
9288082 | Ulrich et al. | Mar 2016 | B1 |
9288089 | Cronie et al. | Mar 2016 | B2 |
9331962 | Lida et al. | May 2016 | B2 |
9362974 | Fox et al. | Jun 2016 | B2 |
9363114 | Shokrollahi et al. | Jun 2016 | B2 |
9401828 | Cronie et al. | Jul 2016 | B2 |
9432082 | Ulrich et al. | Aug 2016 | B2 |
9461862 | Holden et al. | Oct 2016 | B2 |
9479369 | Shokrollahi | Oct 2016 | B1 |
9509437 | Shokrollahi | Nov 2016 | B2 |
9537644 | Jones et al. | Jan 2017 | B2 |
9634797 | Benammar et al. | Apr 2017 | B2 |
9667379 | Cronie et al. | May 2017 | B2 |
9710412 | Sengoku | Jul 2017 | B2 |
10055372 | Shokrollahi | Aug 2018 | B2 |
20010006538 | Simon et al. | Jul 2001 | A1 |
20010055294 | Motoyoshi | Dec 2001 | A1 |
20020044316 | Myers | Apr 2002 | A1 |
20020152340 | Dreps et al. | Oct 2002 | A1 |
20020174373 | Chang | Nov 2002 | A1 |
20020181607 | Izumi | Dec 2002 | A1 |
20030086366 | Branlund et al. | May 2003 | A1 |
20030087634 | Raghavan et al. | May 2003 | A1 |
20030214977 | Kuo | Nov 2003 | A1 |
20040057525 | Rajan et al. | Mar 2004 | A1 |
20040146117 | Subramaniam et al. | Jul 2004 | A1 |
20040155802 | Lamy et al. | Aug 2004 | A1 |
20040161019 | Raghavan et al. | Aug 2004 | A1 |
20040239374 | Hori | Dec 2004 | A1 |
20050213686 | Love et al. | Sep 2005 | A1 |
20060013331 | Choi et al. | Jan 2006 | A1 |
20060126751 | Bessios | Jun 2006 | A1 |
20060159005 | Rawlins et al. | Jul 2006 | A1 |
20060251421 | Arnon | Nov 2006 | A1 |
20060291589 | Eliezer et al. | Dec 2006 | A1 |
20070030796 | Green | Feb 2007 | A1 |
20070070967 | Yang et al. | Mar 2007 | A1 |
20080043677 | Kim et al. | Feb 2008 | A1 |
20080104374 | Mohamed | May 2008 | A1 |
20080192621 | Suehiro | Aug 2008 | A1 |
20080316070 | Van et al. | Dec 2008 | A1 |
20090046009 | Fujii | Feb 2009 | A1 |
20090059782 | Cole | Mar 2009 | A1 |
20090110106 | Wornell et al. | Apr 2009 | A1 |
20090154604 | Lee et al. | Jun 2009 | A1 |
20100046644 | Mazet | Feb 2010 | A1 |
20100054355 | Kinjo et al. | Mar 2010 | A1 |
20100081451 | Mueck et al. | Apr 2010 | A1 |
20100215112 | Tsai et al. | Aug 2010 | A1 |
20100235673 | Abbasfar | Sep 2010 | A1 |
20100296556 | Rave et al. | Nov 2010 | A1 |
20100309964 | Oh et al. | Dec 2010 | A1 |
20110014865 | Seo et al. | Jan 2011 | A1 |
20110018749 | Muto et al. | Jan 2011 | A1 |
20110110340 | Lakkis | May 2011 | A1 |
20110122767 | Dent | May 2011 | A1 |
20110134678 | Sato et al. | Jun 2011 | A1 |
20110235501 | Goulahsen | Sep 2011 | A1 |
20110268225 | Cronie et al. | Nov 2011 | A1 |
20110286497 | Nervig | Nov 2011 | A1 |
20110299555 | Cronie et al. | Dec 2011 | A1 |
20110302478 | Cronie et al. | Dec 2011 | A1 |
20120213299 | Cronie et al. | Aug 2012 | A1 |
20120257683 | Schwager et al. | Oct 2012 | A1 |
20130010892 | Cronie et al. | Jan 2013 | A1 |
20130013870 | Cronie et al. | Jan 2013 | A1 |
20130114392 | Sun et al. | May 2013 | A1 |
20130202001 | Zhang | Aug 2013 | A1 |
20130259113 | Kumar | Oct 2013 | A1 |
20140177645 | Cronie et al. | Jun 2014 | A1 |
20140254642 | Fox et al. | Sep 2014 | A1 |
20150078479 | Whitby-Strevens | Mar 2015 | A1 |
20150222458 | Hormati et al. | Aug 2015 | A1 |
20150236885 | Ling et al. | Aug 2015 | A1 |
20150249559 | Shokrollahi et al. | Sep 2015 | A1 |
20150333940 | Shokrollahi | Nov 2015 | A1 |
20150349835 | Fox et al. | Dec 2015 | A1 |
20150365263 | Zhang et al. | Dec 2015 | A1 |
20150380087 | Mittelholzer et al. | Dec 2015 | A1 |
20150381768 | Fox et al. | Dec 2015 | A1 |
20160020824 | Ulrich et al. | Jan 2016 | A1 |
20160036616 | Holden et al. | Feb 2016 | A1 |
20160218894 | Fox et al. | Jul 2016 | A1 |
20160338040 | Lee et al. | Nov 2016 | A1 |
20160380787 | Hormati et al. | Dec 2016 | A1 |
20170272285 | Shokrollahi et al. | Sep 2017 | A1 |
20170317855 | Shokrollahi et al. | Nov 2017 | A1 |
20190103903 | Yang | Apr 2019 | A1 |
20200321778 | Gharibdoust et al. | Oct 2020 | A1 |
20200321967 | Tajalli et al. | Oct 2020 | A1 |
20210297292 | Hormati | Sep 2021 | A1 |
Number | Date | Country |
---|---|---|
1864346 | Nov 2006 | CN |
101854223 | Oct 2010 | CN |
2003163612 | Jun 2003 | JP |
4394755 | Oct 2009 | JP |
2005032000 | Apr 2005 | WO |
2009084121 | Jul 2009 | WO |
2010031824 | Mar 2010 | WO |
2019241081 | Dec 2019 | WO |
Entry |
---|
Penttinen, Jyrki, et al., “Performance Model for Orthogonal Sub Channel in Noise-limited Environment”, Sixth International Conference on Wireless and Mobile Communications, 2010, 56-61 (6 pages). |
Abbasfar, Aliazam , “Generalized Differential Vector Signaling”, IEEE International Conference on Communications, ICC '09, Jun. 14, 2009, 1-5 (5 pages). |
Anonymous , “Constant-weight code”, Wikipedia.org, retrieved on Feb. 6, 2017, (3 pages). |
Counts, Lew , 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, 3-9 (7 pages). |
Dasilva, Victor , et al., “Multicarrier Orthogonal CDMA Signals for Quasi-Synchronous Communication Systems”, IEEE Journal on Selected Areas in Communications, vol. 12, No. 5, Jun. 1994, 842-852 (11 pages). |
Farzan, Kamran , 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, 393-406 (14 pages). |
Giovaneli, Carlos Lopez, et al., “Space-Frequency Coded OFDM System for Multi-Wire Power Line Communications”, Power Line Communications and Its Applications, 2005 International Symposium on Vancouver, BC, Canada, IEEE XP-002433844, Apr. 6-8, 2005, 191-195 (5 pages). |
Healey, Adam , et al., “A Comparison of 25 Gbps NRZ & PAM-4 Modulation used in Legacy & Premium Backplane Channels”, Tyco Electronics Corporation, DesignCon 2012, Jan. 2012, 1-16 (16 pages). |
Holden, Brian , “An exploration of the technical feasibility of the major technology options for 400GE backplanes”, IEEE 802.3 400GE Study Group, Geneva, CH, Jul. 16, 2013, 1-18 (18 pages). |
Holden, Brian , “Simulation results for NRZ, ENRZ & PAM-4 on 16-wire full-sized 400GE backplanes”, IEEE 802.3 400GE Study Group, York, UK, Sep. 2, 2013, 1-19 (19 pages). |
Holden, Brian , “Using Ensemble NRZ Coding for400GE Electrical Interfaces”, IEEE 802.3 400GE Study Group, May 17, 2013, 1-24 (24 pages). |
Jiang, Anxiao , et al., “Rank Modulation for Flash Memories”, IEEE Transactions of Information Theory, vol. 55, No. 6, Jun. 2009, 2659-2673 (16 pages). |
Oh, Dan , et al., “Pseudo-Differential Vector Signaling for Noise Reduction in Single-Ended Signaling Systems”, DesignCon 2009, Rambus Inc., Jan. 2009, (22 pages). |
Poulton, John , “Multiwire Differential Signaling”, UNC-CH Department of Computer Science Version 1.1, Aug. 6, 2003, 1-20 (20 pages). |
She, James , et al., “A Framework of Cross-Layer Superposition Coded Multicast for Robust IPTV Services over WiMAX”, IEEE Wireless Communications and Networking Conference, Apr. 15, 2008, 3139-3144 (6 pages). |
Skliar, Osvaldo , et al., “A Method for the Analysis of Signals: the Square-Wave Method”, Revista de Matematica: Teoria y Aplicationes, vol. 15, No. 2, Mar. 2008, 109-129 (21 pages). |
Slepian, David , “Permutation Modulation”, Proceedings of the IEE, vol. 53, No. 3, Mar. 1965, 228-236 (9 pages). |
Wada, Tadahiro , et al., “A Study on Orthogonal Multi-Code CDMA Systems Using Constant Amplitude Coding”, Technical Report of IEICE, vol. 97, No. 132, Jun. 24, 1997, 19-24 (6 pages). |
Wang, Xin , et al., “Applying CDMA Technique to Network-on-Chip”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 15, No. 10, Oct. 1, 2007, 1091-1100 (10 pages). |
Number | Date | Country | |
---|---|---|---|
20210297292 A1 | Sep 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16808252 | Mar 2020 | US |
Child | 17341030 | US | |
Parent | 16174147 | Oct 2018 | US |
Child | 16808252 | US | |
Parent | 15636309 | Jun 2017 | US |
Child | 16174147 | US |