High speed communications system

Information

  • Patent Grant
  • 11863358
  • Patent Number
    11,863,358
  • Date Filed
    Tuesday, October 25, 2022
    a year ago
  • Date Issued
    Tuesday, January 2, 2024
    4 months ago
Abstract
Transmission of baseband and carrier-modulated vector codewords, using a plurality of encoders, each encoder configured to receive information bits and to generate a set of baseband-encoded symbols representing a vector codeword; one or more modulation circuits, each modulation circuit configured to operate on a corresponding set of baseband-encoded symbols, and using a respective unique carrier frequency, to generate a set of carrier-modulated encoded symbols; and, a summation circuit configured to generate a set of wire-specific outputs, each wire-specific output representing a sum of respective symbols of the carrier-modulated encoded symbols and at least one set of baseband-encoded symbols.
Description
REFERENCES

The following references are herein incorporated by reference in their entirety for all purposes:


U.S. Patent Publication No. 2011/0268225 of U.S. patent application Ser. No. 12/784,414, filed May 20, 2010, naming Harm Cronie and Amin Shokrollahi, entitled “Orthogonal Differential Vector Signaling”, hereinafter identified as [Cronie I];


U.S. Patent Publication No. 2012/0213299 of 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 identified as [Cronie II];


U.S. Patent Publication No. 2014/0198837 of U.S. patent application Ser. No. 14/158,452, filed Jan. 17, 2014, naming John Fox, Brian Holden, Peter Hunt, John D Keay, Amin Shokrollahi, Richard Simpson, Anant Singh, Andrew Kevin John Stewart, and Giuseppe Surace, entitled “Chip-to-Chip Communication with Reduced SSO Noise”, hereinafter identified as [Fox I];


U.S. Pat. No. 9,300,503 of U.S. patent application Ser. No. 13/842,740, filed Mar. 15, 2013, naming Brian Holden, Amin Shokrollahi and Anant Singh, entitled “Methods and Systems for Skew Tolerance in and Advanced Detectors for Vector Signaling Codes for Chip-to-Chip Communication”, hereinafter identified as [Holden I];


U.S. Provisional Patent Application No. 61/934,804, filed Feb. 2, 2014, naming Ali Hormati and Amin Shokrollahi, entitled “Methods for Code Evaluation Using ISI Ratio”, hereinafter identified as [Hormati I];


U.S. Provisional Patent Application No. 62/026,860, filed Jul. 21, 2014, naming Ali Hormati and Amin Shokrollahi, entitled “Multidrop Data Transfer”, hereinafter identified as [Hormati II];


U.S. Provisional Patent Application No. 61/934,807, filed Feb. 2, 2014, naming Amin Shokrollahi, entitled “Vector Signaling Codes with High pin-efficiency and their Application to Chip-to-Chip Communications and Storage”, hereinafter identified as [Shokrollahi I];


U.S. Provisional Patent Application No. 61/839,360, filed Jun. 23, 2013, naming Amin Shokrollahi, entitled “Vector Signaling Codes with Reduced Receiver Complexity”, hereinafter identified as [Shokrollahi II].


U.S. Provisional Patent Application No. 61/946,574, filed Feb. 28, 2014, naming Amin Shokrollahi, Brian Holden, and Richard Simpson, entitled “Clock Embedded Vector Signaling Codes”, hereinafter identified as [Shokrollahi III].


U.S. Provisional Patent Application No. 62/023,163, filed Jul. 10, 2014, naming Amin Shokrollahi and Roger Ulrich, entitled “Vector Signaling Codes with Increased Signal to Noise Characteristics”, hereinafter identified as [Shokrollahi IV].


U.S. patent application Ser. No. 13/895,206, filed May 15, 2013, now U.S. Pat. No. 9,288,082, granted Mar. 15, 2016, naming Roger Ulrich and Peter Hunt, entitled “Circuits for Efficient Detection of Vector Signaling Codes for Chip-to-Chip Communications using Sums of Differences”, hereinafter identified as [Ulrich I].


“Controlled Intersymbol Interference Design Techniques of Conventional Interconnection Systems for Data Rates beyond 20 Gbps”, Wendemagegnehu T. Beyene and Amir Amirkhany, IEEE Transactions on Advanced Packaging, Vol. 31 No. 4, pg. 731-740, November 2008, hereinafter identified as [Beyene].


TECHNICAL FIELD

The present invention relates to communications in general and in particular to the transmission of signals capable of conveying information and detection of those signals in wired communication.


BACKGROUND

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. Methods of information transport are broadly categorized into “baseband” methods that dedicate use of the physical communications channel to one transport method, and “broadband” methods that partition the physical communications channel in the frequency domain, creating two or more independent frequency channels upon which a transport method may be applied.


Baseband methods may be further categorized by physical medium. 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, multiple such circuits relative to ground or other common reference, or multiple such 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.


Parallel data transfer is also commonly used to provide increased interconnection bandwidth, with busses growing from 16 or fewer wires, to 32, 64, and more. As crosstalk and noise induced on the parallel signal lines can produce receive errors, parity was added to improve error detection, and signal anomalies were addressed through active bus termination methods. However, these wide data transfer widths inevitably resulted in data skew, which became the limiting factor in increased bus data transfer throughput. Alternative approaches were developed utilizing narrower bus widths operating at much higher clock speeds, with significant effort placed on optimizing the transmission line characteristics of the interconnection medium, including use of impedance-controlled connectors and micro stripline wiring. Even so, the inevitable path imperfections required use of active equalization and inter-symbol interference (ISI) elimination techniques, including active pre-emphasis compensation for transmitters and Continuous Time Linear Equalization (CTLE) and Decision Feedback Equalization (DFE) for receivers, all of which increased the complexity and power consumption of the communications interface.


A number of signaling methods are known that maintain the desirable properties of DS, while increasing pin efficiency over DS. One such method is Vector 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. Thus, vector signaling codes can combine the robustness of single circuit DS and the high wire count data transfer throughput of parallel data transfer. Each of the collective signals in the transport medium carrying a vector signaling codeword is referred to as a component, and the number of plurality of wires is referred to as the “dimension” of the codeword (sometimes also called a “vector”). 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 values that a symbol of the vector may take on is called the “alphabet” of the vector signaling code. A vector signaling code, as described herein, is a collection C of vectors of the same length N, called codewords. Any suitable subset of a vector signaling code denotes a “subcode” of that code. Such a subcode may itself be a vector signaling code. In operation, the coordinates of the codewords are bounded, and we choose to represent them by real numbers between −1 and 1. 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. A vector signaling code is called “balanced” if for all its codewords the sum of the coordinates is always zero. Additional examples of vector signaling methods are described in Cronie I, Cronie II, Cronie III, Cronie IV, Fox I, Fox II, Fox III, Holden I, Shokrollahi I, Shokrollahi II, and Hormati I.


