Interleaved forward error correction over multiple transport channels

Information

  • Patent Grant
  • 11894926
  • Patent Number
    11,894,926
  • Date Filed
    Tuesday, June 21, 2022
    a year ago
  • Date Issued
    Tuesday, February 6, 2024
    2 months ago
Abstract
Interleaved Forward Error Correction (FEC) encoded data from multiple FEC encoders for transport over a multi-channel physical transport medium, with cyclical rotation of the FEC encoded data bytes across transport channels in a given transmission interval as well as across time within each transport channel. A plurality of parallel FEC encoders are used to generate respective parallel FEC-encoded data streams, the outputs of which are then interleaved across a plurality of transport channels in a given transmission time interval, and, within each transport channel, the interleaved order varies over the time intervals.
Description
REFERENCES

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


U.S. Pat. No. 9,288,089 of U.S. application Ser. No. 12/784,414, filed May 20, 2010, naming Harm Cronie and Amin Shokrollahi, entitled “Orthogonal Differential Vector Signaling” (hereinafter “Cronie I”).


U.S. Pat. No. 9,667,379 of U.S. application Ser. No. 13/154,009, filed Jun. 5, 2011, naming Harm Cronie and Amin Shokrollahi, entitled “Error Control Coding for Orthogonal Differential Vector Signaling” (hereinafter “Cronie II”).


U.S. Pat. No. 9,596,109 of U.S. application Ser. No. 14/253,584, filed Apr. 15, 2014, naming John Fox, Brian Holden, Ali Hormati, Peter Hunt, John D Keay, Amin Shokrollahi, Anant Singh, Andrew Kevin John Stewart, Giuseppe Surace, and Roger Ulrich, entitled “Methods and Systems for High Bandwidth Communications Interface” (hereinafter called “Fox I”)


U.S. Pat. No. 8,296,632 of U.S. application Ser. No. 12/479,605, filed Jun. 5, 2009, naming Amin Shokrollahi, entitled “Encoding and decoding of generalized Reed-Solomon codes using parallel processing techniques” (hereinafter “Shokrollahi I”).


U.S. Pat. No. 9,100,232 of U.S. application Ser. No. 14/612,241, filed Aug. 4, 2015, naming Amin Shokrollahi, Ali Hormati, and Roger Ulrich, entitled “Method and Apparatus for Low Power Chip-to-Chip Communications with Constrained ISI Ratio”, hereinafter identified as [Shokrollahi II].


U.S. Provisional Patent Application No. 62/485,677, filed Apr. 14, 2017, naming Amin Shokrollahi and Dario Carnelli, entitled “Pipelined Forward Error Correction for Vector Signaling Code Channel”, hereinafter identified as [Shokrollahi III].


FIELD OF THE INVENTION

The present embodiments relate to communications systems circuits generally, and more particularly to reduction of communication errors over a high-speed multi-wire interface used for chip-to-chip communication.


BACKGROUND

In modern digital systems, digital information has to be processed in a reliable and efficient way. In this context, digital information is to be understood as information available in discrete, i.e., discontinuous values. Bits, collection of bits, but also numbers from a finite set can be used to represent digital information.


In most chip-to-chip, or device-to-device communication systems, communication takes place over a plurality of wires to increase the aggregate bandwidth. A single or pair of these wires may be referred to as a channel or link and multiple channels create a communication bus between the electronic components. At the physical circuitry level, in chip-to-chip communication systems, buses are typically made of electrical conductors in the package between chips and motherboards, on printed circuit boards (“PCBs”) boards or in cables and connectors between PCBs. In high frequency applications, microstrip or stripline PCB traces may be used.


Common methods for transmitting signals over bus wires include single-ended and differential signaling methods. In applications requiring high speed communications, those methods can be further optimized in terms of power consumption and pin-efficiency, especially in high-speed communications. More recently, vector signaling methods have been proposed to further optimize the trade-offs between power consumption, pin efficiency and noise robustness of chip-to-chip communication systems. In those vector signaling systems, digital information at the transmitter is transformed into a different representation space in the form of a vector codeword that is chosen in order to optimize the power consumption, pin-efficiency and speed trade-offs based on the transmission channel properties and communication system design constraints. Herein, this process is referred to as “encoding”. The encoded codeword is communicated as a group of signals from the transmitter to one or more receivers. At a receiver, the received signals corresponding to the codeword are transformed back into the original digital information representation space. Herein, this process is referred to as “decoding”.


BRIEF DESCRIPTION

In conventional bit-serial communications systems, data words provided by a transmitting or source process are serialized into a sequential stream of bits, in one exemplary embodiment using a digital shift register. At the receiver, sequentially detected bits are deserialized using comparable means, so that a receiving or destination process may be presented with complete data words equivalent to those provided at the transmitter. Vector signaling code communication systems perform comparable operations, although in these embodiments the serialization process generally breaks words into symbol groups (e.g. into five bit elements for a CNRZ-5 system,) and the equivalent deserialization process assembles received groups (of five bits, continuing the same example,) into words again.


Forward Error Correction (FEC) methods have been developed which introduce redundancy into such transmitted data streams as part of a check code that both detects and facilitates correction of errors. The order in which data and redundancy information are structured into a transmitted data stream can significantly impact overall communication latency, especially if multiple essentially parallel communications channels are involved. Solutions are described utilizing interleaving to optimize both burst error control and latency.


Embodiments are described for permuting the transmission order of FEC encoded packets from multiple encoding streams such that sequential packets from each stream are not transmitted sequentially on the same sub-channel nor simultaneously on another sub-channel of a multi sub-channel vector signaling code sent over a multi-wire bus.


Methods and systems are described for obtaining a plurality of information bits, and responsively partitioning the obtained plurality of information bits into a plurality of subsets of information bits, generating a plurality of streams of forward error correction (FEC)-encoded bits using a plurality of FEC encoders receiving respective subsets of the plurality of subsets of information bits, providing the plurality of streams of FEC-encoded bits to a plurality of sub-channel encoders, each sub-channel encoder receiving a respective stream of FEC-encoded bits from a different FEC encoder of the plurality of FEC encoders for generating a set of codewords of a vector signaling code, and wherein sequential streams of FEC-encoded bits from a given FEC encoder are provided to different sub-channel encoders for each successively generated set of codewords, and transmitting the successively generated sets of codewords of the vector signaling code over a multi-wire bus.





