Methods and systems for pin-efficient memory controller interface using vector signaling codes for chip-to-chip communication

Information

  • Patent Grant
  • 10468078
  • Patent Number
    10,468,078
  • Date Filed
    Friday, March 24, 2017
    7 years ago
  • Date Issued
    Tuesday, November 5, 2019
    4 years ago
Abstract
Systems and methods are described for transmitting data over physical channels to provide a high speed, low latency interface such as between a memory controller and memory devices. Controller-side and memory-side embodiments of such channel interfaces are disclosed which require a low pin count and have low power utilization. In some embodiments of the invention, different voltage, current, etc. levels are used for signaling and more than two levels may be used, such as a vector signaling code wherein each wire signal may take on one of four signal values.
Description
BACKGROUND

In communication systems, information may be transmitted from one physical location to another. Furthermore, it is typically desirable that the transport of this information is reliable, is fast and consumes a minimal amount of resources. One of the most common information transfer mediums 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 circuits used in relation to each other. An example of the latter utilizes differential signaling (DS). Differential signaling operates by sending a signal on one wire and the opposite of that signal on a paired wire; the signal information is represented by the difference between the wires rather than their absolute values relative to ground or other fixed reference.


Differential signaling enhances the recoverability of the original signal at the receiver, over single ended signaling (SES), by cancelling crosstalk and other common-mode noise, but a side benefit of the technique is that the Simultaneous Switching Noise (SSN) transients generated by the two signals together is nearly zero; if both outputs are presented with an identical load, the transmit demand on its power supply will be constant, regardless of the data being sent. Any induced currents produced by terminating the differential lines in the receiver will similarly cancel out, minimizing noise induction into the receiving system.


There are a number of signaling methods that maintain the desirable properties of DS while increasing pin-efficiency over DS. Many of these attempts operate on more than two wires simultaneously, using binary signals on each wire, but mapping information in groups of bits.


Vector signaling is a method of signaling. With vector signaling, pluralities of signals on a plurality of wires are considered collectively although each of the plurality of signals may be independent. Each of the collective signals is referred to as a component and the number of plurality of wires is referred to as the “dimension” of the vector. In some embodiments, the signal on one wire is entirely dependent on the signal on another wire, as is the case with DS pairs, so in some cases the dimension of the vector may refer to the number of degrees of freedom of signals on the plurality of wires instead of the number of wires in the plurality of wires.


With binary vector signaling, each component takes on a coordinate value (or “coordinate”, for short) that is one of two possible values. As an example, eight SES wires may be considered collectively, with each component/wire taking on one of two values each signal period. A “code word” of this binary vector signaling is one of the possible states of that collective set of components/wires. A “vector signaling code” or “vector signaling vector set” is the collection of valid possible code words for a given vector signaling encoding scheme. A “binary vector signaling code” refers to a mapping and/or set of rules to map information bits to binary vectors.


With non-binary vector signaling, each component has a coordinate value that is a selection from a set of more than two possible values. A “non-binary vector signaling code” refers to a mapping and/or set of rules to map information bits to non-binary vectors.


Examples of vector signaling methods are described in Cronie I, Cronie II, Cronie III, and Cronie IV.


BRIEF SUMMARY

In accordance with at least one embodiment of the invention, processes and apparatuses provide for transmitting data over physical channels to provide a high speed, low latency interface such as between a memory controller and memory devices, requiring low pin count and providing low power utilization. Controller-side and memory-side embodiments of such channel interfaces are disclosed. In some embodiments of the invention, different voltage, current, etc. levels are used for signaling and more than two levels may be used, such as a ternary vector signaling code wherein each wire signal has one of three values.


This Brief Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Brief Summary is not intended to identify key or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter. Other objects and/or advantages of the present invention will be apparent to one of ordinary skill in the art upon review of the Detailed Description and the included drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments in accordance with the present disclosure will be described with reference to the drawings. Same numbers are used throughout the disclosure and figures to reference like components and features.



FIG. 1 is a block diagram of an example system comprised of a controller, host interface, memory interface, and memory, in accordance with at least one embodiment of the invention.



FIG. 2 is a block diagram detailing the controller side of the controller-to-memory interface, in accordance with at least one embodiment of the invention.



FIG. 3 is a timing diagram for the controller-to-memory interface packet start timing from the aspect of the memory controller, in accordance with at least one embodiment of the invention.



FIG. 4 is a block diagram detailing the memory side of the controller-to-memory interface, in accordance with at least one embodiment of the invention.



FIG. 5 is a timing diagram for the controller-to-memory packet start timing from the aspect of the memory device, in accordance with at least one embodiment of the invention.



FIG. 6 describes a use of the Kandou H4 Line Code as part of a communications protocol in accordance with at least one embodiment of the invention.



FIG. 7 illustrates a block diagram of a Gearbox, in accordance with some embodiments.





DETAILED DESCRIPTION

Specialized memory subsystems of modern computer systems utilize dedicated memory controllers to manage access, optimize performance, and improve utilization and reliability. Interconnections between these memory controllers and memory devices must operate at high speeds, delivering reliable and low latency data transfers, while under significant constraints in terms of available pin count and power utilization. Moreover, the design for interfaces to such interconnections is further constrained by implementation requirements, as controller devices are typically implemented using high speed logic processes, while memory devices such as DRAM rely on specialized processes optimized for high storage density and low leakage, but possibly not for fast logic speed. Thus, a successful memory-to-controller interconnection architecture must support implementation in multiple semiconductor processes.


In accordance with at least one embodiment of the invention, this disclosure describes a PHY (Physical Layer interface) and a Link Layer interface for both the controller and memory sides of such an interconnection, without presumption of limitation to the single embodiment provided as a descriptive example. Similarly, a packet format for communication of addressing, data transfer, and control operations using such an interconnection and interfaces is described, as one descriptive use example of a low-latency, pin- and power-efficient embodiment of the invention.


For purposes of description, this document uses the name “Bee” to describe this controller-to-memory interconnection system and/or a device embodying an interface for such interconnection. Without loss of generality, the physical interface between memory controller and memory device is herein described as utilizing point-to-point wire connections between integrated circuit devices, optionally including multidrop bussed interconnection of multiple memory devices and a single controller. Other embodiments of the invention may utilize other physical interfaces, including optical, inductive, capacitive, or electrical interconnection, and/or having more complex connection topologies.



FIG. 2 is a block diagram detailing the controller side of the controller-to-memory interface, in accordance with at least one embodiment of the invention.


The Bee Controller side is composed of the Bee_C_Link link layer interface and the Bee_C_PHY physical layer interface. FIG. 2 is a block diagram detailing the controller side of the controller-to-memory interface, in accordance with at least one embodiment of the invention.


The Bee_C_PHY Hard IP packet physical layer interface is implemented in a 60 nm (or so) process and is a low power ensemble coded interface that can deliver 1.5 GB/s in each direction throughput over six high-speed physical wires: four bidirectional data wires and two clock wires. It is optimized for low power. In one embodiment, the interface is a four-wire H4 ensemble mode delivering a 3b4w interface, including six high speed wires total including a differential clock. The interface uses 33% transmitted line power as compared to differential signaling scheme and operates at 4 Gbaud/sec symbol rate, and providing either 1 GB/s or 1.5 GB/s throughput in each direction. In some embodiments, the interface has 3.6 mw/Gbps (43.6 mw) worst case power dissipation (12 Gb/s), and is configured to have 0.50 mm square footprint for interface elements in integrated circuit design. The device interfaces to 1-4 memory devices and connects to the link layer interface (Bee_C_LINK). It may be configured with a 24 bit parallel interface from Bee_C_LINK to PHY and use Command and Address multiplexing implemented in Bee_C_LINK.