As previously described, broadband signaling methods partition the available information transfer medium in the frequency domain, creating two or more frequency-domain “channels” which may then may transport information in a comparable manner to baseband circuits, using known methods of carrier modulation to convert the baseband information into a frequency-domain channel signal. As each such channel can be independently controlled as to amplitude, modulation, and information encoding, it is possible to adapt the collection of channels to widely varying information transfer medium characteristics, including variations in signal loss, distortion, and noise over time and frequency.


Asymmetric Digital Subscriber Line or ADSL is one widely deployed broadband signaling method used to transport digital data over legacy copper telephony circuits. In ADSL, each of potentially several hundred frequency-domain channels is independently configured for amplitude, modulation method, and digital carrying capacity, based on the particular noise and loss characteristics of the copper circuit being used for transport.


BRIEF DESCRIPTION

Communication of digital information using a combination of baseband and broadband techniques over multiple wires is described. A four wire communications channel having 35 dB of attenuation at 37.5 GHz is used in provided examples as a typical transport medium for use with the systems and methods described herein. One embodiment creates two frequency-based channels over the transport medium, with each channel using a combination of a vector signaling code and duobinary encoding to transport sets of three data bits over four wires at an effective rate of 56 Gigabits per second per wire.





BRIEF DESCRIPTION OF FIGURES


FIG. 1 illustrates the frequency-domain and time-domain characteristics of the transport channel model used herein.



FIG. 2 shows the simulated CTLE gain and transmit spectrum of a first embodiment using ENRZ signaling over a two pair (four wire) transport channel.



FIG. 3 shows the simulated receive eye opening for the first embodiment.



FIG. 4 shows the simulated CTLE gain and transmit spectrum of a second embodiment using ENRZ signaling combined with duobinary encoding over a two pair (four wire) transport channel.



FIG. 5 shows the simulated receive opening for the second embodiment.



FIG. 6 illustrates the spectrums of the broadband and carrier channels for the described third embodiment.



FIG. 7 show simulated pulse responses and cross-channel ICI for the third embodiment.



FIG. 8 shows the simulated receive eyes for the third embodiment.



FIG. 9 is a block diagram of a transmitter embodiment combining baseband and carrier band signaling.



FIG. 10 is a block diagram of an alternative transmitter embodiment combining baseband and carrier band signaling.



FIG. 11 is a block diagram of a receiver embodiment detecting baseband and carrier band signals.



FIG. 12 shows simulated eye openings for a fourth embodiment, utilizing a baseband plus a single carrier band operating at 224 Gigabits/second per wire pair.



FIG. 13 shows simulated eye openings for a sixth embodiment, utilizing a baseband plus a single carrier band operating at 112 Gigabits/second per wire pair.



FIG. 14 shows simulated eye openings for a seventh embodiment, utilizing a baseband plus a single carrier band operating at 224 Gigabits/second per wire pair.



FIG. 15 shows the distribution of data bits and redundancy-augmented bits across the six subchannels and multiple sequential transmit unit intervals, as described relevant to the ninth and tenth embodiments of the invention.



FIG. 16 is a block diagram illustrating the insertion error correction processing into the ++−− carrier subchannel as described for the ninth and tenth embodiments of invention.





DETAILED DESCRIPTION

Interconnection has long been a limiting factor in the design of large digital systems. Whether at the level of modules interconnected by a backplane, or of functional subsystems interconnected within a large printed circuit board, the need for reliable, error free, high-speed digital interconnection has constantly pushed the limits of available technology to its limits.


The systems and methods described herein provide robust, reliable transfer of data between at least one transmitting device and at least one receiving device, at data rates of at least 50 Gigabits per second per interconnection wire. An example channel model having the frequency- and time-domain characteristics illustrated in FIG. 1 will be used. It will be obvious to one familiar with the art that such a transport channel is incompatible with conventional communication signaling methods; for example, straightforward NRZ signaling at an example 112 Gibabits/second has a Nyquist frequency of 56 GHz, corresponding to an intractable 46 dB attenuation over the proposed physical transport channel.


This proposed data rate also strains integrated circuit data processing capabilities within the attached transmitting and receiving devices. It is therefore presumed that high-speed data handling in these devices will be distributed across multiple parallel processing “phases”. As one example, rather than a single data path handling data at 100 Gigabits per second (i.e. with merely 10 picosecond between bits), the same data stream may be distributed across sixteen processing phases, each one thus having a more reasonable 160 picoseconds of processing time per bit. However, this added processing time comes at the cost of significantly increased complexity from the additional processing elements. This distribution of processing also can lead to increased latency before a given digital bit result becomes available, limiting the ability to utilize that result in predicting a subsequent bit result, which is the basis of the DFE method.


The increasing data transfer rates also lead to physical issues as the wavelength of the propagating signals on the interconnection shrinks. As one example, the propagating signal wavelength at 56 Gigahertz on a printed circuit micro stripline is approximately 4 millimeters, thus periodic anomalies with merely fractional wavelength dimensions (even including the weave of the impregnated fabric comprising the circuit board) may represent a significant disturbance to signal integrity, stressing available equalization and compensation methods.


Encoding Information Using Hadamard Transforms


As taught in [Cronie I], the Hadamard Transform, also known as the Walsh-Hadamard transform, is a square matrix of entries +1 and −1 so arranged that both all rows and all columns are mutually orthogonal. Hadamard matrices are known for all sizes 2N as well as for selected other sizes. In particular, the description herein utilizes the 4×4 Hadamard matrix as the example encoder.


The order 4 Hadamard matrix used in our examples is:










H
4

=

[




+
1




+
1




+
1




+
1






+
1




-
1




+
1




-
1






+
1




+
1




-
1




-
1






+
1




-
1




-
1




+
1




]





(

Eqn
.

1

)









    • and encoding of the three informational bits A, B, C may be obtained by multiplying those informational bits times the rows 2, 3, and 4 of the Hadamard matrix H4 to obtain four output values, subsequently called “symbol values”. By convention, the results are scaled by an appropriate constant factor so as to bound the symbol values to the range +1 to −1. It may be noted that the first row of H4 corresponds to common mode signaling, which is not used herein, with the next three vectors being used to encode bits A, B, and C respectively into outputs W, X, Y, Z, these vectors also being called “modes” or “subchannels” of the Hadamard code. As the encoded outputs simultaneously carry information derived from the encoding of A, B, and C, the outputs will be a superposition or summation of modes, i.e. a sum of the sub-channel code vectors of the vector signaling code.





One familiar with the art will note that all possible values of A, B, C encoded in this manner result in mode summed values for W, X, Y, Z which are balanced; that is, summing to the constant value zero. If the mode summed values for W, X, Y, Z are scaled such that their maximum absolute value is 1 (that is, the signals are in the range +1 to −1 for convenience of description,) it will be noted that all achievable values are permutations of the vector (+1, −⅓, −⅓, −⅓) or of the vector (−1, ⅓, ⅓, ⅓). These are called the codewords of the vector signaling code H4. As used herein, this H4 code will subsequently be called Ensemble NRZ code or ENRZ and will be used as a representative example of vector signaling code in subsequent examples, without implying limitation.