BRIEF DESCRIPTION OF FIGURES


FIG. 1 is a block diagram of a system that may serve as the physical transport for the described embodiments, with transmitter 110 communicating over a multiwire 125 communications channel 120 to receiver 130.



FIG. 2 is a more detailed block diagram of Transmitter 110 of FIG. 1.



FIG. 3 is a more detailed block diagram of Receiver 130 of FIG. 1.



FIG. 4 is a block diagram of an embodiment of an error corrected system, where lower-level transport and PHY 430 may be the systems of FIGS. 1-3.



FIG. 5A illustrates operation of Digital Integrator 420 of FIG. 4, and FIG. 5B illustrates operation of the Digital Differentiator function 440 of FIG. 4.



FIG. 6 is a block diagram showing the Distribution of incoming data bytes to multiple FEC Encoders, with the resulting output streams being acted upon by a permuter function prior to transport.



FIG. 7 illustrates three FEC protected data streams passed directly to three transport sub-channels, without permutation.



FIG. 8 illustrates three FEC protected data streams mapped in reoccurring order to three transport sub-channels.



FIG. 9 illustrates three FEC protected data streams mapped in a cyclically varying order to three transport sub-channels.



FIG. 10 shows one embodiment of a permuter subsystem.



FIG. 11 shows another embodiment of a permuter subsystem.



FIG. 12 is a flowchart of a method, in accordance with some embodiments.





DETAILED DESCRIPTION

As described in [Cronie I], [Cronie II], and [Shokrollahi II], vector signaling codes may be used to produce extremely high bandwidth data communications links, such as between two integrated circuit devices in a system. As illustrated by the embodiment of FIG. 1, a data communications channel 120 comprised of multiple wires 125 carries symbols of the vector signaling code, acting together to communicate codewords of the vector signaling code. Depending on the particular vector signaling code used, the number of wires making up a communications link or multi-wire bus may range from two to eight or more, and may also communicate one or more clock signals on separate wires or as sub-channel components of the vector signaling code. In the example of FIG. 1, communication link 120 is illustrated as being composed of eight wires 125, collectively communicating five data values 100 and one clock 105 between transmitter 110 and receiver 130. Further descriptions of such communications links are provided in [Shokrollahi II].


Individual symbols, e.g. transmissions on any single wire, may utilize multiple signal levels, often three or more. Operation at channel rates exceeding 10 Gbps may further complicate receive behavior by requiring deeply pipelined or parallelized signal processing. Embodiments described herein can also be applied to prior art permutation sorting methods not covered by the vector processing methods of [Shokrollahi II]. More generally, embodiments may apply to any communication or storage methods utilizing coordination of multiple channels or elements of the channel to produce a coherent aggregate result.


Because of its characteristic of transmitting multiple symbols essentially in parallel, vector signaling codes are generally considered as communicating data in symbol groups, for example in five-bit increments for the CNRZ-5 code of [Shokrollahi II], or in three-bit increments for the H4 code of [Shokrollahi I], also described in [Fox I] as the Enhanced Non-Return to Zero or ENRZ code. High-bandwidth systems may utilize multiple vector signaling code channels, distributing data across the multiple channels for transmission, and gathering received data from the multiple channels to be transparently combined again at the receiver. Thus, this document may subsequently describe transport as occurring in increments of K*n bits, where n is that code's symbol group or payload size. That reference additionally notes, however, that the encoded sub-channels transporting individual bits are mathematically distinct, and in certain embodiments may be treated as independent transport channels.


Serialization and Deserialization


In conventional bit-serial communications systems, data words provided by a transmitting or source process are serialized into a sequential stream of bits, in one exemplary embodiment using a digital shift register. At the receiver, sequentially detected bits are deserialized using comparable means, so that a receiving or destination process may be presented with complete data words equivalent to those provided at the transmitter. Vector signaling code communication systems perform comparable operations, although in these embodiments the serialization process generally breaks words into symbol groups (e.g. into five bit elements for a CNRZ-5 system,) and the equivalent deserialization process assembles received groups (of five bits, continuing the same example,) into words again.


As is readily apparent, serialization and deserialization introduce latency into the communication channel, with the amount of latency dependent on the number of transmitted elements into which a given data word is serialized, as the entire word is not available until its last-transmitted element has been received and the received word fully reassembled.


In some high-speed communications systems, serialization and deserialization may additionally incorporate multiple processing phases operating essentially in parallel, to provide additional processing time within each phase and/or to permit processing operation using a lower clock rate to reduce power consumption. In one representative embodiment, data words presented by the transmission or source process are broken into symbol groups, with consecutive symbol groups being assigned to sequentially chosen processing phases which perform the necessary encoding, formatting, etc. As each processing phase completes its operations, the processed results are transferred to an output driver for transmission over the communications medium. Thus, in the case where four processing phases are used, each phase will have approximately four transmit unit intervals of time to perform the necessary operations. Similar multiphase processing may occur at the receiver; consecutively received symbol groups being detected by sequentially assigned processing phases and reassembled into output words.


Embodiments incorporating multiple processing phases are used herein as descriptive examples, so as to provide the broadest and most complete illustration of features and behaviors. Other embodiments may utilize fewer or more processing phases, including a single instance, and may incorporate greater or lesser amount of transmit and/or receive processing into the essentially parallel processing phases, with no limitation implied by these examples.


Link Error Correction


Communications system designs emphasize error-free transport of data, despite the inevitable presence of noise and other signal disruptions. Error probabilities over the communications path are expressed as a Bit Error Rate (BER), representing the ratio of bit errors received to overall bits transmitted.