In some embodiments, the Package and Channel either does not use equalization or utilizes simple equalization. In general, no skew tolerance circuits required, and a 50 mm FR4 trace maximum channel length may be used. Some embodiments utilize in-package MCM. The interfaces are wire-bond compatible, and may have a tileable layout to allow additional memory interfaces to be implemented on the controller. The pin-out may be chosen to minimize EMI.


In some embodiments, the transmitter sends a half rate clock at either 1.33 GHz or 2 GHz, and data is sent to be aligned to center of rising clock edge, thus no clock and data recovery (CDR) circuit is needed in the RAM. The transmitter slew rate is controlled. The device accepts transaction start and end interface signals from Bee_C_LINK and the device selection may also be input from Bee_C_LINK. In some embodiments, there is a Gearbox selector from the 24 bit system interface to the 3 bit encoder input. The transmitter also encodes a 3-bit input plus start input into a H4 symbol. FIG. 7 illustrates an exemplary encoder that may be included in the Gearbox. As shown in FIG. 7, a Gearbox 720 may make use of a Hadamard matrix H of size n=4. The input 705 of the transformer includes n−1=3 signals which enter the balancer 710. The output of the balancer 710 includes n=4 signals which enter the encoder 715. A task of the encoder 715 is to perform the multiplication of the Hadamard matrix H with the vector of n=4 signals leaving the balancer 710. The output of the encoder 715 corresponds to the vector that is formed by multiplying H with the vector of signals leaving the balancer 710. The output of the encoder 715 is fed to the signal path driver drivers 725 which possibly perform additional amplification and/or filtering. The transmitter may drive four single ended chip select signals at half speed, and is configured in some embodiments to drive the H_IDLE H4 symbol before the chip select is asserted and then the H_START H4 symbol after the chip select is asserted.


The receiver may be configured with on-die channel termination, and the application of the termination may be determined by the statically wired external pin. In some embodiments, the Bee_C_LINK delivers the receive transaction timing to the PHY, and the Bee_C_LINK delivers the device selection. Further, the decoder may be configured to transform H4 symbols into tri-bits plus the start symbol. The Gearbox transforms the tri-bits plus the start and end packet indications into a 24-bit interface to Bee_C_LINK. Some embodiments may include a Phase aligner aligned via a boot-time routine. The receiver may have low power consumption when all input wires are at the common mode.


Power Management functions may include (i) power-down by removal of power from entire memory device; (ii) power-up transition is not very fast (milliseconds); (iii) standby-Active transitions controlled by input from the controller; and/or (v) additional moderate power standby mode.


Manufacturing aspects may include (i) marginable manufacturing loopback BERT test that is useful in-system between Bee devices; (ii) JTAG 1149.6 boundary and internal scan; (iii) 1 KV HBM and 250 V CDM ESD tolerance; and/or (iv) capable of being fully characterized & extended life tested post-silicon.



FIG. 3 is a timing diagram for the controller-to-memory interface packet start timing from the aspect of the memory controller, in accordance with at least one embodiment of the invention.


The Bee_C_PLL Hard IP packet physical layer interface is implemented in a 60 nm (or so) process. It is optimized for low power. The phase locked loop (PLL) may be configured as a 22 mw shareable PLL with 100 MHz input and 2 GHz multi-phase output. In some embodiments the PLL may be shared amongst multiple interfaces and/or may be integrated with other device functions.


The Bee_C_Link Hard IP physical layer interface is implemented in a 60 nm (or so) process that multiplexes and times the data for the Bee_C_PHY. It is optimized for low power. It may be configured to connect to a RAM controller containing an AXI bus controller. It also connects to the Bee_C_PHY.


System-side Transmit accepts full memory transactions from the memory controller and formats those transactions into Kandou Memory Link (KML) packets. The interface is configured to interoperate with at least a subset of the OFNI command set to operate the bi-directional request-response data bus. It may be configured to postpends a link CRC, and also to drive those packets into a FIFO along with the start and end of packet information. The interface may manage the Tx FIFO occupancy by pessimistically back-pressuring the bus interface taking into account the input from the receive side. In some embodiments, the interface implements a link layer retry protocol, at the cost of increased latency.


The PHY-side transmit includes a 24 bit interface out of the FIFO to the Bee_C_PHY, and also drives the start and end of packet timing into the gearbox in the Bee_C_PHY.


The PHY-side receive circuit provides the timing windows for the Bee_C_PHY to look for the H_START packet indication, and also provides the Bee_C_PHY and end of packet signal derived from the P Length field. The receive circuit also accepts a 24 bit input from the interface from Bee_C_PHY and drives it into the FIFO. It may be configured to use cut-thru operations for low latency. The receiver may also check the link CRC and writes the results into the FIFO.


The system-side receive circuit may be configured to manage the Rx FIFO occupancy by pessimistically back-pressuring the Tx side bus interface taking into account both the Rx-FIFO needs of incoming transactions and the existing Rx-FIFO occupancy. It may also be configured to perform response matching of returned packets and handling link layer packets via a non-FIFO path. The receiver circuit also formats the KML responses back into memory transactions suitable for input to the AXI bus controller. In some embodiments, it may also implement a link layer retry protocol, at the cost of latency.


The Bee RAM side comprises the Bee_M_PHY physical layer interface and the Bee_M_Link.link layer interface. FIG. 4 is a block diagram detailing the memory side of this controller-to-memory system, in accordance with at least one embodiment of the invention.


The matching Bee_M_PHY Hard IP (RAM Side) packet physical layer interface is implemented in a DRAM-optimized process that is equivalent to a 100 to 130 nm CMOS process (1 to 1.2 V Vdd), is low power, and uses one of Kandou's vector signaling codes. It is optimized for low power. The differences from the controller-side interface include the following.


Some embodiments may include an additional processor interface accessible from the link. It may be configured to connect to link layer IP (Bee_M_LINK). It may be configured to consume 6.4 mw/Gbps (76.9 mw) worst case power dissipation (12 Gb/s), and be implemented with a 0.95 mm square of implementation footprint for interface elements in DRAM integrated circuit design. The transmitter sends data on each rising edge of the received clock, and the transmitter slew rate is controlled. Multi-drop support is provided via the combination of the chip select assertion and the enumeration. The H_IDLE signal line is driven within a fixed interval after chip select assertion qualified with the enumeration, while the H_START signal line is driven within a fixed interval after the H_IDLE signal line is driven. The Bee_M_LINK delivers a 24 bit interface to the PHY and provides transaction timing to PHY. In some embodiments, it is configured in accordance with a 4:1 parallel implementation.


The Receiver is configured with on-die termination, and a statically wired external pin determines whether termination is applied. In some embodiments, no PLL or CDR is required, as it is configured with DDR forwarded differential clock. When the chip select is asserted, the PHY circuit is configured to finds the H_IDLE and H_START H4 symbols. The decoder transforms H4 symbols into tri-bits plus the start symbol. In addition, the Gearbox transforms the tri-bits plus the start symbol into a 24-bit interface to Bee_M_LINK. The circuit is configured for low power consumption when all input wires are floating at the common mode, and may include a 1:4 parallel implementation.


Power management functions may include (i) power down by removal of power and/or (ii) fast resumption low power standby mode with the state of the wires controlled, rapid detection and indication of activity on the clock, and standby-active transitions via a state machine based on the clock activity.