ENRZ


[Hormati I] teaches that ENRZ has optimum Inter Symbol Interference (ISI) characteristics, and [Holden I] and [Ulrich I] teach it is capable of efficient detection. As previously described, ENRZ encodes three binary data bits into a four-symbol codeword for transmission, as one example, over four wires of a transport medium. If ENRZ signaling is used over four wires of the proposed channel, the data transfer rate may be achieved with merely a 75 Gigasymbol/second signaling rate, equivalent to 112 Gbps per wire pair, for the two pair transport channel.


Simulation of a first embodiment combining ENRZ signaling at a 75 Gigasymbol/second rate with the reference channel model indicates that a two tap FFE (transmit Feed-Forward Equalization) may be combined with receiver continuous-time linear equalization (CTLE) and a 12 tap Decision Feedback Equalizer (DFE), with performance as illustrated in the graphs of FIG. 2. The receive eye simulation of FIG. 3 shows a 93 mV vertical eye opening and a 14.5 psec edge-to-edge horizontal eye opening.


Duobinary Encoding


Duobinary encoding is a solution known in the art in which consecutive bits of a serially transmitted data stream are processed to shape and constrain the resulting transmit data spectrum. It is well known that Inter-Symbol Interference (ISI) such as may be produced by transmission medium perturbations will result in the received amplitude of a signal in one unit interval to be perturbed by residual energy from previous unit intervals. As one example, inverted pulse reflections from a perturbation of the transmission medium will cause a received signal to be reduced by the residual influence of previously transmitted signals. Thus, a transmitter informed of this effect might combine a presently transmitted signal value with that of a previous transmission, in an attempt to anticipate or pre-compensate for this inter-symbol interference effect. Thus, use of partial response codes such as duobinary are often described as a particular form of pre-equalization filtering intended to produce constructive ISI, rather than as a literal data encoding means.


As described in [Beyene], other partial-response codes are known to have comparable ISI management capabilities. For reference purposes, the characteristic equations defining these encodings or filterings are listed in Table I.











TABLE I






Partial Response System
Characteristic Equation








Duobinary
xn + xn−1



Dicode
xn − xn−1



Modified Duobinary
xn − xn−2



Class 2
xn + 2xn−1 +xn−2









Unless otherwise described, as used herein the duobinary processing performed is assumed to be a summation of the present and immediately previous transmit unit interval signal, each scaled by a factor of 0.5. Optionally, this may be combined with a transmit lowpass filter to further control the transmit spectrum. In other embodiments, ISI-controlling encoding is combined in any order with Hadamard encoding, where the ISI-controlling encoding is any of duobinary, modified duobinary, dicode, class2, or a Hamming filter as subsequently described. In such embodiments, the ISI-controlling encoding may also be described as being performed by a partial response encoder, embodying any of the partial response encodings or filterings above.


If the characteristics of the communications channel are extremely well understood, it may be possible to configure the ISI-controlling operation of the transmitter such that no explicit complementary operation is required at the receiver, the effective action of the channel characteristics themselves serving to perform the inverse operation. Other embodiments may explicitly detect, as one example, the ternary signals produced by duobinary encoding of binary data, followed by an explicit duobinary to binary decoding operation. Alternatively, commonly used receiver ISI elimination techniques such as DFE will also efficiently address the effects of such transmitter ISI compensation. As each example receiver in this document already incorporates DFE, no further receiver duobinary (or other partial response code) processing will be shown.


A second embodiment incorporating ENRZ encoding at a 75 Gigasymbol/second rate, subsequent duobinary processing of each wire signal, a 2 tap FFE, CTLE, and a 12 tap DFE was simulated using the reference channel model, producing the CTLE gain and spectrum results shown in FIG. 4. The receive eye simulation shown in FIG. 5 shows a 75 mV vertical receive eye opening and a 13.7 psec edge-to-edge horizontal eye opening.


These results, although representing considerable improvement over straightforward NRZ data transmission, indicate additional work is needed.


Channelization


If purely baseband communications solutions are insufficient, might a broadband approach be of benefit? Historically, such significant levels of physical transport channel limitation had been seen and addressed before, albeit at far lower data rates, during the efforts to provide high speed digital services over the legacy copper wire infrastructure of the telephony network. For DSL at its desired 3 Megabit data rate, a propagating signal wavelength was several hundred meters, which correlated strongly with the typical spacing of wire stubs, splices, and insulation abrasions seen in the field. Thus, an uncompensated frequency response for a typical copper telephony signal path would exhibit numerous notches and slopes caused by reflective interference among those anomalies, dissipative attenuation from degraded wires and insulation, and intrusive noise from sources such as AM radio transmitters.


Ultimately, multichannel frequency domain channelization was used to constrain the effect of those legacy transport issues. One commonly deployed Asymmetric Digital Subscriber Line (ADSL) solution, for example, partitioned the approximate 1 MHz of available transport medium bandwidth into 4.3125 kHz channels. Each channel was then independently tested for attenuation and signal-to-noise ratio, with different data throughput rates assigned to each channel depending on those test results. Thus, a channel frequency coinciding with a frequency response notch or significant external noise source would not be used, while other channels not presenting those issues could be used at full capacity. Unfortunately, the generation and detection of such a high channel count protocol relies on the availability of inexpensive digital signal processing solutions, and such technology has scaled in performance over time by perhaps a factor of ten, versus the approximate factor of 100,000 data rate increase in the present application.


Thus, although the present channel attenuation issues suggest a broadband approach may be useful, the conventional high-channel-count embodiment methods known to the art are incompatible with the anticipated data rate. A new approach specifically designed for high speed processing will be required.


Broadband Duobinary ENRZ


A third embodiment combines ENRZ, duobinary, and a two frequency-domain channel approach to address the issues of the previous proposals. The first frequency channel is at baseband, i.e. comparable to the single channel of the previous embodiment. The second frequency channel is composed of the same ENRZ+ duobinary signaling modulating a sinusoidal carrier, chosen to minimize the frequency overlap between spectral components of the baseband and of the carrier channel.


In the following example, a carrier frequency of 37.5 GHz will be used, with no limitation implied. Comparable results have been obtained in simulations using a 30 GHz carrier frequency, and lower frequencies may be used with improved channel attenuation characteristics but somewhat higher inter-channel interference, as will be shown in a subsequent example.


Both frequency channels run at a signaling rate of 37.5 Gsymbols/second, with three data bits being transported over the four wires of the baseband channel, and a second three data bits being transported over the same four wires using the carrier channel, to produce an aggregate throughput equal to the previous embodiments. With the same data throughput distributed across two channels, the required signaling rate per channel is halved, thus potentially allowing a much wider horizontal eye opening.



FIG. 6 illustrates the spectrums of the broadband and carrier channels and the corresponding pulse shapes of the two channel signals, as produced by a simulation of this embodiment operating over the reference channel model.