Solutions to detect bit errors, including cyclic check codes, parity, and redundant transmission, are known in the art. Similarly, solutions are known for correction of errors, most notably the closed-loop retransmission methods of the TCP/IP protocol suite, in which a receiver detects an error, uses a return channel to request a retransmission by the transmitter, and then transparently inserts the corrected data into its output stream.


Forward Error Correction


Where use of a return channel is impossible or the round-trip latency of waiting for a retransmission is unacceptable, Forward Error Correction (FEC) methods have been developed which introduce redundancy into the transmitted data stream as part of a check code that both detects and facilitates correction of errors. The more redundancy introduced into the transmitted data stream (e.g. by use of a longer FEC sequence,) the greater the ability of the FEC to correct bit errors, but also the greater the protocol overhead, presenting itself as a lower effective data transmission rate.


In cases where the native communications link has relatively low uncorrected BER (e.g., 1×10−9 to 1×10−10) and the target BER is of the order of 1×10−15 to 1×10−20, other solutions can be found with much lower latency. This is the case, as one example, for the low latency FEC of [Shokrollahi III], targeted for in-package die-to-die links that use vector signaling code such as the Glasswing or CNRZ-5 code of [Shokrollahi II].


Example Embodiment


For purposes of explanation and without implying limitation, the reference system for the following descriptions is assumed to have the following characteristics:

    • Underlying transport providing three sub-channels using ENRZ coding at a 25 Gigasymbol/second rate, equivalent to a 40 picosecond unit interval.
    • Uncorrected BER in the range of 10E-8 to 10E-9, comprised of both random bit and short burst errors
    • Corrected FER or BER less than 10E-19
    • FEC latency of 80 ns or less.



FIG. 1 is a block diagram of a system that may serve as the physical transport for such a system, with transmitter 110 communicating over a multiwire 125 communications channel 120 to receiver 130.



FIG. 2 illustrates a more detailed block diagram of transmitter 110. In a practical embodiment operating at the example speeds, data will typically be provided using a fairly wide-word interface, to allow a slower transfer rate, with Data Buffer 210 providing the necessary temporary storage and data funneling to the ENRZ sub-channels, which typically transports one bit per unit interval per sub-channel. Multiple data processing phases 220 may be utilized, as are typically used in such high-speed systems. Data Buffer 210 thus reformats Transmit Data into appropriate width for each of the processing phases, but may also distribute data among multiple processing phases to enable parallel computation. Data is encoded 220 and output to Wire outputs W0-W3 by Line Drivers 240 under control of Clock Generator 250. If multiple parallel processing phases are used, multiplexers 230 combine the multiple encoded streams into a single high speed result 235.



FIG. 3 provides a more detailed block diagram of receiver 130. Signals received over Wire inputs W0-W3 are amplified and frequency compensated by Continuous Time Linear Equalizers (CTLE) 310. ENRZ sub-channels are decoded by Multi-input Comparators (MICs) 320, producing three sub-channel results MIC0-MIC2. Clock Recovery subsystem 390 synthesizes a receive clock from data transitions on received sub-channels MIC0-MIC2. As with the example transmitter, multiple receive processing phases 330 will typically be used to facilitate high speed operation, each such phase sampling the received data using the recovered clock. Buffer 370 allows high speed data received from 330 to be reformatted from the typical one received bit per sub-channel per unit interval, into the wider words and slower transfer rates needed to interface to an external system. In some embodiments such as described in [Shokrollahi III], this buffer also provides temporary storage while Error Correction 360 corrects any detected data errors.



FIG. 4 is a high-level block diagram of the error corrected system, showing the ENRZ transport 430 of FIGS. 1-3 as its lower-level or PHY medium. For descriptive purposes, data is described as passing through this system as streams of bytes, although other embodiments may operate at a different granularity; as previously described, the underlying ENRZ transport typically transmits or receives one bit per sub-channel per unit interval, thus an intrinsic serialization/deserialization is assumed to be part of the PHY embodiment.


As used herein, the definition of Digital Integrator 420 is as shown as FIG. 5A, and the definition of Digital Differentiator 440 is as shown as FIG. 5B. These functions are used to control the impact of burst errors, with each burst becoming two bit errors after digital differentiation. The descriptive examples presume these functions perform bitwise operations on a data stream, although known art embodiments operating, as one example on streams of bytes are well known thus no limitation is implied.


Without implying limitation, the Forward Error Correcting algorithm assumed in the following descriptions is a Generalized Reed-Solomon code over the Galois Field GF(256), of length 255, capable of 5-error correcting with a 3.92% redundancy. Another embodiment providing 4-error correcting with 3.14% redundancy is functionally equivalent. Both examples are compatible with the interleaving patterns subsequently described.


As presented in the examples here, the encoder is systematic, i.e., the input Symbols inp(0), . . . , inp(k−1) are part of the codeword output of the encoder, and usually all precede or all follow the redundant symbols of the codeword. With FEC, redundant symbols are calculated from the input symbols and the input symbols and redundant symbols form the codeword that are sent through the channel. In a variation, the original input Symbols are not explicitly present but can be recovered from what is sent. That variation is referred to as “nonsystematic” encoding.


Addressing Channel Error Characteristics


Modeling the underlying transport system for error sources, two distinct error modes become apparent. A generalized fault condition or noise source can impact the entire ENRZ transport, introducing codeword errors that lead to essentially simultaneous errors on all sub-channels. Or, more subtly, noise, attenuation, or skew on a subset of the wires may lead to one sub-channel having a substantially higher error rate than the others.