Manufacturing aspects include (i) marginable manufacturing loopback BERT test that is useful in-system between Bee devices; (ii) JTAG 1149.6 boundary and internal scan; (iii) 1 KV HBM and 250 V CDM ESD tolerance; and (iv) fully characterized and extended life tested post-silicon.



FIG. 5 is a timing diagram for the controller-to-memory packet start timing from the aspect of the memory device, in accordance with at least one embodiment of the invention.


The Bee_M_Link Hard IP physical layer interface is, in some embodiments, implemented in a 60 nm process that multiplexes and times the data for the Bee_M_PHY. It is optimized for low power. The interface connects to the Bee_M_PHY and to the memory controller inside of the RAM.


The PHY-side receive circuit provides the timing windows for the Bee_M_PHY to look for the H_START packet indication and provides the Bee_M_PHY and end of packet signal derived from the P Length field. It may be configured to accept a 24 bit input from the interface from Bee_M_PHY and drives it into the FIFO, and may use cut-thru operation for low latency. The receive circuit writes the results of the CRC calculation after the packet into the FIFO.


The memory-side receiver circuit manages the 24 bit wide Rx FIFO occupancy by pessimistically back-pressuring the Tx side bus interface taking into account Rx-FIFO needs of incoming transactions and the existing Rx-FIFO occupancy. The receiver also: (i) performs response matching of returned packets; (ii) handles link layer packets via a non-FIFO path; (iii) formats the KML responses back into bus transactions suitable for handling by the memory controller; and/or (iv) implements a link layer retry protocol, at the cost of increased latency.


The memory-side transmit circuit is configured to (i) accept full bus transactions from the memory controller; (ii) format those transactions into Kandou Memory Link (KML) packets; (iii) is compatible with the OFNI command set to operate the bi-directional request-response data bus; (iv) prepends a fixed link layer preamble; (v) postpends a link CRC; (vi) drives those packets into a 24 bit wide FIFO along with the start and end of packet information; (vii) manages the Tx FIFO occupancy by pessimistically back-pressuring the bus interface taking into account the input from the receive side; and in some embodiments implements a link layer retry protocol, at the cost of increased latency.


The PHY-side transmit circuit drives a 24 bit wide interface out of the FIFO to the Bee_M_PHY and drives the start and end of packet timing into the gearbox in the Bee_M_PHY.


The enumeration function automatically enumerates a daisy chain of memory devices using the ENi and ENo pins to extend the addressability of the chip selects as per the OFNI specification or an extension of that specification.


A gearbox according to present embodiments can be succinctly described in terms of a class of matrices known to those of skill in the art as Hadamard matrices. A Hadamard matrix of size n is a square matrix of size n which contains as entries either +1 or −1, and for which any two different rows are orthogonal. A square matrix in which different rows are orthonormal is known as an orthogonal matrix in the literature. Therefore, a Hadamard matrix with normalized rows and columns is an orthogonal matrix. In what follows, the term “Hadamard matrix” may be read as “Hadamard matrix with normalized rows and/or columns” unless clearly contradicted by context. FIG. 6 describes a use of the Kandou H4 Line Code as part of a communications protocol in accordance with at least one embodiment of the invention. KH4C is a 3b4w (3 bits over 4 wires) code appropriate for narrow high performance interfaces. The H4 code is generated using a size n=4 Hadamard matrix. It is a balanced code of four symbols per codeword, one symbol taking on the value +1 or −1, with the remaining three symbols taking on the value −⅓ or +⅓, respectively.


Another embodiment of the invention supports a 3b5w (3-bits conveyed over 5 wires) code where each data value may be encoded as either of two equivalent codewords. Alternation of such equivalent codewords provides an effective return clock, making receipt of a sequence of such code words self-clocking. Another embodiment provides two additional clock lines that a selected memory device uses to reflect its received clock back to the controller, similarly providing synchronization of symbols transmitted in the memory-to-controller direction.


The following is a description of the Kandou Memory Link (KML) protocol, in accordance with at least one embodiment of the invention. KML is a protocol appropriate for a high-speed, narrow interface to a memory device. It supports variable-size block write and block read operations at arbitrary start addresses, with data transfer integrity verified using a cyclic-redundancy check code. The protocol may also optionally support access to link-level command/information packets for use by additional control and monitoring applications.


The memory side send a response packet or a link layer packet.


In the memory to controller direction, a 1 symbol preamble is added: H_START.


In the controller to memory direction, a 1 symbol preamble is added: H_START.


Write Packets






    • P_Command—8 bits

    • P_SeqNum—4 bits (TBD—if retry)

    • P_Tag—4 bits

    • P_Address—32 bit

    • P_Length—8 bits

    • P_Data—8 to 2048 bits

    • P_CRC—8 to 32 bits


      Read Request Packets

    • P_Command—8 bits

    • P_SeqNum—4 bits (TBD—if retry)

    • P_Tag—4 bits

    • P_Address—32 bit

    • P_Length—8 bits

    • P_CRC—8 to 32 bits


      Response Packets

    • P_Command—8 bits

    • P_SeqNum—4 bits (TBD—if retry)

    • P_Tag—4 bits

    • P_Length—8 bits

    • P_Data—8 to 2048 bits

    • P_CRC—8 to 32 bits


      Link Layer Packets (for some embodiments)

    • P_Command—8 bits

    • P_Info—16 bits

    • P_CRC—8 to 32 bits





In one embodiment, a collection of interconnection signal lines; a memory-controller interface circuit; a link layer signaling protocol control circuit; a physical layer signaling protocol control circuit that maps symbols of a vector signaling code to the collection of interconnection signal lines and provides timing information for symbol communication, wherein the link layer signaling protocol circuit provides bidirectional address and data transmission to the memory controller interface circuit. The collection of interconnection signal lines may take the form of four bidirectional data lines and two clock lines. In a further embodiment, the physical layer signaling protocol control circuit communicates three data bits over the four data lines using a balanced code of symbols having four distinct signal levels. The collection of interconnection signal lines may additionally comprise two clock lines carrying a return clock signal to the controller device. In yet a further embodiment, the collection of interconnection lines comprises five bidirectional data lines and two clock lines. In a further embodiment, the physical layer signaling protocol control circuit may communicate three data bits over five lines, and the link layer protocol circuit is self-clocking in the memory-to-controller direction.


In a further embodiment, a method comprises: transmitting messages from a memory controller using a vector signaling code, the messages selected from the group consisting of a memory write, a memory read, and a status interrogation command; receiving a response message in the form of one or more vector signaling codes, the response message selected from the group consisting of a memory write complete, a memory read result, a status response, and an error report message, wherein each transmitted message and received response message comprises a series of vector signaling code words, each code word communicated as symbols carried as physical signals on a set of lines, and wherein consecutive code words of each message is synchronized by a symbol clock also carried as physical signals on the set of lines. The memory write and memory read operations may be configured to access a contiguous block of memory of a specified size at a specified memory address. The set of lines in one embodiment comprises four bidirectional data lines and two unidirectional symbol clock lines. In a further embodiment, the vector signaling code communicates three binary bits on four lines using a balanced code of four levels. In other embodiments, the series of vector signaling words corresponding to the response message is self-clocking. The self-clocking may be obtained by receipt of a physical clock signal at the memory controller. The self-clocking may be obtained by alternation of redundant code words of the vector signaling code representing the same data value.