In this embodiment, data for each of the two channels is separately ENRZ encoded, and then each of the four signaling streams carrying the ENRZ codewords is duobinary encoded by summing the present and immediately previous Unit Interval's value, each scaled by a factor of 0.5. (Alternatively, the summation of the values may subsequently be scaled by the same factor, or the scaling may be subsumed into later amplification and/or filtering functions.) Each of the two resulting duobinary encoded streams, herein also referred to as sets of baseband-encoded symbols, are pre-emphasized using a two tap FFE, then passed through a Butterworth lowpass filter of order 2 with a cutoff frequency of 9.37 Gigahertz for spectral shaping and ICI reduction. The filtered stream for the carrier channel modulates a sinusoidal carrier at 37.5 GHz, the result of which is linearly combined with the filtered stream for the baseband channel for transmission over the transport channel.


As the subchannels of a Hadamard code such as ENRZ are linear, that is, they transparently communicate non-binary as well as binary signals, the order in which duobinary and ENRZ encoding is performed may be reversed. In at least one such alternative embodiment, each of the three data bits is separately duobinary encoded before being presented to the ENRZ encoder, rather than the ENRZ code outputs being duobinary encoded, for each of the baseband and carrier channels.


Transmitter



FIG. 9 is a block diagram of one embodiment of a Broadband Duobinary ENRZ transmitter. Data at an aggregate rate of 224 Gigabits/second enters MUX 910, which separates it into two independent data streams 915 and 918, each of 112 Gigabits/second that serve as data inputs to the baseband and carrier channels.


The baseband channel data is ENRZ encoded 920, with each three bits of input data producing one code word of four symbol values. Each baseband symbol value will subsequently be processed independently and ultimately transported (along with its comparable carrier channel processed symbol value) on its own wire. Processing for each baseband symbol value may include duobinary encoding by partial-response signaling encoder 940 and low-pass filtering and amplification by amplifier 960 as needed to meet system signal level criteria, to produce a processed baseband output. In some embodiments, the partial response signaling encoder may be implemented with two sets of analog voltage generators, where each set is alternately driven with a codeword input and provides a set of voltages representing the codeword symbols, but the generators maintain their outputs for a duration of two signaling intervals. The sets of voltages are summed at a signal summing circuit. While each set of voltages changes at ½ the symbol rate, because they are staggered in time, the outputs of the summing circuit change at the symbol rate, and represent the sum of the current symbol and the prior symbol. In some embodiments, the encoder such as ENRZ encoder 920 may comprise two encoders also operating at ½ rate, each encoder configured to drive a corresponding set of analog voltage generators.


Processing for the carrier channel is comparable to that of the baseband channel to the point of carrier modulation, with carrier channel data 918 being ENRZ encoded 930, with each three bits of input data producing one codeword of four symbol values. Each carrier symbol value will subsequently be processed independently, and then mixed with its comparable processed baseband symbol value for wire transmission. Processing for each carrier symbol value consists of duobinary encoding 950, low-pass filtering and amplification 970 as needed to meet system signal level criteria, and modulation 980 of the 37.5 GHz Carrier to produce a processed and modulated carrier output.


Each of the four processed baseband outputs is summed 990 with its comparable processed and modulated carrier outputs, producing wire outputs identified in FIG. 9 as Wire A, Wire B, Wire C, and Wire D.



FIG. 10 shows an alternative transmitter embodiment, in which duobinary encoding 1020 and 1030 is performed prior to ENRZ encoding 1040 and 1050. Other than the order of these operations, this alternative transmitter is identical to that of the embodiment of FIG. 9.


Receiver


One embodiment of a comparable Broadband Duobinary ENRZ receiver is shown in the block diagram of FIG. 11. Each wire signal from the transport medium Wire A, Wire B, Wire C, and Wire D is amplified and frequency equalized by a continuous-time linear equalizer (CTLE) 1110, and then the four amplified and equalized received signals are input to three linear ENRZ mixers 1120. In some embodiments, CTLEs 1110 may include analog delay circuits, and the receiver may include a skew control circuit 1112 configured to provide a skew control signal to each of the CTLEs 1110. In some embodiments, the analog delay circuits may be all-pass filters (including a switched capacitor bank, for example) configured to adjust an analog delay of each individual wire A-D. In some embodiments, the skew control circuit 1112 may be configured to operate on the outputs of samplers 1180 that operate on the passband MIC outputs in order to determine a skew control signal for adjusting analog delay values of each wire, however this should not be considered limiting. In one embodiment, each sub-channel MIC may be evaluated by adjusting decision thresholds, and responsively measuring an effective eye opening, and then individual wire skews may be adjusted in order to increase the effective eye opening. In some embodiments, the sub-channel MIC with the narrowest effective eye opening is adjusted first. Further, alternative analog delay circuits known to those of skill in the art may be implemented.


As taught by [Holden I], such ENRZ receive mixing is commonly utilized at baseband by so-called multi-input comparators (MIC) to detect ENRZ codewords. Here, the ENRZ mixing in such MICs produces three linear signal “subchannels” comprising a linear superposition of baseband and broadband, or carrier-modulated, results for each of the two ENRZ encoded streams. The mixing operations are defined as:

R0=(A+C)−(B+D)  (Eqn. 2)
R1=(C+D)−(A+B)  (Eqn. 3)
R2=(A+D)−(B+C)  (Eqn. 4)

    • where R0, R1, R2 are the three resulting linear signal channels output from ENRZ mixers 1120, and A, B, C, D are the four received wire signals output from the CTLE 1110. Equivalent mixing results may be obtained using other algebraic permutations of these equations as may be produced by a different ordering of wire labels; as one example R1=(A+B)−(C+D) is equivalent to Eqn. 3 if the wires are labeled in reverse order. MICs embodying such mixing results may also be identified by the signs of wire terms in their defining equation, e.g. ++−− for this example.


A four pole Butterworth lowpass filter 1130 with a cutoff frequency of 18.75 GHz is used to extract the baseband component from each of the linear signal subchannels. As is common practice in the art, the signal amplitude of each of the linear signal subchannels is measured or captured at a particular moment or interval of time by samplers 1140 at 37.5 Giga sample/second rate to produce the three decoded Baseband Data out bits, at an aggregate 112 Gigabit/second data rate. Concurrently, each decoded bit is presented to a DFE computation 1150, producing a DFE correction signal used to adjust that bit's sampler threshold. Digital Feedback Equalization is well known in the art, thus will not be further described here, other than noting that each DFE computation 1150 is independent, and will provide both correction of transport-channel-induced ISI and of intentionally generated transmitter ISI compensation.


It should be noted that the described DFE correction operating on subchannels of the vector signaling code is distinct from the common art, where which DFE correction is performed on e.g. received wire signals. As the history maintained by the DFE must accurately represent the values of each unit interval in the history, a conventional DFE would have to maintain ternary, quaternary, or higher-order history values to represent a vector signaling code having 3, 4, or more possible symbol values. In contrast, binary data communicated over a vector signaling code subchannel requires maintenance of merely a binary history using the described DFE correction.