These risks may be mitigated by running separate instances of the FEC algorithm on each of the three ENRZ sub-channels, thus allowing error correction to occur independently. As described in [Fox I], the three sub-channels of the ENRZ code may correspond to mutually orthogonal sub-channel vectors corresponding to rows of an orthogonal matrix. Each row of the orthogonal matrix may be weighted by a respective input bit from e.g., one of the FEC-encoded streams, and all weighted sub-channel vectors may be summed to provide a codeword of the ENRZ vector signaling code. As shown in FIG. 6, a Distributor function distributes or “deals out” incoming data to the individual FEC encoders for transport over the three sub-channels of the ENRZ PHY. In one embodiment, this Distribution is performed on data bytes; other embodiments may perform this distribution at a different granularity. In some embodiments, distributing the streams of FEC-encoded bits as bytes may generate successive sets of codewords, where each successive set of codewords is generated by providing sequential streams of FEC-encoded bits from a given FEC encoder to different sub-channel encoders. Alternatively, if the streams of FEC-encoded bits are distributed of bits, each successive codeword may be generated by providing sequential FEC-encoded bits from a given FEC encoder to different sub-channel encoders.


How this “dealing out” is performed has a significant impact on error containment. An obvious sequential ordering (i.e. allowing parallel streams of data to be transmitted on the three sub-channels) is equivalent to an embodiment having a fall-through or “no op” behavior of the Permuter function of FIG. 6. Such a sequence is shown in FIG. 7, where each sub-channel of the ENRZ code carries a respective stream of FEC-encoded data from a respective FEC encoder. Even with this simple sequential byte ordering within each sub-channel, potential errors in PHY analog detection (as may be caused by generalized faults) affects symbols in different sub-channels (e.g. in different FEC streams), which is a recoverable error. However, persistent weaknesses leading to burst errors in a single sub-channel may affect consecutive symbols in the same FEC-encoded stream, potentially overwhelming the sequential error correction ability of that sub-channel's FEC. Moreover, the sequential transmission of the relatively long FEC blocks leads to increased data latency, as the receiver cannot release a given data block until all of its contents have been received and its error detection values validated.


A second embodiment modifies the Permuter function of FIG. 6 to subdivide a given FEC-encoded stream of incoming bytes into groups of three bytes, which are then dealt out consistently in a “1, 2, 3” order to the three ENRZ sub-channels by simultaneously providing all three bytes to respective sub-channel encoders. As shown in FIG. 8, such a consistent interleaving significantly reduces the perceived data latency and provides increased robustness against burst errors in a single sub-channel. However, as consecutive bytes are now transmitted concurrently in the three sub-channels, there may be a potential for errors in analog detection affecting three symbols in the same code, leading to uncorrectable errors.


In at least one embodiment, the Permuter function of FIG. 6 cyclically permutes the order in which each group of e.g., three bytes is dealt out. As shown in FIG. 9, which byte of the three bytes is the first to be dealt out differs in each three-byte set of the three FEC-encoded streams. Such a permutation protects against both burst errors within a single sub-channel, and burst errors occurring across all sub-channels, while preserving the desirable latency reduction of the previous embodiment.


Permuter Embodiments



FIG. 10 is a block diagram illustrating one implementation of the permuter shown in FIG. 6. As shown, the permuter includes a plurality of buffers configured to store streams of FEC-encoded bits from a respective FEC encoder of the plurality of FEC encoders. Each buffer may receive the stream of FEC-encoded bits pre-serialized from the FEC encoders, or may alternatively perform a serialization operation on FEC-encoded bits received in parallel. The permuter may further include a plurality of multiplexors configured to receive a stream of FEC-encoded bits from each buffer, and to responsively select which stream of FEC-encoded bits to provide to the corresponding digital integrators. As shown, each multiplexor receives a corresponding selection signal corresponding to staggered versions of a count signal provided by the counter. In the embodiment shown, the counter may be configurable to count 0, 1, 2, 0, 1, 2, and so on according to a (potentially modified) version of the permutation clock. The counter may thus provide three versions of the count signal including count, count+1 (mod 3), and count+2 (mod 3). As shown in FIG. 10, each count signal may be formatted as a pair of bits. Thus, as each multiplexor will receive a count signal being offset by 1 with respect to the other count signals, each sub-channel encoder will receive a bit or a stream of FEC-encoded bits (e.g., a multi-bit packet) from a different buffer when generating a given codeword or set of codewords of the vector signaling code. In some embodiments, the count signal “count” may increment once per byte of transferred data per destination, thus permuting the destination of the FEC encoded stream on byte intervals as illustrated in FIG. 9, while alternative embodiments may effectively increment the counter at a different granularity. The FEC-encoded streams may be provided to sub-channel encoders 1-3 via digital precoding integrators, as shown in FIG. 5A. Each sub-channel encoder may be configured to provide a respective weighted sub-channel vector that is weighted according to the received FEC-encoded stream, all weighted sub-channel vectors being summed to produce the symbols of the codeword to be transmitted via the multi-wire bus.



FIG. 11 illustrates an alternative embodiment of a permuter. The permuter of FIG. 11 is similar to that of FIG. 10, however in FIG. 11, each FEC encoder is connected to a corresponding de-multiplexor that selects in which sub-channel specific buffer to store the stream of FEC-encoded bits. Similar to above, the selections may be performed according to staggered count signals in order to permute the destination of the bits provided to each buffer over time. The embodiments of FIGS. 10 and 11 illustrate only two possible embodiments in which the permuter may be implemented, and it should be noted alternative embodiments may be implemented through the use of logic gates in a field-programmable gate array (FPGA), for example, or software running on a processor that uses pointers to either read a stream from a buffer associated with an FEC encoder, or to write a stream from each FEC encoder to a sub-channel specific buffer. Further, a hardware description language may be used to generate a suitable circuit configuration.


Once each sub-channel encoder receives its respective stream (e.g., a byte, a multi-bit packer or in some embodiments a single bit) of FEC-encoded bits, the stream having been serialized for transmission by e.g., the FEC encoder or the buffer, each sub-channel encoder may generate a weighted sub-channel vector by e.g., modulating a corresponding sub-channel vector of a plurality of mutually orthogonal sub-channel vectors. A codeword of a vector signaling code is thus formed representing a weighted summation of the plurality of mutually orthogonal sub-channel vectors, the weight of each sub-channel vector being applied by a corresponding bit in the received serialized stream of FEC-encoded bits. FIGS. 10 and 11 illustrate the output of each sub-channel encoder being summed. In some embodiments, such a summation may be performed as an analog summation in the case each sub-channel encoder outputs an analog signal. Alternatively, each sub-channel encoder may generate and output one or more bits for controlling a multi-level driver to generate symbol values on the multi-wire bus, such as driver 240 in FIG. 2. In some embodiments, the codeword of the vector signaling code may be a permutation of ±[1, −⅓, −⅓, −⅓].