Claims
  • 1. A method comprising: obtaining memory transaction data at a link layer memory interface, and responsively forming a high-speed memory link packet having a set of multi-bit words;storing each multi-bit word of the high-speed memory link packet as an entry in a first-in-first-out (FIFO) buffer;obtaining, at an orthogonal signaling physical layer, a multi-bit word from the FIFO buffer, and consecutively encoding portions of the obtained multi-bit word into data codewords of an H4 balanced vector signaling code, wherein each data codeword comprises four symbols, one symbol having a value ±1 and a remaining three symbols having a value ∓⅓, respectively;transmitting a pre-designated packet start codeword of the balanced vector signaling code via high-speed data wires of a multi-wire bus; andtransmitting each data codeword via the high-speed data wires of the multi-wire bus.
  • 2. The method of claim 1, further comprising formulating link layer packets at a first link layer controller for transmission over the orthogonal signaling physical layer to a second link layer controller.
  • 3. The method of claim 1, further comprising transmitting chip-select signals via chips-select wires of the multi-wire bus.
  • 4. The method of claim 1, further comprising transmitting a clock signal over a pair of high-speed clock wires of the multi-wire bus.
  • 5. The method of claim 1, further comprising transmitting a pre-designated idle codeword prior to transmitting the pre-designated packet start codeword.
  • 6. The method of claim 1, wherein the high-speed memory link packet is one of a memory write packet and a memory read request packet.
  • 7. The method of claim 1, wherein the high-speed memory link packet is a memory read result packet.
  • 8. The method of claim 1, wherein packet start and packet end timing is further obtained at the physical layer from the link layer memory interface.
  • 9. An apparatus comprising: a link layer memory interface configured to obtain memory transaction data, to responsively form a high-speed memory link packet having a set of multi-bit words, and to store each multi-bit word of the high-speed memory link packet as an entry in a first-in-first-out (FIFO) buffer; andan orthogonal signaling physical layer configured to: obtain a multi-bit word from the FIFO buffer, and to consecutively encode portions of the obtained multi-bit word into data codewords of an H4 balanced vector signaling code, wherein each data codeword comprises four symbols, one symbol having a value ±1 and a remaining three symbols having a value ∓⅓, respectively;transmit a pre-designated packet start codeword of the balanced vector signaling code via high-speed data wires of a multi-wire bus; andtransmit each data codeword via the high-speed data wires of the multi-wire bus.
  • 10. The apparatus of claim 9, wherein the link layer is configured to formulate link layer packets at a first link layer controller for transmission over the orthogonal signaling physical layer to a second link layer controller.
  • 11. The apparatus of claim 9, wherein the orthogonal signaling physical layer is further configured to transmit chip-select signals via chips-select wires of the multi-wire bus.
  • 12. The apparatus of claim 9, wherein the orthogonal signaling physical layer is further configured to transmit a clock signal over a pair of high-speed clock wires of the multi-wire bus.
  • 13. The apparatus of claim 9, wherein the orthogonal signaling physical layer is further configured to transmit a pre-designated idle codeword prior to transmitting the pre-designated packet start codeword.
  • 14. The apparatus of claim 9, wherein the high-speed memory link packet is one of a memory write packet and a memory read request packet.
  • 15. The apparatus of claim 9, wherein the high-speed memory link packet is a memory read result packet.
  • 16. The apparatus of claim 9, wherein the physical layer is further configured to obtain packet start and packet end timing from the link layer memory interface.
CROSS REFERENCES

This application is a Continuation of U.S. application Ser. No. 14/974,698, filed Dec. 18, 2015, entitled “Methods and Systems for Pin-Efficient Memory Controller Interface using Vector Signaling Codes for Chip-to-Chip Communication,” which is a continuation of U.S. application Ser. No. 14/108,316, filed Dec. 16, 2013, entitled “Methods and Systems for Pin-Efficient Memory Controller Interface using Vector Signaling Codes for Chip-to-Chip Communication,” which is a non-provisional application claiming priority under 35 USC § 119 to U.S. Provisional Application No. 61/738,329, filed Dec. 17, 2012, entitled “Methods And Systems For Pin-Efficient Memory Controller Interface Using Vector Signaling Codes For Chip-To-Chip Communication,” all of which are hereby incorporated herein by reference. The following references are herein incorporated by reference in their entirety for all purposes: U.S. Patent Publication 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 “Cronie I”); U.S. Patent Publication 2011/0302478 of U.S. patent application Ser. No. 12/982,777, filed Dec. 30, 2010, naming Harm Cronie and Amin Shokrollahi, entitled “Power and Pin Efficient Chip-to-Chip Communications with Common-Mode Resilience and SSO Resilience” (hereinafter “Cronie II”); U.S. patent application Ser. No. 13/030,027, filed Feb. 17, 2011, naming Harm Cronie, Amin Shokrollahi and Armin Tajalli, entitled “Methods and Systems for Noise Resilient, Pin-Efficient and Low Power Communications with Sparse Signaling Codes” (hereinafter “Cronie III”); and U.S. patent application Ser. No. 13/463,742, filed May 3, 2012, naming Harm Cronie and Amin Shokrollahi, entitled “Finite State Encoders and Decoders for Vector Signaling Codes” (hereafter called “Cronie IV”). U.S. patent application Ser. No. 13/603,107, filed Sep. 9, 2012, naming Brian Holden and Amin Shokrollahi, entitled “Methods and Systems for Selection of Unions of Vector Signaling Codes for Power and Pin Efficient Chip-To-Chip Communication” (hereinafter called “Holden I”). U.S. patent application Ser. No. 13/671,426, filed Nov. 7, 2012, naming Brian Holden and Amin Shokrollahi, entitled “Crossbar Switch Decoder for Vector Signaling Codes” (hereinafter called “Holden II”).