Simultaneously, a second order Butterworth high pass filter 1150 with a cutoff of 37.5 GHz extracts the carrier channel information from the three linear signal subchannels. Balanced mixers 1160 provided with a 37.5 GHz carrier signal converts these modulated signals back to baseband where, as with the baseband channel signals, a four pole Butterworth lowpass filter 1070 with a cutoff frequency of 18.75 GHz is used followed by sampling 1080 at 37.5 Gig sample/second rate on each of the subchannels to produce the three decoded Carrier Data out bits, at an aggregate 112 Gigabit/second data rate. As with the baseband data, each decoded carrier data out bit is presented to a DFE computation 1190, producing a DFE correction signal used to adjust that bit's sampler threshold. Each DFE computation 1190 is independent, and will provide both correction of transport-channel-induced ISI and of intentionally generated transmitter ISI compensation.


Because of the significant frequency-dependent loss characteristics of the transport channel, the gain of the receive baseband channel is set to 14 dB, while the gain of the carrier channel is set to 26 dB. Similarly, the transmitter gain for the carrier channel is set to 3 times that of the baseband channel to provide pre-emphasis.


Simulated pulse responses and cross-channel ICI for this embodiment are shown in FIG. 7, assuming two taps of transmit FFE and fifteen taps of receive DFE. Receive eyes for the baseband and carrier (passband) channels are shown in FIG. 8. Eye openings are 54 mV vertical and 24.1 psec horizontal for the baseband, and 56 mV vertical and 38.7 psec horizontal for the passband, a considerable improvement over the previous embodiments.


Skew Considerations


As with any vector signaling code solution, skew must be constrained across the transport paths carrying symbols of the same codeword, as the codeword must be presented as a coherent whole to the receiver's detector to be properly recognized. Roughly speaking, propagation latencies across the various transport paths must be matched to less than one half the expected eye width to permit detection, and better than that value to avoid eye width degradation. Known approaches including introduction of variable delay lines and/or FIFO buffers for path compensation, separate CDR and sample timing for individual wires, and transmit-side pre-skew compensation. However, these techniques must be applied cautiously, as they may also lead to increased inter-symbol interference, transmit simultaneous switching noise, and higher perceived receive common mode signals.


Because the baseband and carrier-band channels carry separate ENRZ encoded data and are separately receive sampled, their data streams may be considered to be independent and thus do not require absolute temporal alignment. This is an advantage, as differences between the filtering characteristics of the two channels will introduce different time delays, which inherently introduces a timing difference between the set of data bits received at baseband, and the set of data bits received at carrier band. As will be apparent to one familiar with the art, these sets of bits may be passed through retiming latches, FIFO buffers, or other known means to align them with a common timing reference.


ALTERNATIVE EMBODIMENTS

A number of variations to the preceding embodiments have been considered, all within the scope of the described invention. Transmit signal generation of the ENRZ symbol values, their ISI-controlling encodings, or both may be produced using Digital to Analog converters having an appropriate number of bits. Similarly, mixing of broadband and carrier signals within the transmitter may be done digitally.


Transmitter and receiver embodiments may incorporate additional gain and/or frequency-dependent filtering stages to meet the described vertical eye openings, or to compensate for channel characteristics differing from those of the reference channel model. Particular amplitudes, gains, attenuation characteristics, etc. are provided for descriptive purposes, without implying limitation.


At least one embodiment performs additional prefiltering of signals within the transmitter to zero out the first few pre-cursors of the channel, thus avoiding the need for extensive DFE tap unrolling at the receiver.


The example broadband receiver embodiment described converts the carrier-based channel to baseband for subsequent detection. This presumes that the local carrier available at the receiver is coherent with the transmitter's carrier signal, and is thus derived using a Phase-locked loop or other known method. Other known art receiver methods are well known and may also be incorporated in alterative and equivalent embodiments.


A receiver embodiment may also utilize Analog-to-Digital sampling followed by some or all of the previously-described filtering, mixing, and sampling being performed using digital signal processing methods.


Extension to Higher Data Rates


The embodiments described herein may be extended to support data rates of 224 Gigabits per second per wire pair.


In a fourth embodiment incorporating such extension, the data is prefiltered at the transmitter to add more controlled ISI. As one example, a Hamming filter of order 7 is used having the coefficients:

H=[0.02, 0.09, 0.23, 0.30, 0.23, 0.09, 0.02]  [Eqn. 5]


This is contrasted with the duobinary encoding of the previous examples, which corresponds to a transmit filter with the coefficients:

H=[0.5, 0.5]  [Eqn. 6]


In this fourth embodiment the data rate in each of the baseband and carrier channels is doubled, to 75 Gigasymbols/second, resulting in an aggregate data throughput equivalent to 112 Gigabits per second per wire, or 448 Gigabits per second for the four wire interconnection. Simulated eye openings are shown in FIG. 12, where the baseband channel has 93 mV of vertical and 8.3 psec of horizontal eye opening, and the carrier channel has 42 mV of vertical and 16.6 psec of horizontal eye opening, assuming 3 pre-cursor taps of transmit equalization, and 15 taps of receive DFE.


Alternatively, an embodiment may utilize additional carrier channels. As one example, a baseband channel plus three carrier channels operating at carrier frequencies chosen to minimize the frequency overlap between spectral components of the various channels may be combined, with each channel carrying a data stream combining ENRZ encoding with an ISI-controlling encoding with each channel operating at a rate of 37.5 Gigasymbols/second as previously described.


Extension to Other Base Signaling Schemes


As previously noted, the embodiments described herein may be used with underlying vector signaling codes other than ENRZ, which has been used for purposes of description in the previous examples without implying a limitation. Other multi-wire signaling schemes may also be combined with the described ISI management and channelization techniques, as should be understood by anyone of ordinary skill in the art.


For example, a fifth embodiment is identical to that of the previously described fourth embodiment, except that differential signaling is used on each two wire pair at a signaling rate of 75 Gigabits/second/pair, rather than ENRZ across all four wires. Data on each channel is prefiltered at the transmitter to add more controlled IS using a Hamming filter of order 7 having the coefficients:

H=[0.02, 0.09, 0.23, 0.30, 0.23, 0.09, 0.02]  [Eqn. 7]


In this fifth embodiment the aggregate throughput is thus 300 Gigabits/second; 75 Gigabits/second per wire pair for two wire pairs, for each of the two channels.


Use of a Lower Carrier Frequency


As previously mentioned, a lower carrier frequency may be used to bring the carrier-modulated channel into a lower attenuation region of the transport channel model, at the cost of increased inter-channel interference.