FIG. 12 is a flowchart of a method 1200, in accordance with some embodiments. As shown, method 1200 includes obtaining a plurality of information bits 1202, and responsively partitioning the obtained plurality of information bits into a plurality of subsets of information bits. A plurality of FEC encoders generate 1204 a plurality of streams of forward error correction (FEC)-encoded bits, the plurality of FEC encoders receiving respective subsets of the plurality of subsets of information bits. The plurality of streams of FEC-encoded bits are provided 1206 to a plurality of sub-channel encoders for generating successive sets of codewords of a vector signaling code. Each sub-channel encoder receives a respective stream of FEC-encoded bits from a different FEC encoder of the plurality of FEC encoders for generating a set of codewords of a vector signaling code. Sequential streams of FEC-encoded bits from a given FEC encoder are provided to different sub-channel encoders for each successively generated set of codewords. The successively generated sets of codewords of the vector signaling code are transmitted 1208 over a multi-wire bus.


In some embodiments, each stream of FEC encoded bits corresponds to a multi-bit packet. Alternatively, each stream of FEC encoded bits may correspond to a single bit.


In some embodiments, generating each codeword of the set of codewords of the vector signaling code includes modulating mutually-orthogonal sub-channel vectors on the multi-wire bus according to the plurality of streams of FEC-encoded bits and responsively forming a summation of the modulated mutually-orthogonal sub-channel vectors.


In some embodiments, each stream of FEC encoded bits is provided to the corresponding sub-channel encoder using a corresponding multiplexor of a plurality of multiplexors, each multiplexor receiving all of the streams of FEC encoded bits and associated with a corresponding sub-channel encoder. Alternatively, each stream of FEC-encoded bits is selectively provided to the corresponding sub-channel encoder via a de-multiplexor of a plurality of de-multiplexors, each de-multiplexor associated with a corresponding FEC encoder.


In some embodiments, the plurality of streams of FEC encoded bits are buffered prior to providing the plurality of streams of FEC encoded bits to the plurality of sub-channel encoders.


In some embodiments, the sub-channel encoders are ENRZ sub-channel encoders.


In some embodiments, sequential streams of FEC-encoded bits are provided to corresponding sub-channel encoders according to respective count signals of a plurality of count signals, the plurality of count signals being staggered in time.


In some embodiments, each stream of FEC encoded bits is integrated prior to being provided to the corresponding sub-channel encoder.


Descriptive terms used herein such as “voltage” or “signal level” should be considered to include equivalents in other measurement systems, such as “current”, “charge”, “power”, etc. As used herein, the term “signal” includes any suitable behavior and/or attribute of a physical phenomenon capable of conveying information. The information conveyed by such signals may be tangible and non-transitory.


Note that where various hardware elements of one or more of the described embodiments are referred to as “modules” that carry out (perform, execute, and the like) various functions that are described herein, a module includes hardware (e.g., one or more processors, one or more microprocessors, one or more microcontrollers, one or more microchips, one or more application-specific integrated circuits (ASICs), one or more field programmable gate arrays (FPGAs), one or more memory devices) deemed suitable by those of skill in the relevant art for a given implementation. Each described module may also include instructions executable for carrying out the one or more functions described as being carried out by the respective module, and those instructions may take the form of or include hardware (or hardwired) instructions, firmware instructions, software instructions, and/or the like, and may be stored in any suitable non-transitory computer-readable medium or media, such as commonly referred to as RAM or ROM.


Although features and elements are described above in particular combinations, one of ordinary skill in the art will appreciate that each feature or element may be used alone or in any combination with the other features and elements. In addition, the methods described herein may be implemented in a computer program, software, or firmware incorporated in a computer-readable medium for execution by a computer or processor. Examples of computer-readable storage media include, but are not limited to, a read only memory (ROM), a random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROM disks, and digital versatile disks (DVDs).

