The present invention relates generally to high speed serial communication. More particularly, the invention relates to three phase modulation data encoding schemes for high speed serial communication.
In the field of high speed serial communication, demand for ever increasing data rates continues to grow.
Many conventional high-speed serial interface systems use non-return to zero (NRZ) data encoding with separate data and clock signals. This separation of the data and clock signals, however, typically results in skew between the two signals, limiting the maximum possible link data rate of the interface.
Typically, de-skewing circuitry is used at the receiving end of the serial interface to eliminate skew between the data and the clock signals. Consequently, both the real estate requirements and the link start-up time of the serial interface are increased, with the latter becoming disadvantageous when the interface is being used intermittently at a low duty cycle to minimize system power consumption.
Other conventional serial interface systems are more immune to skew by using data and strobe signals, but still suffer from skew problems when operating at high speeds.
Additionally, certain integrated receiver devices are typically built with slower logic because they have larger feature sizes in order to drive high voltages. This is the case, for example, for integrated LCD Controller-Driver circuits that are used to drive LCD panels. As such, it would be difficult to implement a high-speed serial interface for such devices using conventional systems.
What is needed therefore is a high-speed serial interface that resolves the above-described problems of conventional serial interface systems. Further, a high-speed serial interface with increased capacity and reduced power consumption relative to conventional systems is needed.
A high-speed serial interface is provided herein.
In one aspect, the high-speed serial interface uses a three phase modulation data encoding scheme for jointly encoding data and clock information. Accordingly, the need for de-skewing circuitry at the receiving end of the interface is eliminated, resulting in reduced link start-up time and improved link efficiency and power consumption. In one embodiment, the high-speed serial interface uses fewer signal conductors than conventional systems with separate conductors for data and clock information. In another embodiment, the serial interface allows for data to be transmitted at any speed without the receiving end having any prior knowledge of the transmission data rate.
In another aspect, the high-speed serial interface uses a polarity encoded three phase modulation data encoding scheme for jointly encoding data and clock information. This, in addition to the above-described advantages, further increases the link capacity of the serial interface by allowing for more than one bit to be transmitted in any single baud interval.
In a further aspect, the polarity encoded three phase modulation data encoding scheme is used to implement high-speed serial interfaces for certain receiver drivers with slower logic circuits. By encoding at least two bits per transition on the interface, the encoding scheme allows the data transition rate to be half of the normal serial data rate.
A high-speed interface employing the three phase modulation data encoding scheme provided herein consumes half the current as other high-speed interfaces using the same drivers. This is because only one driver output is active at one time instead of having two simultaneously active outputs as is commonly the case in other serial interfaces (e.g., data and clock or data and strobe). This power consumption reduction is coupled with the ability of a high-speed interface employing the three phase modulation data encoding scheme to send data at least twice the rate of other serial interfaces.
Further embodiments, features, and advantages of the present invention, as well as the structure and operation of the various embodiments of the present invention, are described in detail below with reference to the accompanying drawings.
The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate the present invention and, together with the description, further serve to explain the principles of the invention and to enable a person skilled in the pertinent art to make and use the invention.
The present invention will be described with reference to the accompanying drawings. The drawing in which an element first appears is typically indicated by the leftmost digit(s) in the corresponding reference number.
This specification discloses one or more embodiments that incorporate the features of this invention. The disclosed embodiment(s) merely exemplify the invention. The scope of the invention is not limited to the disclosed embodiment(s). The invention is defined by the claims appended hereto.
The embodiment(s) described, and references in the specification to “one embodiment”, “an embodiment”, “an example embodiment”, etc., indicate that the embodiment(s) described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
Embodiments of the invention may be implemented in hardware, firmware, software, or any combination thereof. Embodiments of the invention may also be implemented as instructions stored on a machine-readable medium, which may be read and executed by one or more processors. A machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computing device). For example, a machine-readable medium may include read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.), and others. Further, firmware, software, routines, instructions may be described herein as performing certain actions. However, it should be appreciated that such descriptions are merely for convenience and that such actions in fact result from computing devices, processors, controllers, or other devices executing the firmware, software, routines, instructions, etc.
Data Encoding with Embedded Timing Information
As discussed above, in order to eliminate skew between data and clock signals or the need for de-skewing circuitry in a serial interface, it is desirable to jointly encode data and clock information (or embed timing information in the data signal). One common technique for realizing that is by using a differential data encoding scheme, whereby data and clock information are jointly encoded in state transitions of a single signal.
The majority of differential data encoding schemes are level differential schemes, whereby state transitions are defined in terms of changes in the level (magnitude) of the data and clock signal.
Example transitions 102 and 104 illustrate two signal level transitions whereby the signal level changes from −V to +V. Transition 102 includes a first transition from −V to 0 followed by a second transition from 0 to +V, to transmit a 01 data sequence. Transition 104 includes a single transition from −V to +V to transmit a logic 1.
However, as shown in
This ambiguity in decoding state transitions is due to having transitions that must pass through intermediate states in order to reach a desired state. A differential data encoding scheme with “circular” state transitions is therefore needed to resolve ambiguous state transitions in differential data encoding schemes.
Differential Data Encoding with Circular State Transitions
At any time, exactly two of conductors A, B, and C carry a signal, with the data encoding states being defined in terms of signal flow between conductors. In one embodiment, three states (corresponding respectively to states a, b, c of
Referring back to
Circuit 400 includes a plurality of current sources 402a-f that can be coupled using switches 404a-f to first ends of conductors A, B, and C. Second ends of conductors A, B, and C are coupled together using termination impedances 406a-c. In one embodiment, each of conductors A, B, and C has a natural impedance of value Z0, with termination impedances 406a-c each having an impedance value of 3Z0.
At any time, exactly two of switches 404a-f are closed to cause a current flow between exactly two of conductors A, B, and C. As such, a single current path exists at any time in the circuit. Further, in accordance with encoding scheme 300, current is only allowed to flow from conductor A to conductor B, from conductor B to conductor C, or from conductor C to conductor A. These three current flow scenarios correspond to the only three valid encoding states of data encoding scheme 300 and are illustrated in
Data Recovery Circuit
At the receiving end of the serial interface, a data recovery circuit is used to decode the data transmitted by the transmitter circuit. In one embodiment, voltages across termination resistors 406a-b in transmitter circuit 400 are monitored to detect state transitions. For example, signals similar to signals A>B 308, B>C 310, and C>A 312 of
Data recovery circuit 600 includes first, second, and third layers 610, 624, and 638 of D flip flops and a multiplexer circuit 646.
Data recovery circuit 600 receives input signals A-to-B 602, B-to-C 604, and C-to-A 606. At any time, exactly one of signals 602, 604, and 606 is high, indicating the current encoding state being transmitted. Signals 602, 604, and 606 are input respectively into first layer D flip flops 612, 614, and 616.
First layer D flip flops 612, 614, and 616 capture the most recent state transition as indicated by signals 602, 604, and 606. Note that each of D flip flops 612, 614, and 616 has its D data input coupled to a logic 1 and is set whenever its respective clock input 602, 604, or 606 experiences a rising edge transition. Also note that whenever one of D flip flops 612, 614, and 616 is set, it asynchronously resets the other two first layer D flip flops. In one embodiment, this is done by coupling the Q output of each first layer D flip flop through a rising edge triggered pulse circuit to the reset inputs of the other two first layer D flip flops. For example, in the embodiment of
Second layer D flip flops 626, 628, and 630 are configured as toggle flip flops with their Q_bar outputs connected to their D inputs. Accordingly, second layer flip flops 626, 628, and 630 toggle at rising edges of their respective clock input signal 602, 604, and 606. Note that the rising edges in signals 602, 604, and 606 correspond to state transitions in the data encoding scheme. As such, since exactly one state transition may occur at any time, only one of second layer D flip flops 626, 628, 630 toggles at any time. The Q_bar outputs of flip flops 626, 628, and 630 are input into a three input XOR gate 632 to generate a receiver clock Rx_Clk 636. Note that receiver clock 636 will toggle whenever any one of the Q_bar outputs of flip flops 626, 628, and 630 toggles, thereby generating a half rate clock.
Third layer D flip flops 640, 642, and 644 have clock inputs respectively driven by signals A-to-B 602, B-to-C 604, and C-to-A 606. Their D inputs are cross-coupled to Q outputs of the first layer, such that the Q output of first layer flip flop 616 is coupled to the D input of flip flop 640, the Q output of first layer flip flop 612 is coupled to the D input of flip flop 642, and the Q output of first layer flip flop 614 is coupled to the D input of flip flop 644.
As such, third layer flip flops 640, 642, and 644 capture C-to-A, A-to-B, and B-to-C state occurrences, respectively, and output logic 1 for (C-to-A) to (A-to-B), (A-to-B) to (B-to-C), and (B-to-C) to (C-to-A) transitions, respectively. These transitions are clockwise transitions as indicated above with respect to
The Q outputs of flip flops 640, 642, and 644 are input into multiplexer circuit 646, with the Q outputs from the first flip flop layer 610 providing the select inputs of the multiplexer. In one embodiment, multiplexer circuit 646 includes a layer of AND gates 648, 650, and 652 followed by a three input OR gate 654. AND gates 648, 650, and 652 provide the inputs of OR gate 654, which provides output signal 656 of data recovery circuit 600. Note that output signal 656 is a logic 1 whenever any one of AND gates 648, 650, and 652 outputs a logic 1, which only occurs on clockwise state transitions, as described above. Accordingly, output signal 656 is a logic 1 for clockwise state transitions and a logic 0 for counter-clockwise state transitions, thereby having the ability to recover information encoded according to the three phase modulation scheme.
Impact of Timing Offset on Three Phase Modulation
Polarity Encoded Three Phase Modulation
As described above, the three phase modulation data encoding scheme uses clockwise state transitions to transmit logic ones and counter-clockwise state transitions to transmit logic zeros. As such, exactly one data bit is transmitted during each state transition, whether clockwise or counter-clockwise.
However, the capacity of the three phase modulation data encoding scheme can be further increased by exploiting the polarity of the encoding states, in addition to the directionality of state transitions. Referring back to
According to state table 800, two data bits are transmitted during each state transition, resulting in a doubling of the capacity of the data encoding scheme of
In other embodiments, state transitions in example state table 800 can be further divided to generate additional transitions, thereby allowing for a further increase in the capacity of the encoding scheme. For example, state transition (A-to-B positive or negative to B-to-C positive) can be divided into two transitions (A-to-B positive to B-to-C positive) and (A-to-B negative to B-to-C positive). For example, from state A-to-B positive, the next state can be any one of the following five states: A-to-B negative, B-to-C positive, B-to-C negative, C-to-A positive or C-to-A negative. This allows log2(5) or approximately 2.3216 bits of information to be encoded in a single state transition. Using this technique, it is possible to encode 16 bits of information in 7 consecutive state transitions.
A 3-phase signal that rotates in two directions is transmitted using three conductors A, B, and C. The three signals 902, 904, and 906 (carried by conductors A, B, and C) that make up the 3-phase signal are independent, with each signal being 120 degrees out of phase relative to the remaining two.
At any time, exactly two of conductors A, B, and C carry a signal, with the data encoding states being defined both in terms of signal flow between conductors and the polarity of said signal flow. Data encoding is done according to the state transitions as defined in state table 800. In one embodiment, clockwise state transitions (A-to-B to B-to-C, B-to-C to C-to-A, and C-to-A to A-to-B) are used to transmit data sequences starting with a logic 1 (10 and 11) and counter-clockwise state transitions (A-to-B to C-to-A, B-to-C to A-to-B, and C-to-A to B-to-C) are used to transmit data sequences starting with a logic zero (00 and 01).
Recovery circuit 1300 receives input signals 1302, 1304, 1306, 1308, 1310, and 1312 from preceding analog circuits. At any time, only one of signals 1302, 1304, 1306, 1308, 1310, and 1312 can have a value of one, depending on which of the encoding states just occurred. In implementation, overlaps or gaps between the signals may occur. Inputs signals 1302, 1304, 1306, 1308, 1310, and 1312 are respectively coupled to the clock inputs of D flip flops 11-16. Each of D flip flops 11-16 has its D data input coupled to a logic one, which causes its Q output to have a value of one whenever its respective clock input experiences a rising edge transition. For example, D flip flop 11 will have a Q output of one whenever input signal 1302 experiences a rising edge transition, or equivalently, whenever state A-to-B positive occurs. As such, D flip flops 11-16 capture which of the six states has just occurred, as indicated by their respective Q outputs 1322, 1324, 1326, 1328, 1330, 1332. Since only one state can occur at any time, only one of outputs 1322, 1324, 1326, 1328, 1330, 1332 can continue to have a value of one at any time. As will be further described below, there will be a short overlap whenever a new state occurs with the Q outputs corresponding to the current state and the new state both having a value of one for the duration of the delay to reset the flip-flops.
When any of the states is captured by one of D flip flops 11-16, the other flip flops will be reset. In circuit 1300, this is achieved using OR gates 1-6, which generate reset signals for respective D flip flops 11-16. OR gates 1-6 each receives as inputs pulses caused by rising edges on the Q outputs of D flip flops 11-16 except for the Q output of its respective D flip-flop and a Reset signal 1314. For example, OR gate 1 receives pulses caused by rising edges on the Q outputs 1324, 1326, 1328, 1330, and 1330 (but not Q output 1322 of its respective D flip flop 11) of D flip-flops 12-16 and Reset signal 1314. Accordingly, the output of OR gate 1 will be one whenever any state other than A-to-B positive occurs or if Reset signal 1314 is asserted. One the other hand, when state A-to-B positive occurs and Reset signal 1341 is not asserted, OR gate 1 will output a value of zero.
In an embodiment, to ensure that D flip-flops 11-16 are only reset momentarily when a non-respective state occurs, the Q outputs of D flip-flops 11-16 are coupled to OR gates 1-6 through a circuitry, which ensures that OR gates 1-6 are only provided with a pulse and not a continuous signal of value one. For example, Q output 1322 of D flip-flop 11 is coupled to OR gates 2-6 through an AND gate 71. AND gate 71 receives as inputs Q output 1322 and a delayed inverted version of Q output 1322. Note that right before D flip-flop 11 captures an A-to-B positive state occurrence, the output of AND gate 71 is zero because Q output 1322 is zero (D flip-flop 11 would have been reset previously). On the other hand, the delayed inverted version of Q has a value of one. When the A-to-B positive input occurs, Q output 1322 changes to one. The delayed inverted version of Q maintains a value of one for the duration of the delay (generated by a delay element as illustrated) before changing to zero. Accordingly, for the duration of the delay, AND gate 71 will output a value of one, creating a pulse which resets flip-flops 12-16.
D flip-flops 21-26 are used to generate a double data rate clock signal Rx_Clk 1316, which transitions whenever a new input is presented. D flip-flops 21-26 respectively receive as clock inputs input signals 1302, 1304, 1306, 1308, 1310, and 1312. D flip-flops 21-26 also receive Reset signal 1314. As shown in
OR gate 31 generates Rx_Data_Polarity signal 1318, which indicates whether the state that just occurred is of positive or negative polarity. OR gate 31 receives as inputs the Q outputs 1322, 1324, and 1326 of D flip-flops 11-13, respectively. As such, OR gate 31 outputs a value of one whenever a positive polarity (A-to-B positive, B-to-C positive, or C-to-A positive) input occurs. On the other hand, Rx_Data_Polarity signal 1318 will have a value of zero when a negative polarity state occurs.
OR gates 3233, and 34 are used to capture respectively when a C-to-A state (positive or negative polarity), an A-to-B state (positive or negative polarity), and a B-to-C state (positive or negative polarity) occurs regardless of polarity. For example, OR gate 32 receives as inputs Q_outputs 1326 and 1332 of D flip-flops 13 and 16, respectively. As such, OR gate 32 outputs a value of one whenever C-to-A positive or C-to-A negative occurs.
The outputs of OR gates 32-34 are coupled to the D data inputs of D flip-flops 41-46, as illustrated in
The Q outputs of D flip-flops 41-46 are input together with respective Q outputs of D flip-flops 11-16 into respective AND gates 51-56, as illustrated in
Outputs of AND gates 81-86 are input together into an OR gate 87, which generates output signal Rx_Data_same_phase 1402. Output signal Rx_Data_same_phase 1402 thus has a value of one whenever any one of the six possible polarity-only state transitions occurs. As such, Rx_Data_same_phase 1402 can be used to determine whether a transition is polarity-only or counter-clockwise, whenever Rx_Data_phase 1320 of circuitry 1300 has a value of zero.
Note that circuitry 1400 is operable together with data recovery circuit 1300 of
Example Serial Interface Implementations
Three Phase Modulation for Mobile Display Digital Interface (MDDI)
The Mobile Display Digital Interface (MDDI) is a cost-effective, low power consumption, transfer mechanism that enables very-high-speed serial data transfer over a short-range communication link between a host and a client. In certain embodiments, an MDDI interface may benefit from using the three phase modulation data encoding schemes of the present invention.
In one aspect, an MDDI host may comprise one of several types of devices that can benefit from using the data encoding schemes of the present invention. For example, the host could be a portable computer in the form of a handheld, laptop, or similar mobile computing device. It could also be a Personal Data Assistant (PDA), a paging device, or one of many wireless telephones or modems. Alternatively, the host could be a portable entertainment or presentation device such as a portable DVD or CD player, or a game playing device. Furthermore, the host can reside as a host device or control element in a variety of other widely used or planned commercial products for which a high-speed communication link with a client is desired. For example, a host could be used to transfer data at high rates from a video recording device to a storage based client for improved response, or to a high resolution larger screen for presentations. In general, those skilled in the art will appreciate the wide variety of modern electronic devices and appliances that may benefit from the use of this interface, as well as the ability to retrofit older devices with higher data rate transport of information utilizing limited numbers of conductors available in either newly added or existing connectors or cables. At the same time, an MDDI client may comprise a variety of devices useful for presenting information to an end user, or presenting information from a user to the host. For example, a micro-display incorporated in goggles or glasses, a projection device built into a hat or helmet, a small screen or even holographic element built into a vehicle, such as in a window or windshield, or various speaker, headphone, or sound systems for presenting high quality sound or music. Other presentation devices include projectors or projection devices used to present information for meetings, or for movies and television images. Other examples include the use of touch pads or sensitive devices, voice recognition input devices, security scanners, and so forth that may be called upon to transfer a significant amount of information from a device or system user with little actual “input” other than touch or sound from the user. In addition, docking stations for computers and car kits or desk-top kits and holders for wireless telephones may act as interface devices to end users or to other devices and equipment, and employ either clients (output or input devices such as mice) or hosts to assist in the transfer of data, especially where high speed networks are involved. However, those skilled in the art will readily recognize that the present invention is not limited to these devices, there being many other devices on the market, and proposed for use, that are intended to provide end users with high quality images and sound, either in terms of storage and transport or in terms of presentation at playback. The present invention is useful in increasing the data throughput between various elements or devices to accommodate the high data rates needed for realizing the desired user experience.
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the invention. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
The present Application for Patent is a continuation of U.S. Utility patent application Ser. No. 15/013,003, filed Feb. 2, 2016, which is a continuation of U.S. Utility patent application Ser. No. 14/796,207 (issued as U.S. Pat. No. 9,455,850), filed Jul. 10, 2015, which is a continuation of Ser. No. 13/826,546, filed Mar. 14, 2013 (issued as U.S. Pat. No. 9,083,598), which is a continuation of U.S. Utility patent application Ser. No. 13/301,454, filed Nov. 21, 2011 (issued as U.S. Pat. No. 8,472,551), which is a continuation of U.S. Utility patent application Ser. No. 11/712,941, filed Mar. 2, 2007 (issued as U.S. Pat. No. 8,064,535), all of which are assigned to the assignee hereof and hereby expressly incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
3866147 | De Couvreur | Feb 1975 | A |
4083005 | Looschen | Apr 1978 | A |
4201958 | Ahamed | May 1980 | A |
4280221 | Chun | Jul 1981 | A |
4355310 | Belaigues et al. | Oct 1982 | A |
RE31311 | Miller | Jul 1983 | E |
4468787 | Keiper, Jr. | Aug 1984 | A |
4475212 | McLean | Oct 1984 | A |
4631428 | Grimes | Dec 1986 | A |
4682215 | Adachi | Jul 1987 | A |
4910750 | Fisher | Mar 1990 | A |
4980898 | Silvian | Dec 1990 | A |
5160929 | Costello | Nov 1992 | A |
5166956 | Baltus | Nov 1992 | A |
5259002 | Carlstedt | Nov 1993 | A |
5323307 | Wolf | Jun 1994 | A |
5327440 | Fredrickson | Jul 1994 | A |
5359595 | Weddle et al. | Oct 1994 | A |
5381414 | Gibson | Jan 1995 | A |
5461379 | Weinman, Jr. | Oct 1995 | A |
5563526 | Hastings et al. | Oct 1996 | A |
5664948 | Dimitriadis et al. | Sep 1997 | A |
5682157 | Asmussen et al. | Oct 1997 | A |
5687326 | Robinson | Nov 1997 | A |
5733131 | Park | Mar 1998 | A |
5809519 | Lee | Sep 1998 | A |
5852630 | Langberg et al. | Dec 1998 | A |
5939939 | Gaynor et al. | Aug 1999 | A |
6005895 | Perino | Dec 1999 | A |
6081513 | Roy | Jun 2000 | A |
6091709 | Harrison et al. | Jul 2000 | A |
6175319 | Schneider | Jan 2001 | B1 |
6243761 | Mogul et al. | Jun 2001 | B1 |
6256509 | Tanaka et al. | Jul 2001 | B1 |
6278429 | Ruth et al. | Aug 2001 | B1 |
6288739 | Hales et al. | Sep 2001 | B1 |
6317465 | Akamatsu | Nov 2001 | B1 |
6346832 | Young | Feb 2002 | B1 |
6359931 | Perino et al. | Mar 2002 | B1 |
6430196 | Baroudi | Aug 2002 | B1 |
6452420 | Wong | Sep 2002 | B1 |
6504875 | Perino | Jan 2003 | B2 |
6556628 | Poulton | Apr 2003 | B1 |
6587037 | Besser et al. | Jul 2003 | B1 |
6611503 | Fitzgerald et al. | Aug 2003 | B1 |
6621438 | Hong | Sep 2003 | B1 |
6649377 | Allard et al. | Nov 2003 | B1 |
6654565 | Kenny | Nov 2003 | B2 |
6662019 | Kamel et al. | Dec 2003 | B2 |
6694377 | Beyer | Feb 2004 | B1 |
6703868 | Savaria et al. | Mar 2004 | B2 |
6703949 | Greenstreet | Mar 2004 | B2 |
6728320 | Khasnis | Apr 2004 | B1 |
6778493 | Ishii | Aug 2004 | B1 |
6797891 | Blair et al. | Sep 2004 | B1 |
6813638 | Sevanto et al. | Nov 2004 | B1 |
6836290 | Chung et al. | Dec 2004 | B1 |
6842389 | Perner | Jan 2005 | B2 |
6865610 | Bolosky et al. | Mar 2005 | B2 |
6867668 | Dagostino et al. | Mar 2005 | B1 |
6891899 | Hall | May 2005 | B2 |
6914637 | Wolf et al. | Jul 2005 | B1 |
7027522 | Pickering | Apr 2006 | B2 |
7047155 | Barrenscheen et al. | May 2006 | B2 |
7072406 | Harma | Jul 2006 | B1 |
7106276 | Akiyama | Sep 2006 | B2 |
7113550 | Stonecypher et al. | Sep 2006 | B2 |
7142612 | Horowitz | Nov 2006 | B2 |
7143177 | Johnson et al. | Nov 2006 | B1 |
7145411 | Blair et al. | Dec 2006 | B1 |
7154418 | Lee | Dec 2006 | B2 |
7167527 | Park | Jan 2007 | B1 |
7224737 | Voutilainen | May 2007 | B2 |
7230989 | Biman | Jun 2007 | B2 |
7233773 | Hansen et al. | Jun 2007 | B2 |
7263133 | Miao | Aug 2007 | B1 |
7269430 | Moorti et al. | Sep 2007 | B2 |
7336139 | Blair et al. | Feb 2008 | B2 |
7339502 | Furtner | Mar 2008 | B2 |
7355532 | Kim | Apr 2008 | B2 |
7471285 | Cheng | Dec 2008 | B2 |
7508881 | Choi | Mar 2009 | B2 |
7529957 | Krantz et al. | May 2009 | B2 |
7539882 | Jessup et al. | May 2009 | B2 |
7561624 | Fonseka | Jul 2009 | B2 |
7626442 | Zerbe | Dec 2009 | B2 |
7656321 | Wang | Feb 2010 | B2 |
7688929 | Co | Mar 2010 | B2 |
7692563 | Hamada | Apr 2010 | B2 |
7697628 | Choi | Apr 2010 | B2 |
7826551 | Lee et al. | Nov 2010 | B2 |
7859356 | Pandey | Dec 2010 | B2 |
8024477 | Rothman et al. | Sep 2011 | B2 |
8027405 | Den Ouden | Sep 2011 | B2 |
8064535 | Wiley | Nov 2011 | B2 |
8320494 | Zerbe | Nov 2012 | B2 |
8472551 | Wiley | Jun 2013 | B2 |
8848810 | Lee | Sep 2014 | B2 |
8996740 | Wiley | Mar 2015 | B2 |
9083598 | Wiley | Jul 2015 | B2 |
9112815 | Wiley | Aug 2015 | B2 |
9143362 | Wiley | Sep 2015 | B2 |
9231790 | Wiley et al. | Jan 2016 | B2 |
9313058 | Sengoku | Apr 2016 | B2 |
9337997 | Sengoku | May 2016 | B2 |
9369237 | Wiley | Jun 2016 | B2 |
9444612 | Sengoku | Sep 2016 | B2 |
9455850 | Wiley | Sep 2016 | B2 |
9496879 | Duan et al. | Nov 2016 | B1 |
9520988 | Wiley | Dec 2016 | B1 |
9553635 | Sejpal | Jan 2017 | B1 |
9680666 | Wiley | Jun 2017 | B2 |
9711041 | Wiley et al. | Jul 2017 | B2 |
20020064247 | Ahn et al. | May 2002 | A1 |
20020112070 | Ellerbrock et al. | Aug 2002 | A1 |
20020181618 | Muranaka | Dec 2002 | A1 |
20030016758 | Wu | Jan 2003 | A1 |
20030095606 | Horowitz | May 2003 | A1 |
20030117184 | Fecteau | Jun 2003 | A1 |
20040000924 | Best et al. | Jan 2004 | A1 |
20040039504 | Coffee et al. | Feb 2004 | A1 |
20040196076 | Ko | Oct 2004 | A1 |
20050012492 | Mihalka | Jan 2005 | A1 |
20050053171 | Pickering | Mar 2005 | A1 |
20050144225 | Anderson et al. | Jun 2005 | A1 |
20050151868 | Fraenkel et al. | Jul 2005 | A1 |
20050156755 | Miller | Jul 2005 | A1 |
20050204057 | Anderson | Sep 2005 | A1 |
20060034326 | Anderson et al. | Feb 2006 | A1 |
20060061494 | Hosaka | Mar 2006 | A1 |
20060192697 | Quick et al. | Aug 2006 | A1 |
20060274852 | Trachewsky et al. | Dec 2006 | A1 |
20070030881 | Nishio | Feb 2007 | A1 |
20070160155 | Choi | Jul 2007 | A1 |
20070164883 | Furtner | Jul 2007 | A1 |
20070164884 | Ihs | Jul 2007 | A1 |
20070192541 | Balasubramonian et al. | Aug 2007 | A1 |
20080036526 | Wu et al. | Feb 2008 | A1 |
20080212709 | Wiley | Sep 2008 | A1 |
20080219252 | Narasimhaprasad | Sep 2008 | A1 |
20090082056 | Iwanaga et al. | Mar 2009 | A1 |
20090195699 | Hamada | Aug 2009 | A1 |
20090225873 | Lee | Sep 2009 | A1 |
20100027706 | Tanimoto | Feb 2010 | A1 |
20100215118 | Ware et al. | Aug 2010 | A1 |
20100235673 | Abbasfar | Sep 2010 | A1 |
20100309964 | Oh | Dec 2010 | A1 |
20110084737 | Oh et al. | Apr 2011 | A1 |
20110138210 | Belali et al. | Jun 2011 | A1 |
20110268225 | Cronie | Nov 2011 | A1 |
20110294359 | Cho et al. | Dec 2011 | A1 |
20110299555 | Cronie et al. | Dec 2011 | A1 |
20110302478 | Cronie et al. | Dec 2011 | A1 |
20120051241 | Mori et al. | Mar 2012 | A1 |
20120135696 | Lerzer et al. | May 2012 | A1 |
20120155565 | Wiley | Jun 2012 | A1 |
20120230626 | Metz et al. | Sep 2012 | A1 |
20130051162 | Amirkhany et al. | Feb 2013 | A1 |
20130215991 | Wiley | Aug 2013 | A1 |
20140003543 | Wiley | Jan 2014 | A1 |
20140112401 | Wiley | Apr 2014 | A1 |
20140153665 | Wiley | Jun 2014 | A1 |
20140254732 | Sengoku | Sep 2014 | A1 |
20140254733 | Sengoku | Sep 2014 | A1 |
20140270026 | Sengoku | Sep 2014 | A1 |
20150043358 | Wiley | Feb 2015 | A1 |
20150074673 | Tohzaka et al. | Mar 2015 | A1 |
20150236844 | Pan et al. | Aug 2015 | A1 |
20160034416 | Chavez et al. | Feb 2016 | A1 |
20160036916 | Takeda et al. | Feb 2016 | A1 |
20160041941 | Kessler et al. | Feb 2016 | A1 |
20160099817 | Wiley | Apr 2016 | A1 |
20160156457 | Wiley | Jun 2016 | A1 |
20170026083 | Sejpal | Jan 2017 | A1 |
20170041130 | Wiley | Feb 2017 | A1 |
20170309167 | Wiley | Oct 2017 | A1 |
20180006846 | Wiley | Jan 2018 | A1 |
Number | Date | Country |
---|---|---|
1406008 | Mar 2003 | CN |
1871635 | Nov 2006 | CN |
101171776 | May 2011 | CN |
1207649 | May 2002 | EP |
2000353035 | Dec 2000 | JP |
2002199032 | Jul 2002 | JP |
2005518733 | Jun 2005 | JP |
WO-9202988 | Feb 1992 | WO |
WO-03071812 | Aug 2003 | WO |
WO-2005041164 | May 2005 | WO |
WO-08109478 | Sep 2008 | WO |
WO-2008109478 | Sep 2008 | WO |
WO-2009111208 | Sep 2009 | WO |
WO-2011134678 | Nov 2011 | WO |
WO-2011151469 | Dec 2011 | WO |
WO-2012089803 | Jul 2012 | WO |
Entry |
---|
Hsueh, “Crosstalk Suppression Technique for Multi-Wire High-Speed I/O Links,” ProQuest Dissertations and Theses; 2010; UCLA, 189 pages. |
International Search Report and Written Opinion—PCT/US2008/055566, International Search Authority—European Patent Office—dated Nov. 24, 2008. |
Poulton J W., et al., “Multiwire Differential Signaling”, 20030806 No. 1.1 Aug. 6, 2003 {Aug. 6, 2003), pp. 1-20, XP002610849, Retrieved from the Internet: URL:http://www.cs.unc.eduf-jpfmwire.pdf [retrieved on Nov. 23, 2010] the whole document. |
Sevanto, J., “Multimedia messaging service for GPRS and UMTS”, IEEE on WCNC, Sep. 1999, pp. 1422-1426, vol. 3. |
Zheng, “Skew compensation techniques for multi-gigabit wire-line data communications,” Dissertation, The University of Texas at Dallas, 2010, 126 pages. |
Zogopoulos, “A Low-Power High-Speed Single-Ended Parallel Link Using Three-Level Differential Encoding,” USC, Dissertation, May 2007, 92 pages. |
Number | Date | Country | |
---|---|---|---|
20180006851 A1 | Jan 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15013003 | Feb 2016 | US |
Child | 15703878 | US | |
Parent | 14796207 | Jul 2015 | US |
Child | 15013003 | US | |
Parent | 13826546 | Mar 2013 | US |
Child | 14796207 | US | |
Parent | 13301454 | Nov 2011 | US |
Child | 13826546 | US | |
Parent | 11712941 | Mar 2007 | US |
Child | 13301454 | US |