A sixth embodiment operates with a baseband channel and one carrier channel modulating a carrier frequency of 19.5 GHz. Both baseband and carrier channels utilize ENRZ encoding and Duobinary filtering, as previously described, at a signaling rate of 37.5 GBaud, equivalent to a 26.66 psec UI. The resulting signal spectrum experiences a 15 dB channel loss at baseband, and a 30 dB loss at the carrier channel. The simulation results shown in FIG. 13 and summarized in Table 2 are based on 600 mV Tx amplitude, 200 uV RMS channel noise, a 1:7 baseband to carrier channel power ratio, 1 pre- and 1 post-cursor TX FIR, up to 12 dB of Rx CTLE, and 12 taps of Rx DFE. Eye openings sufficient to obtain at least a 10E-6 Bit Error Rate (BER) were observed.













TABLE 2







Vertical
Horizontal
%


Band
MIC
mV
psec
UI



















Carrier
++−−
3.97
16.66
62.5


Channel
+−+−
5.87
20.21
75.8



+−−+
5.87
20.21
75.8


Baseband
++−−
6.64
17.29
64.9



+−+−
6.43
17.08
64.1



+−−+
6.45
17.08
64.1









For descriptive convenience, the three ENRZ subchannels on each of the Carrier and Baseband frequencies are identified by the logical wire combinations comprising the defining equation of their corresponding multi-input mixer. Thus, as one example, the mixed combination of wires A, B, C, D corresponding to the mixer performing the (A+B)−(C+D) operation is identified as ++−− in Table 2.


As may be seen in FIG. 13 and Table 2, the eye opening for the ++−− carrier subchannel is significantly smaller than the other eyes, and is thus the limiting factor on performance. In particular, the reduced horizontal eye opening indicates that subchannel may be significantly impacted by wire skew in the transport channel.


Incorporation of Error Correcting Codes


A seventh embodiment operates with a baseband channel and one carrier channel modulating a carrier frequency of 18.5 GHz. Both baseband and carrier channels utilize ENRZ encoding and order 11 Hamming filtering, at a signaling rate of 75 GBaud, equivalent to a 13.33 psec UI. The resulting signal spectrum experiences a 14 dB channel loss at baseband, and a 22 dB loss at the carrier channel. The simulation results shown in FIG. 14 and summarized in Table 3 are based on 800 mV Tx amplitude, 200 uV RMS channel noise, 260 femto-seconds of random jitter (Rj), a 1:7 baseband to carrier channel power ratio, 1 pre- and 1 post-cursor TX FIR, up to 12 dB of Rx CTLE, and 25 taps of Rx DFE.













TABLE 3







Vertical
Horizontal
%


Band
MIC
mV
psec
UI



















Carrier
++−−
1.76
8.65
64.9


Channel
+−+−
3.02
10.52
78.9



+−−+
2.93
10.31
77.3


Baseband
++−−
2.86
9.48
71.1



+−+−
2.74
9.38
70.4



+−−+
2.72
9.38
70.4









As with the previous example, eye openings sufficient to obtain a 1E-6 BER were observed, with the ++−− carrier subchannel again limiting the overall performance, especially in the presence of transport channel wire skew.


Various approaches were considered to mitigate this subchannel limiting performance, allowing improved system BER to be achieved.


An eighth embodiment is identical to the previously described seventh embodiment, but the marginal ++−− carrier subchannel is not used to transmit data. This results in an overall throughput of 5*75=375 Gbps over the four wire transport medium, equivalent to an effective 187.25 Gbps per wire pair.