Claims
  • 1. A method comprising: obtaining a set of information bits;sequentially allocating data bytes of the set of information bits to respective forward error correction (FEC) encoders of a plurality of parallel FEC encoders to generate a plurality of parallel FEC-encoded data bytes;providing, in a first interleaved order, a first set of FEC-encoded data bytes obtained from the plurality of parallel FEC-encoded data bytes to respective transport channels of a plurality of transport channels of an analog physical layer (PHY) circuit for parallel transmission during a plurality of signaling intervals; andproviding, in a second interleaved order, a second set of FEC-encoded data bytes obtained from the plurality of parallel FEC-encoded data bytes to respective transport channels of the plurality of transport channels for parallel transmission during a subsequent plurality of signaling intervals.
  • 2. The method of claim 1, wherein providing the first and second sets of FEC-encoded data bytes in the first and second interleaved orders to the respective transport channels comprises selecting, using a plurality of multiplexers, respective FEC-encoded bytes from each FEC encoder, each multiplexer associated with a respective transport channel.
  • 3. The method of claim 1, wherein providing the first and second sets of FEC-encoded data bytes in the first and second interleaved orders to the respective transport channels comprises sequentially selecting in interleaved order, FEC-encoded data bytes from a given FEC encoder, using a plurality of demultiplexers, and providing the selected FEC-encoded data bytes to a corresponding transport channel of the plurality of transport channels.
  • 4. The method of claim 1, wherein each transport channel of the plurality of transport channels is associated with a respective sub-channel of a plurality of mutually orthogonal sub-channels, the plurality of mutually orthogonal sub-channels associated with a vector signaling code.
  • 5. The method of claim 1, wherein each transport channel of the plurality of transport channels is a differential signaling channel.
  • 6. The method of claim 1, wherein each transport channel of the plurality of transport channels is a single-ended signaling channel.
  • 7. The method of claim 1, further comprising integrating each FEC-encoded data byte of the plurality of parallel FEC-encoded data bytes.
  • 8. The method of claim 1, further comprising decoding each parallel FEC-encoded data bytes, and responsively generating a set of output bits.
  • 9. The method of claim 1, wherein each FEC encoder generates FEC-encoded bytes forming a systematic-encoded codeword having (i) respective allocated data bytes and (ii) redundancy symbols calculated based on the respective allocated data bytes.
  • 10. The method of claim 1, wherein each FEC encoder generates FEC-encoded bytes forming a nonsystematic-encoded codeword based on the respective allocated data bytes.
  • 11. The method of claim 1, wherein each FEC encoder generates FEC-encoded bytes forming a codeword based on a Reed-Solomon code.
  • 12. The method of claim 1, wherein the plurality of transport channels of the analog PHY circuit interface to a die-to-die link.
  • 13. The method of claim 1, wherein the plurality of transport channels of the analog PHY circuit interface to a chip-to-chip link.
  • 14. The method of claim 1, wherein the plurality of transport channels of the analog PHY circuit interface to a device-to-device link.
  • 15. An apparatus comprising: a distributor configured to obtain a set of information bits, and to sequentially allocate data bytes of the set of information bits to a plurality of distributor outputs;a plurality of parallel FEC-encoders, each FEC-encoder connected to a respective distributor output, the plurality of parallel FEC-encoders configured to generate a plurality of parallel FEC-encoded data bytes;an analog physical layer (PHY) circuit comprising a plurality of transport channels; anda plurality of multiplexing circuits configured to:provide, in a first interleaved order, a first set of FEC-encoded bytes obtained from the plurality of FEC-encoders to respective transport channels of the plurality of transport channels for parallel transmission during a plurality of signaling intervals; andprovide, in a second interleaved order, a second set of FEC-encoded data bytes obtained from the plurality of FEC-encoders to respective transport channels of the plurality of transport channels for parallel transmission during a subsequent plurality of signaling intervals.
  • 16. The apparatus of claim 15, wherein the plurality of multiplexing circuits comprises a plurality of multiplexers, each multiplexer having an output associated with a respective transport channel, and wherein each multiplexer is configured to select FEC-encoded bytes from the plurality of parallel FEC-encoded data bytes according to the first interleaved order during the plurality of signaling intervals and according to the second interleaved order during the subsequent plurality of signaling intervals.
  • 17. The apparatus of claim 15, wherein the plurality of multiplexing circuits comprises a plurality of demultiplexers, each demultiplexer receiving a respective parallel FEC-encoded data stream as an input and having respective outputs for each transport channel of the plurality of transport channels, and wherein the plurality of demultiplexers are configured to provide FEC-encoded bytes to the plurality of transport channels according to the first interleaved order during the plurality of signaling intervals and according to the second interleaved order during the subsequent plurality of signaling intervals.
  • 18. The apparatus of claim 15, wherein each transport channel of the plurality of transport channels is associated with a respective sub-channel of a plurality of mutually orthogonal sub-channels, the plurality of mutually orthogonal sub-channels associated with a vector signaling code.
  • 19. The apparatus of claim 15, wherein each transport channel of the plurality of transport channels is a differential signaling channel.
  • 20. The apparatus of claim 15, wherein each transport channel of the plurality of transport channels is a single-ended signaling channel.
  • 21. The apparatus of claim 15, further comprising an integrator configured to integrate each FEC-encoded data stream of the plurality of parallel FEC-encoded data streams.
  • 22. The apparatus of claim 15, further comprising a plurality of FEC decoders, each FEC decoder configured to receive respective FEC-encoded data bytes over the plurality of transport channels, and to responsively generate a set of output bits.
  • 23. The apparatos of claim 15, wherein each FEC encoder is configured to generate FEC-encoded bytes forming a systematic-encoded codeword having (i) respective allocated bytes and (ii) redundancy symbols calculated based on the respective allocated bytes.
  • 24. The apparatus of claim 15, wherein each FEC encoder is configured to generate FEC-encoded bytes forming a nonsystematic-encoded codeword based on the respective allocated data bytes.
  • 25. The apparatus of claim 15, wherein the plurality of FEC encoders are configured to generate the plurality of parallel FEC-encoded data bytes based on a Reed-Solomon code.
  • 26. The apparatus of claim 15, wherein the plurality of transport channels of the analog PHY circuit interface to a die-to-die link.
  • 27. The apparatus of claim 15, wherein the plurality of transport channels of the analog PHY circuit interface to a chip-to-chip link.
  • 28. The apparatus of claim 15, wherein the plurality of transport channels of the analog PHY circuit interface to a device-to-device link.
  • 29. An apparatus comprising: a digital data buffer circuit having an input and a plurality of digital digital data buffer outputs, the digital data buffer configured to obtain a set of information bits at the input, and to sequentially allocate data bytes of the stream of information bits to the plurality of digital data buffer outputs;a plurality of parallel FEC-encoders, each FEC-encoder connected to a respective digital data buffer output, the plurality of parallel FEC-encoders configured to generate a plurality of parallel FEC-encoded data bytes;an analog physical layer (PHY) circuit comprising a plurality of transport channels; anda plurality of multiplexing circuits configured to:output, in a first interleaved order, a first set of FEC-encoded bytes obtained from the plurality of FEC encoders to respective transport channels of the plurality of transport channels for parallel transmission during a plurality of signaling intervals; andoutput, in a second interleaved order, a second set of FEC-encoded data bytes obtained from the plurality of FEC encoders to respective transport channels of the plurality of transport channels for parallel transmission during a subsequent plurality of signaling intervals.
  • 30. The apparatus of claim 29, wherein each FEC encoder is configured to generate FEC-encoded bytes forming a systematic-encoded codeword having (i) respective allocated bytes and (ii) redundancy symbols calculated based on the respective allocated bytes.
  • 31. The apparatus of claim 29, wherein each FEC encoder is configured to generate FEC-encoded bytes forming a nonsystematic-encoded codeword based on the respective allocated data bytes.
  • 32. The apparatus of claim 29, wherein the plurality of FEC encoders are configured to generate the plurality of parallel FEC-encoded data bytes based on a Reed-Solomon code.
  • 33. The apparatus of claim 29, wherein the plurality of transport channels of the analog PHY circuit interface to a die-to-die link.
  • 34. The apparatus of claim 29, wherein the plurality of transport channels of the analog PHY circuit interface to a chip-to-chip link.
  • 35. The apparatus of claim 29, wherein the plurality of transport channels of the analog PHY circuit interface to a device-to-device link.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 16/909,525, filed Jun. 23, 2020, now U.S. Pat. No. 11,368,247, granted Jun. 21, 2022, entitled “Multi-Wire Permuted Forward Error Correction”, which is a continuation of U.S. application Ser. No. 16/031,877, filed Jul. 10, 2018, now U.S. Pat. No. 10,693,587, granted Jun. 23, 2020, naming Amin Shokrollahi, et al., entitled “Multi-Wire Permuted Forward Error Correction”, which claims the benefit of U.S. Provisional Application No. 62/530,809, filed Jul. 10, 2017, naming Amin Shokrollahi, et al., entitled “Multi-Wire Permuted Forward Error Correction”, all of which are hereby incorporated herein by reference in their entirety for all purposes.