US Referenced Citations (501)
Number Name Date Kind
668687 Mayer Feb 1901 A
780883 Hinchman Jan 1905 A
3196351 Slepian Jul 1965 A
3636463 Ongkiehong Jan 1972 A
3939468 Mastin Feb 1976 A
3970795 Allen Jul 1976 A
4163258 Ebihara Jul 1979 A
4181967 Nash Jan 1980 A
4206316 Burnsweig Jun 1980 A
4276543 Miller Jun 1981 A
4486739 Franaszek Dec 1984 A
4499550 Ray Feb 1985 A
4722084 Morton Jan 1988 A
4772845 Scott Sep 1988 A
4774498 Traa Sep 1988 A
4864303 Ofek Sep 1989 A
4897657 Brubaker Jan 1990 A
4974211 Corl Nov 1990 A
5017924 Guiberteau May 1991 A
5053974 Penz Oct 1991 A
5150384 Cahill Sep 1992 A
5166956 Baltus Nov 1992 A
5168509 Nakamura Dec 1992 A
5266907 Dacus Nov 1993 A
5283761 Gillingham Feb 1994 A
5287305 Yoshida Feb 1994 A
5311516 Kuznicki et al. May 1994 A
5331320 Cideciyan Jul 1994 A
5412689 Chan May 1995 A
5449895 Hecht Sep 1995 A
5459465 Kagey Oct 1995 A
5461379 Weinman Oct 1995 A
5510736 Van De Plassche Apr 1996 A
5511119 Lechleider Apr 1996 A
5553097 Dagher Sep 1996 A
5566193 Cloonan Oct 1996 A
5599550 Kohlruss Feb 1997 A
5626651 Dullien May 1997 A
5629651 Mizuno May 1997 A
5659353 Kostreski Aug 1997 A
5689509 Gaytan Nov 1997 A
5727006 Dreyer Mar 1998 A
5748948 Yu May 1998 A
5802356 Gaskins Sep 1998 A
5825808 Hershey Oct 1998 A
5856935 Moy Jan 1999 A
5875202 Venters Feb 1999 A
5889981 Betker Mar 1999 A
5945935 Kusumoto Aug 1999 A
5949060 Schattschneider Sep 1999 A
5982954 Delen Nov 1999 A
5995016 Perino Nov 1999 A
5999016 McClintock Dec 1999 A
6005895 Perino Dec 1999 A
6084883 Norrell Jul 2000 A
6084958 Blossom Jul 2000 A
6097732 Jung Aug 2000 A
6119263 Mowbray Sep 2000 A
6154498 Dabral Nov 2000 A
6172634 Leonowich Jan 2001 B1
6175230 Hamblin Jan 2001 B1
6226330 Mansur May 2001 B1
6232908 Nakaigawa May 2001 B1
6242321 Acosta et al. Jun 2001 B1
6278740 Nordyke Aug 2001 B1
6316987 Daily Nov 2001 B1
6317465 Akamatsu Nov 2001 B1
6346907 Dacy Feb 2002 B1
6359931 Perino Mar 2002 B1
6378073 Davis Apr 2002 B1
6384758 Michalski May 2002 B1
6398359 Silverbrook Jun 2002 B1
6404820 Postol Jun 2002 B1
6417737 Moloudi Jul 2002 B1
6424630 Ang Jul 2002 B1
6433800 Holtz Aug 2002 B1
6452420 Wong Sep 2002 B1
6473877 Sharma Oct 2002 B1
6483828 Balachandran Nov 2002 B1
6504875 Perino Jan 2003 B2
6509773 Buchwald Jan 2003 B2
6522699 Anderson Feb 2003 B1
6556628 Poulton Apr 2003 B1
6563382 Yang May 2003 B1
6621427 Greenstreet Sep 2003 B2
6621945 Bissessur Sep 2003 B2
6624699 Yin Sep 2003 B2
6650638 Walker Nov 2003 B1
6661355 Cornelius Dec 2003 B2
6664355 Kim Dec 2003 B2
6686879 Shattil Feb 2004 B2
6690739 Mui Feb 2004 B1
6766342 Kechriotis Jul 2004 B2
6772351 Werner Aug 2004 B1
6839429 Gaikwad Jan 2005 B1
6839587 Yonce Jan 2005 B2
6854030 Perino Feb 2005 B2
6865234 Agazzi Mar 2005 B1
6865236 Terry Mar 2005 B1
6876317 Sankaran Apr 2005 B2
6898724 Chang May 2005 B2
6927709 Kiehl Aug 2005 B2
6954492 Williams Oct 2005 B1
6963622 Eroz Nov 2005 B2
6972701 Jansson Dec 2005 B2
6973613 Cypher Dec 2005 B2
6976194 Cypher Dec 2005 B2
6982954 Dhong Jan 2006 B2
6990138 Bejjani Jan 2006 B2
6991038 Guesnon Jan 2006 B2
6993311 Li Jan 2006 B2
6999516 Rajan Feb 2006 B1
7023817 Kuffner Apr 2006 B2
7038486 Aoyama May 2006 B2
7039136 Olson May 2006 B2
7053802 Cornelius May 2006 B2
7075996 Simon Jul 2006 B2
7080288 Ferraiolo Jul 2006 B2
7082557 Schauer Jul 2006 B2
7085153 Ferrant Aug 2006 B2
7085336 Lee Aug 2006 B2
7127003 Rajan Oct 2006 B2
7130944 Perino Oct 2006 B2
7142012 Horowitz Nov 2006 B2
7142612 Horowitz Nov 2006 B2
7142865 Tsai Nov 2006 B2
7164631 Tateishi Jan 2007 B2
7167019 Broyde Jan 2007 B2
7176823 Zabroda Feb 2007 B2
7180949 Kleveland Feb 2007 B2
7184483 Rajan Feb 2007 B2
7199728 Dally Apr 2007 B2
7231558 Gentieu Jun 2007 B2
7269130 Pitio Sep 2007 B2
7269212 Chau Sep 2007 B1
7335976 Chen Feb 2008 B2
7336112 Sha Feb 2008 B1
7339990 Hidaka Mar 2008 B2
7346819 Bansal Mar 2008 B2
7348989 Stevens Mar 2008 B2
7349484 Stojanovic Mar 2008 B2
7356213 Cunningham Apr 2008 B1
7358869 Chiarulli Apr 2008 B1
7362130 Broyde Apr 2008 B2
7362697 Becker Apr 2008 B2
7366942 Lee Apr 2008 B2
7370264 Worley May 2008 B2
7372390 Yamada May 2008 B2
7389333 Moore Jun 2008 B2
7397302 Bardsley Jul 2008 B2
7400276 Sotiriadis Jul 2008 B1
7428273 Foster Sep 2008 B2
7456778 Werner Nov 2008 B2
7462956 Lan Dec 2008 B2
7495162 Srebranig Feb 2009 B1
7496162 Srebranig Feb 2009 B2
7570704 Nagarajan Apr 2009 B2
7535957 Ozawa May 2009 B2
7539532 Tran May 2009 B2
7583209 Duan Sep 2009 B1
7599390 Pamarti Oct 2009 B2
7613234 Raghavan Nov 2009 B2
7616075 Kushiyama Nov 2009 B2
7620116 Bessios Nov 2009 B2
7633850 Ahn Dec 2009 B2
7639596 Cioffi Dec 2009 B2
7643588 Visalli Jan 2010 B2
7650525 Chang Jan 2010 B1
7656321 Wang Feb 2010 B2
7694204 Schmidt Apr 2010 B2
7697915 Behzad Apr 2010 B2
7698088 Sul Apr 2010 B2
7706456 Laroia Apr 2010 B2
7706524 Zerbe Apr 2010 B2
7746764 Rawlins Jun 2010 B2
7768312 Yukitoshi Aug 2010 B2
7787572 Scharf Aug 2010 B2
7804361 Lim Sep 2010 B2
7808456 Chen Oct 2010 B2
7808830 Kasuta Oct 2010 B2
7808883 Green Oct 2010 B2
7826551 Lee Nov 2010 B2
7841909 Murray Nov 2010 B2
7859356 Pandey Dec 2010 B2
7868790 Bae Jan 2011 B2
7869497 Benvenuto Jan 2011 B2
7869546 Tsai Jan 2011 B2
7882413 Chen Feb 2011 B2
7899653 Hollis Mar 2011 B2
7907676 Stojanovic Mar 2011 B2
7933770 Kruger Apr 2011 B2
8000664 Khorram Aug 2011 B2
8030999 Chatterjee Oct 2011 B2
8036300 Evans Oct 2011 B2
8050332 Chung Nov 2011 B2
8055095 Palotai Nov 2011 B2
8064535 Wiley Nov 2011 B2
8085172 Li Dec 2011 B2
8091006 Prasad Jan 2012 B2
8106806 Toyomura Jan 2012 B2
8149906 Saito Apr 2012 B2
8159375 Abbesfer Apr 2012 B2
8159376 Abbasfar Apr 2012 B2
8180931 Lee May 2012 B2
8185807 Oh May 2012 B2
8199849 Oh Jun 2012 B2
8199863 Chen Jun 2012 B2
8218670 AbouRjeily Jul 2012 B2
8233544 Bao Jul 2012 B2
8245094 Jiang Aug 2012 B2
8245102 Cory Aug 2012 B1
8253454 Lin Aug 2012 B2
8279094 Abbasfar Oct 2012 B2
8279745 Dent Oct 2012 B2
8279976 Lin Oct 2012 B2
8284848 Nam Oct 2012 B2
8289914 Li Oct 2012 B2
8295250 Gorokhov Oct 2012 B2
8295336 Lutz Oct 2012 B2
8305247 Pun Nov 2012 B2
8310389 Chui Nov 2012 B1
8341492 Shen Dec 2012 B2
8359445 Ware Jan 2013 B2
8365035 Hara Jan 2013 B2
8406315 Tsai Mar 2013 B2
8406316 Sugita Mar 2013 B2
8429492 Yoon Apr 2013 B2
8429495 Przybylski Apr 2013 B2
8437440 Zhang May 2013 B1
8442099 Sederat May 2013 B1
8442210 Zerbe May 2013 B2
8443223 Abbasfar May 2013 B2
8451913 Oh May 2013 B2
8462891 Kizer Jun 2013 B2
8472513 Malipatil Jun 2013 B2
8620166 Dong Jun 2013 B2
8498344 Wilson Jul 2013 B2
8498368 Husted Jul 2013 B1
8520348 Dong Aug 2013 B2
8520493 Goulahsen Aug 2013 B2
8539318 Cronie Sep 2013 B2
8547272 Nestler Oct 2013 B2
8577284 Seo Nov 2013 B2
8578246 Mittelholzer Nov 2013 B2
8588254 Diab Nov 2013 B2
8588280 Oh Nov 2013 B2
8593305 Tajalli Nov 2013 B1
8602643 Gardiner Dec 2013 B2
8604879 Mourant Dec 2013 B2
8638241 Sudhakaran Jan 2014 B2
8643437 Chiu Feb 2014 B2
8644497 Clausen et al. Feb 2014 B2
8649445 Cronie Feb 2014 B2
8649460 Ware Feb 2014 B2
8649556 Wedge Feb 2014 B2
8649840 Sheppard, Jr. Feb 2014 B2
8674861 Matsuno Mar 2014 B2
8687968 Nosaka Apr 2014 B2
8711919 Kumar Apr 2014 B2
8718184 Cronie May 2014 B1
8755426 Cronie Jun 2014 B1
8773964 Hsueh Jul 2014 B2
8780687 Clausen et al. Jul 2014 B2
8782578 Tell Jul 2014 B2
8791735 Shibasaki Jul 2014 B1
8831440 Yu Sep 2014 B2
8841936 Nakamura Sep 2014 B2
8879660 Peng Nov 2014 B1
8897134 Kern Nov 2014 B2
8898504 Baumgartner Nov 2014 B2
8938171 Tang Jan 2015 B2
8949693 Ordentlich Feb 2015 B2
8951072 Hashim Feb 2015 B2
8975948 GonzalezDiaz Mar 2015 B2
8989317 Holden Mar 2015 B1
8996740 Wiley Mar 2015 B2
9015566 Cronie Apr 2015 B2
9020049 Schwager Apr 2015 B2
9036764 Hossain May 2015 B1
9059816 Simpson Jun 2015 B1
9069995 Cronie Jun 2015 B1
9071476 Fox et al. Jun 2015 B2
9077386 Holden Jul 2015 B1
9083576 Hormati Jul 2015 B1
9093791 Liang Jul 2015 B2
9100232 Hormati Aug 2015 B1
9106465 Walter Aug 2015 B2
9124557 Fox Sep 2015 B2
9148087 Tajalli Sep 2015 B1
9152495 Losh Oct 2015 B2
9165615 Amirkhany Oct 2015 B2
9172412 Kim Oct 2015 B2
9178503 Hsieh Nov 2015 B2
9183085 Northcott Nov 2015 B1
9197470 Okunev Nov 2015 B2
9231790 Wiley Jan 2016 B2
9246713 Shokrollahi Jan 2016 B2
9251873 Fox et al. Feb 2016 B1
9281785 Sjoland Mar 2016 B2
9288082 Ulrich Mar 2016 B1
9288089 Cronie Mar 2016 B2
9292716 Winoto Mar 2016 B2
9300503 Holden Mar 2016 B1
9306621 Zhang Apr 2016 B2
9331962 Lida May 2016 B2
9362974 Fox Jun 2016 B2
9363114 Shokrollahi Jun 2016 B2
9374250 Musah Jun 2016 B1
9401828 Cronie Jul 2016 B2
9432082 Ulrich Aug 2016 B2
9432298 Smith Aug 2016 B1
9444654 Hormati Sep 2016 B2
9455744 George Sep 2016 B2
9455765 Schumacher Sep 2016 B2
9461862 Holden Oct 2016 B2
9479369 Shokrollahi Oct 2016 B1
9509437 Shokrollahi Nov 2016 B2
9520883 Shibasaki Dec 2016 B2
9537644 Jones Jan 2017 B2
9544015 Ulrich Jan 2017 B2
9634797 Benammar Apr 2017 B2
9667379 Cronie May 2017 B2
9710412 Sengoku Jul 2017 B2
9852806 Stauffer Dec 2017 B2
9917711 Ulrich Mar 2018 B2
10055372 Shokrollahi Aug 2018 B2
20010006538 Simon Jul 2001 A1
20010055344 Lee Dec 2001 A1
20020034191 Shattil Mar 2002 A1
20020044316 Myers Apr 2002 A1
20020057592 Robb May 2002 A1
20020097791 Hansen Jul 2002 A1
20020152340 Dreps Oct 2002 A1
20020154633 Shin Oct 2002 A1
20020163881 Dhong Nov 2002 A1
20020167339 Chang Nov 2002 A1
20020174373 Chang Nov 2002 A1
20020181607 Izumi Dec 2002 A1
20030016763 Doi Jan 2003 A1
20030016770 Trans Jan 2003 A1
20030046618 Collins Mar 2003 A1
20030085763 Schrodinger May 2003 A1
20030086366 Branlund et al. May 2003 A1
20030117184 Fecteau Jun 2003 A1
20030146783 Bandy Aug 2003 A1
20030174023 Miyasita Sep 2003 A1
20030185310 Ketchum Oct 2003 A1
20030218558 Mulder Nov 2003 A1
20040027185 Fiedler Feb 2004 A1
20040057525 Rajan Mar 2004 A1
20040146117 Subramaniam Jul 2004 A1
20040155802 Lamy Aug 2004 A1
20040161019 Raghavan Aug 2004 A1
20040169529 Afghahi Sep 2004 A1
20040170231 Bessios Sep 2004 A1
20040239374 Hori Dec 2004 A1
20050027876 Umei Feb 2005 A1
20050063493 Foster Mar 2005 A1
20050134380 Naim Jun 2005 A1
20050174841 Ho Aug 2005 A1
20050195000 Parker Sep 2005 A1
20050201491 Wei Sep 2005 A1
20050213686 Love Sep 2005 A1
20050220182 Kuwata Oct 2005 A1
20050270098 Zhang Dec 2005 A1
20060013331 Choi Jan 2006 A1
20060036668 Jaussi Feb 2006 A1
20060097786 Su May 2006 A1
20060103463 Lee May 2006 A1
20060120486 Visalli Jun 2006 A1
20060126751 Bessios Jun 2006 A1
20060133538 Stojanovic Jun 2006 A1
20060140324 Casper Jun 2006 A1
20060159005 Rawlins Jul 2006 A1
20060233291 Garlepp Oct 2006 A1
20060236174 Whetsel Oct 2006 A1
20060291589 Eliezer et al. Dec 2006 A1
20070001723 Lin Jan 2007 A1
20070002954 Cornelius Jan 2007 A1
20070030796 Green Feb 2007 A1
20070103338 Teo May 2007 A1
20070121716 Nagarajan May 2007 A1
20070164883 Furtner Jul 2007 A1
20070182487 Ozasa Aug 2007 A1
20070201546 Lee Aug 2007 A1
20070204205 Niu Aug 2007 A1
20070263711 Kramer Nov 2007 A1
20070283210 Prasad Dec 2007 A1
20080007367 Kim Jan 2008 A1
20080012598 Mayer Jan 2008 A1
20080016432 Lablans Jan 2008 A1
20080104374 Mohamed May 2008 A1
20080159448 Anim-Appiah Jul 2008 A1
20080192621 Suehiro Aug 2008 A1
20080316070 Van et al. Dec 2008 A1
20080317188 Staszewski Dec 2008 A1
20090046009 Fujii Feb 2009 A1
20090059782 Cole Mar 2009 A1
20090115523 Akizuki May 2009 A1
20090150754 Dohmen Jun 2009 A1
20090154604 Lee Jun 2009 A1
20090195281 Tamura Aug 2009 A1
20090262876 Arima Oct 2009 A1
20090316730 Feng Dec 2009 A1
20090323864 Tired Dec 2009 A1
20090323884 Tired Dec 2009 A1
20100046644 Mazet Feb 2010 A1
20100054355 Kinjo et al. Mar 2010 A1
20100081451 Mueck Apr 2010 A1
20100122021 Lee et al. May 2010 A1
20100148819 Bae Jun 2010 A1
20100180143 Ware Jul 2010 A1
20100215087 Tsai Aug 2010 A1
20100215112 Tsai Aug 2010 A1
20100215118 Ware Aug 2010 A1
20100235673 Abbasfar Sep 2010 A1
20100271107 Tran Oct 2010 A1
20100283894 Horan Nov 2010 A1
20100296556 Rave Nov 2010 A1
20100309964 Oh Dec 2010 A1
20110014865 Seo Jan 2011 A1
20110028089 Komori Feb 2011 A1
20110032977 Hsiao Feb 2011 A1
20110051854 Kizer Mar 2011 A1
20110072244 Lindholm et al. Mar 2011 A1
20110072330 Kolze Mar 2011 A1
20110074488 Broyde Mar 2011 A1
20110084737 Oh Apr 2011 A1
20110103508 Mu May 2011 A1
20110127990 Wilson Jun 2011 A1
20110228864 Aryanfar Sep 2011 A1
20110235501 Goulahsen Sep 2011 A1
20110268225 Cronie Nov 2011 A1
20110286497 Nervig Nov 2011 A1
20110299555 Cronie Dec 2011 A1
20110302478 Cronie Dec 2011 A1
20110317559 Kern Dec 2011 A1
20110317587 Lida et al. Dec 2011 A1
20120036415 Shafrir Feb 2012 A1
20120082203 Zerbe Apr 2012 A1
20120133438 Tsuchi May 2012 A1
20120152901 Nagorny Jun 2012 A1
20120161945 Single Jun 2012 A1
20120213299 Cronie Aug 2012 A1
20120243589 Desjardins Sep 2012 A1
20120257683 Schwager Oct 2012 A1
20130010892 Cronie Jan 2013 A1
20130013870 Cronie Jan 2013 A1
20130088274 Gu Apr 2013 A1
20130106513 Cyrusian May 2013 A1
20130114392 Sun et al. May 2013 A1
20130114519 Gaal May 2013 A1
20130114663 Ding May 2013 A1
20130129019 Sorrells May 2013 A1
20130147553 Iwamoto Jun 2013 A1
20130159584 Nygren Jun 2013 A1
20130188656 Ferraiolo Jul 2013 A1
20130195155 Pan Aug 2013 A1
20130202065 Chmelar Aug 2013 A1
20130215954 Beukema Aug 2013 A1
20130259113 Kumar Oct 2013 A1
20130271194 Pellerano Oct 2013 A1
20130307614 Dai Nov 2013 A1
20130314142 Tamura Nov 2013 A1
20130315501 Atanassov Nov 2013 A1
20130346830 Ordentlich Dec 2013 A1
20140068391 Goel Mar 2014 A1
20140159769 Hong Jun 2014 A1
20140177645 Cronie Jun 2014 A1
20140177696 Hwang Jun 2014 A1
20140254642 Fox et al. Sep 2014 A1
20140266440 Itagaki Sep 2014 A1
20140269130 Maeng Sep 2014 A1
20140286381 Shibasaki Sep 2014 A1
20150049798 Hossein Feb 2015 A1
20150070201 Dedic Mar 2015 A1
20150078479 Strovene Mar 2015 A1
20150117579 Shibasaki Apr 2015 A1
20150146771 Walter May 2015 A1
20150222458 Hormati Aug 2015 A1
20150236885 Ling Aug 2015 A1
20150249559 Shokrollahi Sep 2015 A1
20150333940 Shokrollahi Nov 2015 A1
20150349835 Fox Dec 2015 A1
20150365263 Zhang et al. Dec 2015 A1
20150380087 Mittelholzer Dec 2015 A1
20150381232 Ulrich Dec 2015 A1
20150381768 Fox et al. Dec 2015 A1
20160020796 Hormati Jan 2016 A1
20160020824 Ulrich et al. Jan 2016 A1
20160036616 Holden Feb 2016 A1
20160197747 Ulrich Jul 2016 A1
20160218894 Fox Jul 2016 A1
20160261435 Musah Sep 2016 A1
20160380787 Hormati et al. Dec 2016 A1
20170272285 Shokrollahi et al. Sep 2017 A1
20170310456 Tajalli Oct 2017 A1
20170317449 Shokrollahi Nov 2017 A1
20170317855 Shokrollahi Nov 2017 A1
20180299921 Rajwani et al. Oct 2018 A1
20190103903 Yang Apr 2019 A1
Foreign Referenced Citations (14)
Number Date Country
1864346 Nov 2006 CN
101276645 Oct 2008 CN
101478286 Jul 2009 CN
101820288 Sep 2010 CN
101854223 Oct 2010 CN
101999116 Mar 2011 CN
102254571 Jun 2015 CN
1926267 May 2008 EP
2039221 Feb 2013 EP
2003163612 Jun 2003 JP
2005002162 Jan 2005 WO
2009084121 Jul 2009 WO
2010031824 Mar 2010 WO
2011119359 Sep 2011 WO
Non-Patent Literature Citations (53)
Entry
“Introduction to: Analog Computers and the DSPACE System,” Course Material ECE 5230 Spring 2008, Utah State University, www.coursehero.com, 12 pages.
Abbasfar, A., “Generalized Differential Vector Signaling”, IEEE International Conference on Communications, ICC '09 (Jun. 14, 2009), pp. 1-5.
Brown, L., et al., “V.92: The Last Dial-Up Modem?”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ., USA, vol. 52, No. 1, Jan. 1, 2004, pp. 54-61. XP011106836, ISSN: 0090-6779, DOI: 10.1109/tcomm.2003.822168, pp. 55-59.
Burr, “Spherical Codes for M-Ary Code Shift Keying”, University of York, Apr. 2, 1989, pp. 67-72, United Kingdom.
Cheng, W., “Memory Bus Encoding for Low Power: A Tutorial”, Quality Electronic Design, IEEE, International Symposium on Mar. 26-28, 2001, pp. 199-204, Piscataway, NJ.
Clayton, P., “Introduction to Electromagnetic Compatibility”, Wiley-Interscience, 2006.
Counts, L., et al., “One-Chip Slide Rule Works with Logs, Antilogs for Real-Time Processing,” Analog Devices Computational Products 6, Reprinted from Electronic Design, May 2, 1985, 7 pages.
Dasilva et al., “Multicarrier Orthogonal CDMA Signals for Quasi-Synchronous Communication Systems”, IEEE Journal on Selected Areas in Communications, vol. 12, No. 5 (Jun. 1, 1994), pp. 842-852.
Design Brief 208 Using the Anadigm Multiplier CAM, Copyright 2002 Anadigm, 6 pages.
Ericson, T., et al., “Spherical Codes Generated by Binary Partitions of Symmetric Pointsets”, IEEE Transactions on Information Theory, vol. 41, No. 1, Jan. 1995, pp. 107-129.
Farzan, K., et al., “Coding Schemes for Chip-to-Chip Interconnect Applications”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 14, No. 4, Apr. 2006, pp. 393-406.
Grahame, J., “Vintage Analog Computer Kits,” posted on Aug. 25, 2006 in Classic Computing, 2 pages, http.//www.retrothing.com/2006/08/classic_analog_.html.
Healey, A., et al., “A Comparison of 25 Gbps NRZ & PAM-4 Modulation used in Legacy & Premium Backplane Channels”, DesignCon 2012, 16 pages.
International Search Report and Written Opinion for PCT/EP2011/059279 dated Sep. 22, 2011.
International Search Report and Written Opinion for PCT/EP2011/074219 dated Jul. 4, 2012.
International Search Report and Written Opinion for PCT/EP2012/052767 dated May 11, 2012.
International Search Report and Written Opinion for PCT/US14/052986 dated Nov. 24, 2014.
International Search Report and Written Opinion from PCT/US2014/034220 dated Aug. 21, 2014.
International Search Report and Written Opinion of the International Searching Authority, dated Jul. 14, 2011 in International Patent Application S.N. PCT/EP2011/002170, 10 pages.
International Search Report and Written Opinion of the International Searching Authority, dated Nov. 5, 2012, in International Patent Application S.N. PCT/EP2012/052767, 7 pages.
International Search Report for PCT/US2014/053563, dated Nov. 11, 2014, 2 pages.
Jiang, A., et al., “Rank Modulation for Flash Memories”, IEEE Transactions of Information Theory, Jun. 2006, vol. 55, No. 6, pp. 2659-2673.
Loh, M., et al., “A 3×9 Gb/s Shared, All-Digital CDR for High-Speed, High-Density I/O”, Matthew Loh, IEEE Journal of Solid-State Circuits, Vo. 47, No. 3, Mar. 2012.
Notification of Transmittal of International Search Report and the Written Opinion of the International Searching Authority, for PCT/US2015/018363, dated Jun. 18, 2015, 13 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration for PCT/EP2013/002681, dated Feb. 25, 2014, 15 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, dated Mar. 3, 2015, for PCT/US2014/066893, 9 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2014/015840, dated May 20, 2014. 11 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2014/043965, dated Oct. 22, 2014, 10 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/037466, dated Nov. 19, 2015.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/039952, dated Sep. 23, 2015, 8 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/041161, dated Oct. 7, 2015, 8 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for PCT/US2015/043463, dated Oct. 16, 2015, 8 pages.
Oh, et al., Pseudo-Differential Vector Signaling for Noise Reduction in Single-Ended Signaling, DesignCon 2009.
Poulton, et al., “Multiwire Differential Signaling”, UNC-CH Department of Computer Science Version 1.1, Aug. 6, 2003.
Schneider, J., et al., “ELEC301 Project: Building an Analog Computer,” Dec. 19, 1999, 8 pages, http://www.clear.rice.edu/elec301/Projects99/anlgcomp/.
She et al., “A Framework of Cross-Layer Superposition Coded Multicast for Robust IPTV Services over WiMAX,” IEEE Communications Society subject matter experts for publication in the WCNC 2008 proceedings, Mar. 31, 2008-Apr. 3, 2008, pp. 3139-3144.
Skliar et al., A Method for the Analysis of Signals: the Square-Wave Method, Mar. 2008, Revista de Matematica: Teoria y Aplicationes, pp. 109-129.
Slepian, D., “Premutation Modulation”, IEEE, vol. 52, No. 3, Mar. 1965, pp. 228-236.
Stan, M., et al., “Bus-Invert Coding for Low-Power I/O, IEEE Transactions on Very Large Scale Integration (VLSI) Systems”, vol. 3, No. 1, Mar. 1995, pp. 49-58.
Tallini, L., et al., “Transmission Time Analysis for the Parallel Asynchronous Communication Scheme”, IEEE Transactions on Computers, vol. 52, No. 5, May 2003, pp. 558-571.
Tierney, J., et al., “A digital frequency synthesizer,” Audio and Electroacoustics, IEEE Transactions, Mar. 1971, pp. 48-57, vol. 19, Issue 1, 1 page Abstract from http://ieeexplore.
Wang 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), pp. 1091-1100.
Zouhair Ben-Neticha et al, “The 'streTched”-Golay and other codes for high-SNR fnite-delay quantization of the Gaussian source at ½ Bit per sample, IEEE Transactions on Communications, vol. 38, No. 12 Dec. 1, 1990, pp. 2089-2093, XP000203339, ISSN: 0090-6678, DOI: 10.1109/26.64647.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, dated Feb. 15, 2017, 10 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration., for PCT/US17/14997, dated Apr. 7, 2017.
Shibasaki, et al., “A 56-Gb/s Receiver Front-End with a CTLE and 1-Tap DFE in 20-nm CMOS”, IEEE 2014 Symposium on VLSI Circuits Digest of Technical Papers, 2 pgs.
Hidaka, et al., “A 4-Channel 1.25-10.3 Gb/s Backplane Transceiver Macro With35 dB Equalizer and Sign-Based Zero-Forcing Adaptive Control”, IEEE Journal of Solid-State Circuits, vol. 44 No. 12, Dec. 2009, pp. 3547-3559.
Holden, B., “Using Ensemble NRZ Coding for 400GE Electrical Interfaces”, IEEE 8023 400GE Study Group, May 17, 2013, 24 pages, http://www.ieee802.org/3/400GSG/public/13_05/holden_400_01_0513.pdf.
Holden, B., “An exploration of the technical feasibility of the major technology options for 400GE backplanes”, IEEE 802.3 400GE Study Group, Jul. 16, 2013, 18 pages, http://ieee802.org/3/400GSG/public/13_07/holden_400_01_0713.pdf.
Holden, B., “Simulation results for NRZ, ENRZ & PAM-4 on 16-wire full-sized 400GE backplanes”, IEEE 802.3 400GE Study Group, Sep. 2, 2013, 19 pages, www.ieee802.0rg/3/400GSG/publiv/13_09/holden_400_01_0913.pdf.
Giovaneli, et al., “Space-frequency coded OFDM system for multi-wire power line communications”, Power Line Communications and Its Applications, 20015 International Symposium on Vancouver, BC, Canada, Apr. 6-8, 2005, Piscataway, NJ, pp. 191-195.
Anonymous , “Constant-weight code”, Wikipedia.org, retrieved on Feb. 6, 2017, (3 pages).
Elmhurst, Daniel , et al., “A 1.8 128-Mb 125-MHz Multi-level Cell Flash Memory With Flexible Read While Write”, IEEE Journal of Solid-State Circuits, vol. 38, No. 11, Nov. 2003, 1929-1933 (5 pages).
Related Publications (1)
Number Date Country
20170200482 A1 Jul 2017 US
Provisional Applications (1)
Number Date Country
61738329 Dec 2012 US
Continuations (2)
Number Date Country
Parent 14974698 Dec 2015 US
Child 15469441 US
Parent 14108316 Dec 2013 US
Child 14974698 US