A ninth embodiment is identical to the previously described seventh embodiment, with an additional reliability protocol imposed on data transmitted over the marginal ++−− carrier subchannel. As one example offered without limitation, a “send three times” reliability protocol may be used on that subchannel to transmit the same data bit in three consecutive UIs, with a majority detector used at the receiver to identify the received data bit. Thus, this embodiment transmits a total of 16 bits (rather than the seventh embodiment's 18) in three UIs. This results in an overall throughput of 6*75*( 16/18)=400 Gbps over the four wire transport medium, equivalent to an effective 200 Gbps per wire pair. Addition of this reliability protocol provides an effective BER of 1E-6 if the underlying subchannel provides at least a 5.7E-4 BER, equivalent to an improvement of the vertical eye by 6 dB and almost a doubling of the horizontal eye opening.


A tenth embodiment is identical to the previously described seventh embodiment, with a Forward Error Correcting protocol imposed on data transmitted over the marginal ++−− carrier subchannel. As one example offered without limitation, four consecutive data bits may be encoded using a [7,4,3] Hamming code to produce seven Hamming encoded bits to be sequentially transmitted over that subchannel in seven UIs, with the corresponding Hamming decoder used at the receiver to recover the received data bits. Thus, this embodiment transmits a total of 39 (rather than the seventh embodiment's 42) data bits in seven consecutive UIs, resulting in an overall throughput of 6*75*(39/42)=417.86 Gbps. equivalent to an effective 208.93 Gbps per wire pair. Addition of this FEC encoding provides an effective BER of 1E-6 if the underlying subchannel provides at least a 3.6E-3 BER, equivalent to an improvement of the vertical eye opening by 7 dB and an 2.5× enlargement of the horizontal eye opening.


This distribution of data bits and redundancy-augmented bits across the six subchannels and multiple sequential transmit unit intervals as described relevant to the ninth and tenth embodiments of the invention is illustrated in FIG. 15.



FIG. 16 is a block diagram showing error correction being added to an encoded transmission subchannel and the corrected data identified at the receiver. At the transmitter, Data In is distributed 910 among the carrier subchannels and the baseband subchannels, as previously shown relative to FIG. 9 and FIG. 10. The portion of the data bits directed to the ++−− carrier subchannel are passed through an error correction function 1510 which increases its redundancy; relative to the ninth embodiment this redundancy is obtained via repetition, relative to the tenth embodiment this redundancy is obtained via a Hamming Code encoder. The data bits directed to the carrier subchannels 915 and the data bits directed to the baseband subchannels 918 are then processed as previously described in FIG. 9 or FIG. 10. At the receiver, data from the sampler associated with the ++−− mixer carrier channel is directed to error correction function 1520, which identifies the original data bits; a majority detector is used relative to the ninth embodiment, and a Hamming Code decoder is used relative to the tenth embodiment. The original data bits from 1520 and the sampler outputs from the other subchannels may be combined 1530 to produce an aggregated received data stream identical to that presented to the transmitter.


It will be obvious to one skilled in the art that redundancy and/or forward error correction may be applied to more than one subchannel, with a corresponding improvement in that subchannel's effective eye opening but also resulting in decreased delivered data rate due to the inevitable overhead. Thus, these examples applying such solution to a single subchannel should not be considered as limiting, but may be preferred within the parameters of the example.

Claims
  • 1. A method comprising: generating a set of symbols of a baseband codeword from a first set of information bits, the set of symbols generated from a summation of a plurality of sub-channel vectors, each sub-channel vector weighted by a corresponding bit from the first set of information bits;generating, for three carrier channels, respective sets of carrier-modulated symbols of three carrier-modulated codewords, each set of carrier-modulated symbols comprising a respective weighted summation of the plurality of sub-channel vectors according to a respective set of information bits, each respective weighted summation modulated by a unique sinusoidal carrier signal;generating a set of wire-specific outputs, each wire-specific output representing a sum of a respective carrier-modulated symbol of each set of carrier-modulated symbols and one symbol of the set of baseband-encoded symbols; andtransmitting each wire-specific output on a respective wire of a multi-wire bus.
  • 2. The method of claim 1, wherein the respective set of information bits for at least one of the carrier-modulated codewords comprises a pre-coded stream of information bits.
  • 3. The method of claim 2, wherein the pre-coded stream of information bits is pre-coded by an error-correcting code.
  • 4. The method of claim 2, wherein the pre-coded stream of information bits is pre-coded by a partial response code.
  • 5. The method of claim 4, wherein the partial response code is a code selected from the group consisting of: duobinary, dicode, modified duobinary, and class 2.
  • 6. The method of claim 2, wherein the plurality of mutually orthogonal sub-channel vectors comprises a “++−−, “+−+−”, and “+−−+” sub-channel vectors, and wherein the pre-coded stream of information bits is applied to the ‘++−−’ sub-channel vector.
  • 7. The method of claim 1, wherein the set of symbols of the baseband codeword are generated at a rate equal to a frequency of one of the unique sinusoidal carrier signals.
  • 8. The method of claim 1, wherein the plurality of mutually orthogonal sub-channel vectors are selected from a Hadamard matrix of size four.
  • 9. The method of claim 1, wherein transmitting each wire-specific output on a respective wire of a multi-wire bus comprises adjusting transmit times of each wire-specific output based on transmit-side pre-skew compensation.
  • 10. The method of claim 1, wherein the set of baseband symbols and each set of carrier-modulated symbols are temporally misaligned.
  • 11. A method comprising: a baseband encoder configured to generate a set of symbols of a baseband codeword from a first set of information bits, the set of symbols generated from a summation of a plurality of sub-channel vectors, each sub-channel vector weighted by a corresponding bit from the first set of information bits;a carrier-modulated encoder configured to generate, for three carrier channels, respective sets of carrier-modulated symbols of three carrier-modulated codewords, each set of carrier-modulated symbols comprising a respective weighted summation of the plurality of sub-channel vectors according to a respective set of information bits, each respective weighted summation modulated by a unique sinusoidal carrier signal;a plurality of line drivers configured to generate the set of symbols of the baseband codeword and each set of carrier-modulated symbols on respective wires of a multi-wire bus, each wire comprising an analog sum of a respective carrier-modulated symbol of each set of carrier-modulated symbols and one symbol of the set of baseband-encoded symbols.
  • 12. The apparatus of claim 11, wherein the respective set of information bits for at least one of the carrier-modulated codewords comprises a pre-coded stream of information bits generated by a pre-coder.
  • 13. The apparatus of claim 12, wherein the pre-coder generates the pre-coded stream of information bits using an error-correcting code.
  • 14. The apparatus of claim 12, wherein the pre-coder generates the pre-coded stream of information bits using a partial response code.
  • 15. The apparatus of claim 14, wherein the partial response code is a code selected from the group consisting of: duobinary, dicode, modified duobinary, and class 2.
  • 16. The apparatus of claim 12, wherein the plurality of mutually orthogonal sub-channel vectors comprises a “++−−, “+−+−”, and “+−−+” sub-channel vectors, and wherein the pre-coded stream of information bits is applied to the ‘++−−’ sub-channel vector.
  • 17. The apparatus of claim 11, wherein the baseband encoder is configured to generate the set of symbols of the baseband codeword at a rate equal to a frequency of one of the unique sinusoidal carrier signals.
  • 18. The apparatus of claim 11, wherein the plurality of mutually orthogonal sub-channel vectors are selected from a Hadamard matrix of size four.
  • 19. The apparatus of claim 11, wherein the plurality of line drivers are configured adjust transmit times of each wire based on transmit-side pre-skew compensation.
  • 20. The apparatus of claim 11, wherein the set of baseband symbols and each set of carrier-modulated symbols are temporally misaligned.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 17/468,405, filed Sep. 7, 2021, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 17/081,562, filed Oct. 27, 2020, now U.S. Pat. No. 11,115,249, granted Sep. 7, 2021, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 16/836,551, filed Mar. 31, 2020, now U.S. Pat. No. 10,819,541, granted Oct. 27, 2020, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 16/537,507, filed Aug. 9, 2019, now U.S. Pat. No. 10,608,850, granted Mar. 30, 2020, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 16/175,800, filed Oct. 30, 2018, now U.S. Pat. No. 10,382,235, granted Aug. 13, 2019, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 15/823,194, filed Nov. 27, 2017, now U.S. Pat. No. 10,116,472, granted Oct. 30, 2018, entitled “High Speed Communications System”, which is a continuation of U.S. application Ser. No. 15/194,497, filed Jun. 27, 2016, now U.S. Pat. No. 9,832,046, granted Nov. 28, 2017, entitled “High Speed Communications System”, which is a Non-Provisional Application claiming priority under 35 USC § 119 to U.S. Provisional Application No. 62/189,953, filed Jul. 8, 2015, entitled “High Speed Communications System”, and also claiming priority under 35 USC § 119 to U.S. Provisional Application 62/185,403, filed Jun. 26, 2015, entitled “High Speed Communications System,” all of which are hereby incorporated herein by reference in their entirety for all purposes.

US Referenced Citations (252)
Number Name Date Kind
3196351 Slepian Jul 1965 A
3970795 Allen Jul 1976 A
4163258 Ebihara et al. Jul 1979 A
4181967 Nash et al. Jan 1980 A
4206316 Burnsweig et al. Jun 1980 A
4414512 Nelson Nov 1983 A
4499550 Ray, III et al. Feb 1985 A
5053974 Penz Oct 1991 A
5150384 Cahill Sep 1992 A
5166956 Baltus et al. Nov 1992 A
5168509 Nakamura et al. Dec 1992 A
5311516 Kuznicki et al. May 1994 A
5331320 Cideciyan et al. Jul 1994 A
5388126 Rypinski et al. Feb 1995 A
5412689 Chan et al. May 1995 A
5449895 Hecht et al. Sep 1995 A
5553097 Dagher Sep 1996 A
5659353 Kostreski et al. Aug 1997 A
5727006 Dreyer et al. Mar 1998 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
6188497 Franck et al. Feb 2001 B1
6226330 Mansur May 2001 B1
6278740 Nordyke Aug 2001 B1
6317465 Akamatsu et al. Nov 2001 B1
6359931 Perino et al. Mar 2002 B1
6417737 Moloudi et al. Jul 2002 B1
6452420 Wong Sep 2002 B1
6483828 Balachandran et al. Nov 2002 B1
6504875 Perino et al. Jan 2003 B2
6522699 Anderson Feb 2003 B1
6556628 Poulton et al. Apr 2003 B1
6621427 Greenstreet Sep 2003 B2
6621945 Bissessur Sep 2003 B2
6650638 Walker et al. Nov 2003 B1
6658234 Dogan et al. Dec 2003 B1
6661355 Cornelius et al. Dec 2003 B2
6686879 Shattil Feb 2004 B2
6766342 Kechriotis Jul 2004 B2
6839429 Gaikwad et al. Jan 2005 B1
6842489 Masenten Jan 2005 B2
6865236 Terry Mar 2005 B1
6876317 Sankaran Apr 2005 B2
6898724 Chang May 2005 B2
6954492 Williams Oct 2005 B1
6963622 Eroz et al. Nov 2005 B2
6990138 Bejjani et al. Jan 2006 B2
6993311 Li et al. Jan 2006 B2
6999516 Rajan Feb 2006 B1
7023817 Kuffner et al. Apr 2006 B2
7039136 Olson et al. May 2006 B2
7072387 Betts Jul 2006 B1
7075996 Simon et al. Jul 2006 B2
7120198 Dafesh et al. Oct 2006 B1
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
7349484 Stojanovic et al. Mar 2008 B2
7356213 Cunningham et al. Apr 2008 B1
7358869 Chiarulli et al. Apr 2008 B1
7428273 Foster Sep 2008 B2
7496130 Rumney Feb 2009 B2
7496162 Srebranig Feb 2009 B2
7599390 Pamarti Oct 2009 B2
7613234 Raghavan et al. Nov 2009 B2
7633850 Ahn Dec 2009 B2
7639596 Cioffi Dec 2009 B2
7643588 Visalli et al. Jan 2010 B2
7656321 Wang Feb 2010 B2
7706456 Laroia et al. Apr 2010 B2
7746764 Rawlins et al. Jun 2010 B2
7787572 Scharf et al. Aug 2010 B2
7808883 Green Oct 2010 B2
7868790 Bae Jan 2011 B2
7869546 Tsai Jan 2011 B2
7899653 Hollis Mar 2011 B2
7907676 Stojanovic et al. 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 Rjeily Jul 2012 B2
8238318 Negus Aug 2012 B1
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
8406316 Sugita et al. Mar 2013 B2
8457261 Shi et al. Jun 2013 B1
8472513 Malipatil et al. Jun 2013 B2
8498368 Husted et al. Jul 2013 B1
8520493 Goulahsen Aug 2013 B2
8539318 Cronie 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
8792594 Vojcic 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
9020049 Schwager 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
9148198 Zhang Sep 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
20020034191 Shattil Mar 2002 A1
20020044316 Myers Apr 2002 A1
20020097791 Hansen Jul 2002 A1
20020152340 Dreps et al. Oct 2002 A1
20020174373 Chang Nov 2002 A1
20020181607 Izumi Dec 2002 A1
20030016770 Trans Jan 2003 A1
20030071684 Noori Apr 2003 A1
20030086366 Branlund et al. May 2003 A1
20030087634 Raghavan et al. May 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 Aug 2004 A1
20040203834 Mahany Oct 2004 A1
20040239374 Hori Dec 2004 A1
20050063493 Foster Mar 2005 A1
20050213686 Love et al. Sep 2005 A1
20060013331 Choi et al. Jan 2006 A1
20060056538 Nam et al. Mar 2006 A1
20060120486 Visalli et al. Jun 2006 A1
20060126751 Bessios Jun 2006 A1
20060133538 Stojanovic et al. Jun 2006 A1
20060159005 Rawlins et al. Jul 2006 A1
20060245757 Elahmadi Nov 2006 A1
20060251421 Arnon Nov 2006 A1
20060274862 Lui et al. Dec 2006 A1
20060291589 Eliezer et al. Dec 2006 A1
20070030796 Green Feb 2007 A1
20070070967 Yang et al. Mar 2007 A1
20070147559 Lapointe Jun 2007 A1
20080043677 Kim et al. Feb 2008 A1
20080104374 Mohamed May 2008 A1
20080192621 Suehiro Aug 2008 A1
20080316070 Van Acht et al. Dec 2008 A1
20090046009 Fujii Feb 2009 A1
20090059782 Cole Mar 2009 A1
20090092196 Okunev Apr 2009 A1
20090110106 Wornell et al. Apr 2009 A1
20090154604 Lee et al. Jun 2009 A1
20090163162 Hoffman et al. Jun 2009 A1
20090316730 Feng Dec 2009 A1
20100046644 Mazet Feb 2010 A1
20100054355 Kinjo et al. Mar 2010 A1
20100081451 Mueck et al. Apr 2010 A1
20100215087 Tsai Aug 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
20110228864 Aryanfar et al. Sep 2011 A1
20110235501 Goulahsen Sep 2011 A1
20110255714 Neusinger et al. Oct 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
20120161945 Single et al. Jun 2012 A1
20120213299 Cronie et al. Aug 2012 A1
20120257683 Schwager et al. Oct 2012 A1
20130010892 Cronie Jan 2013 A1
20130013870 Cronie et al. Jan 2013 A1
20130114392 Sun et al. May 2013 A1
20130129019 Sorrells et al. May 2013 A1
20130202001 Zhang Aug 2013 A1
20130259113 Kumar Oct 2013 A1
20140006649 Wiley et al. Jan 2014 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
20150280841 Gudovskiy et al. Oct 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 Jul 2016 A1
20160338040 Lee et al. Nov 2016 A1
20160380787 Hormati et al. Dec 2016 A1
20170195961 Chakraborty et al. Jul 2017 A1
20170272285 Shokrollahi et al. Sep 2017 A1
20170353205 Chakraborty et al. Dec 2017 A1
20190103903 Yang Apr 2019 A1
20190238379 Walk et al. Aug 2019 A1
20190245560 Yang et al. Aug 2019 A1
20200321778 Gharibdoust et al. Oct 2020 A1
20210258029 Cyzs Aug 2021 A1
20210297292 Hormati Sep 2021 A1
Foreign Referenced Citations (8)
Number Date Country
1864346 Nov 2006 CN
101854223 Oct 2010 CN
2003163612 Jun 2003 JP
4394755 Jan 2010 JP
2005032000 Apr 2005 WO
2009084121 Jul 2009 WO
2010031824 Mar 2010 WO
2019241081 Dec 2019 WO
Non-Patent Literature Citations (19)
Entry
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 for 400GE 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).
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).
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).
Related Publications (1)
Number Date Country
20230068176 A1 Mar 2023 US
Provisional Applications (2)
Number Date Country
62189953 Jul 2015 US
62185403 Jun 2015 US
Continuations (7)
Number Date Country
Parent 17468405 Sep 2021 US
Child 18049594 US
Parent 17081562 Oct 2020 US
Child 17468405 US
Parent 16836551 Mar 2020 US
Child 17081562 US
Parent 16537507 Aug 2019 US
Child 16836551 US
Parent 16175800 Oct 2018 US
Child 16537507 US
Parent 15823194 Nov 2017 US
Child 16175800 US
Parent 15194497 Jun 2016 US
Child 15823194 US