US Referenced Citations (295)
Number Name Date Kind
3196351 David Jul 1965 A
3629824 Bossen Dec 1971 A
3965418 Bauer et al. Jun 1976 A
3970795 Allen Jul 1976 A
4112264 Abramson et al. Sep 1978 A
4163258 Ebihara et al. Jul 1979 A
4486739 Franaszek et al. Dec 1984 A
4499550 Ray et al. Feb 1985 A
4772845 Scott Sep 1988 A
4864303 Ofek Sep 1989 A
5053974 Penz Oct 1991 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
5412689 Chan et al. May 1995 A
5449895 Hecht et al. Sep 1995 A
5553097 Dagher Sep 1996 A
5566193 Cloonan Oct 1996 A
5825808 Hershey et al. Oct 1998 A
5856935 Moy et al. Jan 1999 A
5875202 Venters et al. Feb 1999 A
5881130 Zhang Mar 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
6119263 Mowbray et al. Sep 2000 A
6128330 Schilling Oct 2000 A
6154498 Dabral et al. Nov 2000 A
6175230 Hamblin et al. Jan 2001 B1
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
6404820 Postol Jun 2002 B1
6452420 Wong Sep 2002 B1
6473877 Sharma Oct 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
6690739 Mui Feb 2004 B1
6766342 Kechriotis Jul 2004 B2
6865234 Agazzi Mar 2005 B1
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
6973613 Cypher Dec 2005 B2
6976194 Cypher Dec 2005 B2
6982954 Dhong et al. Jan 2006 B2
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
7057546 Secatch et al. Jun 2006 B1
7075996 Simon et al. Jul 2006 B2
7080288 Ferraiolo et al. Jul 2006 B2
7082557 Schauer 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
7231558 Gentieu et al. Jun 2007 B2
7269130 Pitio Sep 2007 B2
7269212 Chau et al. Sep 2007 B1
7335976 Chen et al. Feb 2008 B2
7346819 Bansal et al. Mar 2008 B2
7356213 Cunningham et al. Apr 2008 B1
7358869 Chiarulli et al. Apr 2008 B1
7362130 Broyde et al. Apr 2008 B2
7362697 Becker et al. Apr 2008 B2
7370264 Worley et al. May 2008 B2
7496130 Rumney Feb 2009 B2
7633850 Ahn Dec 2009 B2
7643588 Msalli et al. Jan 2010 B2
7656321 Wang Feb 2010 B2
7694204 Schmidt et al. Apr 2010 B2
7698088 Sul et al. Apr 2010 B2
7706456 Laroia et al. Apr 2010 B2
7734191 Welch et al. Jun 2010 B1
7746764 Rawlins et al. Jun 2010 B2
7868790 Bae Jan 2011 B2
7869546 Tsai Jan 2011 B2
7882413 Chen et al. Feb 2011 B2
7899653 Hollis Mar 2011 B2
7933770 Krueger et al. Apr 2011 B2
8050332 Chung et al. Nov 2011 B2
8055095 Palotai et al. Nov 2011 B2
8091006 Prasad et al. Jan 2012 B2
8149906 Saito et al. Apr 2012 B2
8159375 Abbasfar Apr 2012 B2
8159376 Abbasfar Apr 2012 B2
8185807 Oh et al. May 2012 B2
8199849 Oh et al. Jun 2012 B2
8199863 Chen et al. Jun 2012 B2
8209580 Varnica et al. Jun 2012 B1
8218670 Abou Jul 2012 B2
8233544 Bao et al. Jul 2012 B2
8238318 Negus Aug 2012 B1
8245094 Jiang et al. Aug 2012 B2
8245102 Cory et al. Aug 2012 B1
8279094 Abbasfar Oct 2012 B2
8279745 Dent Oct 2012 B2
8279957 Tsai 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
8338318 Siebers et al. Dec 2012 B2
8341492 Shen et al. Dec 2012 B2
8365035 Hara Jan 2013 B2
8429492 Yoon et al. Apr 2013 B2
8429495 Przybylski Apr 2013 B2
8462891 Kizer et al. Jun 2013 B2
8472513 Malipatil et al. Jun 2013 B2
8498368 Husted et al. Jul 2013 B1
8520493 Goulahsen Aug 2013 B2
8521020 Welch et al. Aug 2013 B2
8539318 Shokrollahi et al. Sep 2013 B2
8577284 Seo et al. Nov 2013 B2
8578246 Mittelholzer 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
8601340 Farhoodfar Dec 2013 B2
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
8693570 Wang Apr 2014 B2
8711919 Kumar 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
8775892 Zhang 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
9071476 Fox et al. Jun 2015 B2
9077386 Holden et al. Jul 2015 B1
9100232 Hormati et al. Aug 2015 B1
9152495 Losh et al. Oct 2015 B2
9172412 Kim et al. Oct 2015 B2
9178536 Lee Nov 2015 B2
9183085 Northcott Nov 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
9385755 Petrov Jul 2016 B2
9401828 Cronie et al. Jul 2016 B2
9432082 Ulrich et al. Aug 2016 B2
9444654 Hormati et al. Sep 2016 B2
9450612 Hu Sep 2016 B2
9455744 George et al. Sep 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
9564926 Farhoodfar Feb 2017 B2
9608669 Song et al. Mar 2017 B2
9634797 Benammar et al. Apr 2017 B2
9667379 Cronie et al. May 2017 B2
9710412 Sengoku Jul 2017 B2
9852806 Stauffer et al. Dec 2017 B2
10055372 Shokrollahi Aug 2018 B2
10396819 Myung et al. Aug 2019 B1
10873373 Suh et al. Dec 2020 B2
20010000219 Agazzi et al. Apr 2001 A1
20010006538 Simon et al. Jul 2001 A1
20010055294 Motoyoshi Dec 2001 A1
20020044316 Myers Apr 2002 A1
20020152340 Dreps et al. Oct 2002 A1
20020154633 Shin et al. Oct 2002 A1
20020163881 Dhong et al. Nov 2002 A1
20020174373 Chang Nov 2002 A1
20020181607 Izumi Dec 2002 A1
20030016770 Trans et al. Jan 2003 A1
20030086366 Branlund et al. May 2003 A1
20030087634 Raghavan et al. May 2003 A1
20030185310 Ketchum et al. Oct 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
20060056538 Nam et al. Mar 2006 A1
20060080087 Vandali et al. Apr 2006 A1
20060126751 Bessios Jun 2006 A1
20060159005 Rawlins et al. Jul 2006 A1
20060245757 Elahmadi et al. Nov 2006 A1
20060251421 Arnon Nov 2006 A1
20060291571 Divsalar et al. Dec 2006 A1
20060291589 Eliezer et al. Dec 2006 A1
20070030796 Green Feb 2007 A1
20070070967 Yang et al. Mar 2007 A1
20070076871 Renes Apr 2007 A1
20070204205 Niu et al. Aug 2007 A1
20070283210 Prasad et al. Dec 2007 A1
20080016432 Lablans Jan 2008 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
20090141827 Saito et al. Jun 2009 A1
20090150754 Dohmen et al. Jun 2009 A1
20090154604 Lee et al. Jun 2009 A1
20090316730 Feng et al. Dec 2009 A1
20100046644 Mazet Feb 2010 A1
20100054355 Kinjo et al. Mar 2010 A1
20100081451 Mueck et al. Apr 2010 A1
20100146363 Birru et al. Jun 2010 A1
20100215112 Tsai et al. Aug 2010 A1
20100235673 Abbasfar Sep 2010 A1
20100287438 Lakkis Nov 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
20110051854 Kizer et al. Mar 2011 A1
20110072330 Kolze Mar 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
20120036415 Shafrir et al. Feb 2012 A1
20120213299 Cronie et al. Aug 2012 A1
20120257683 Schwager et al. Oct 2012 A1
20120272117 Stadelmeier 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
20130315264 Srinivasa et al. Nov 2013 A1
20130315501 Atanassov et al. Nov 2013 A1
20130346830 Ordentlich et al. Dec 2013 A1
20140006649 Wiley et al. Jan 2014 A1
20140068385 Zhang et al. Mar 2014 A1
20140068391 Goel et al. Mar 2014 A1
20140079394 Xie et al. Mar 2014 A1
20140112376 Wang et al. Apr 2014 A1
20140177645 Cronie et al. Jun 2014 A1
20140254642 Fox et al. Sep 2014 A1
20150070201 Dedic et al. Mar 2015 A1
20150078479 Whitby-Strevens Mar 2015 A1
20150092532 Shokrollahi et al. Apr 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
20150381315 Thomson et al. Dec 2015 A1
20150381768 Fox et al. Dec 2015 A1
20160020796 Hormati et al. Jan 2016 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
20190103903 Yang Apr 2019 A1
20200321778 Gharibdoust et al. Oct 2020 A1
20210297292 Hormati Sep 2021 A1
Foreign Referenced Citations (12)
Number Date Country
1671092 Sep 2005 CN
1864346 Nov 2006 CN
101854223 Oct 2010 CN
101820288 Jan 2013 CN
1926267 May 2008 EP
2003163612 Jun 2003 JP
4394755 Oct 2009 JP
2005002162 Jan 2005 WO
2005032000 Apr 2005 WO
2009084121 Jul 2009 WO
2010031824 Mar 2010 WO
2019241081 Dec 2019 WO
Non-Patent Literature Citations (23)
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).
Belogolovy, A. , et al., “Forward Error Correction for 10GBASE-KR PHY”, IEEE 802.3ap-00/0000r4, Nov. 2005, 1-13 (13 pagges.
Ben-Neticha, Zouhair , et al., “The “Stretched”—Golay and Other Codes for High-SNR Finite-Delay Quantization of the Gaussian Source at ½ Bit Per Sample”, IEEE Transactions on Communications, New York, US, vol. 38, No. 12, XP000203339, Dec. 1990, 2089-2093 (5 pages).
Burr, A.G. , “Spherical Codes for M-ARY Code Shift Keying”, Second IEE National Conference on Telecommunications, University of York, UK, Apr. 2, 1989, 67-72 (6 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).
Ericson, Thomas , et al., “Spherical Codes Generated by Binary Partitions of Symmetric Pointsets”, IEEE Transactions on Information Theory, vol. 41, No. 1, Jan. 1995, 107-129 (23 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
20220321255 A1 Oct 2022 US
Provisional Applications (1)
Number Date Country
62530809 Jul 2017 US
Continuations (2)
Number Date Country
Parent 16909525 Jun 2020 US
Child 17845638 US
Parent 16031877 Jul 2018 US
Child 16909525 US