US20190229749A1 - Maximum transition avoidance (mta) encoding - Google Patents

Maximum transition avoidance (mta) encoding Download PDF

Info

Publication number
US20190229749A1
US20190229749A1 US16/124,085 US201816124085A US2019229749A1 US 20190229749 A1 US20190229749 A1 US 20190229749A1 US 201816124085 A US201816124085 A US 201816124085A US 2019229749 A1 US2019229749 A1 US 2019229749A1
Authority
US
United States
Prior art keywords
pam
burst
bit
bits
data line
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US16/124,085
Other versions
US10491238B2 (en
Inventor
Sunil SUDHAKARAN
Russ Newcomb
Rohit Rathi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nvidia Corp
Original Assignee
Nvidia Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nvidia Corp filed Critical Nvidia Corp
Priority to US16/124,085 priority Critical patent/US10491238B2/en
Assigned to NVIDIA CORP. reassignment NVIDIA CORP. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: RATHI, ROHIT, NEWCOMB, RUSS, SUDHAKARAN, SUNIL
Publication of US20190229749A1 publication Critical patent/US20190229749A1/en
Priority to US16/557,637 priority patent/US10594337B2/en
Priority to DE102019123711.4A priority patent/DE102019123711A1/en
Application granted granted Critical
Publication of US10491238B2 publication Critical patent/US10491238B2/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00Conversion of the form of the representation of individual digits
    • H03M5/02Conversion to or from representation by pulses
    • H03M5/04Conversion to or from representation by pulses the pulses having two levels
    • H03M5/14Code representation, e.g. transition, for a given bit cell depending on the information in one or more adjacent bit cells, e.g. delay modulation code, double density code
    • H03M5/145Conversion to or from block codes or representations thereof
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00Conversion of the form of the representation of individual digits
    • H03M5/02Conversion to or from representation by pulses
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00Conversion of the form of the representation of individual digits
    • H03M5/02Conversion to or from representation by pulses
    • H03M5/04Conversion to or from representation by pulses the pulses having two levels
    • H03M5/06Code representation, e.g. transition, for a given bit cell depending only on the information in that bit cell
    • H03M5/08Code representation by pulse width
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00Conversion of the form of the representation of individual digits
    • H03M5/02Conversion to or from representation by pulses
    • H03M5/20Conversion to or from representation by pulses the pulses having more than three levels
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/46Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind

Abstract

A PAM-4 communication process divides a full burst of raw data into two half bursts, extracts a bit from each half burst and communicating the extracted bit on a DBI line, and encodes the remaining bits of the half burst to avoid maximum transitions between PAM-4 symbols on a data line.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application claims benefit under 35 U.S.C. 119 to U.S. application Ser. No. 62/621,056, entitled “MAXIMUM TRANSITION AVOIDANCE (MTA) ENCODING”, filed on Jan. 24, 2018, which is incorporated herein by reference in its entirety.
  • BACKGROUND
  • PAM-4 signaling (4 levels) is being proposed for future graphic memory interfaces as a way to increase communication bandwidth between memory and other system components, such as central processing units (CPUs) and graphics processing units (GPUs). Due to its use of >2 voltage level signals, PAM-4 is more susceptible to noise introduced from ISI and crosstalk than are binary voltage level techniques such as PAM-2.
  • In telecommunication, inter-symbol interference (ISI) is a form of distortion of a signal in which one symbol interferes with subsequent symbols. This is a disruptive phenomenon as the previous symbols have a similar effect as noise, thus making the communication less reliable.
  • Crosstalk is any phenomenon by which a signal transmitted on one circuit or channel of a transmission system creates an undesired effect in another circuit or channel. Crosstalk is usually caused by undesired capacitive, inductive, or conductive coupling from one circuit or channel to another.
  • There is therefore a need for encoding that reduce the effects of ISI and crosstalk in PAM-4 systems.
  • BRIEF SUMMARY
  • Techniques are disclosed to reduce ISA and crosstalk in PAM-4 signaling systems. These techniques utilize Maximum Transition Avoidance (MTA) to eliminate maximum voltage transitions between PAM-4 symbols on the data lines. The DBI line of a PAM-4 bus is utilized to communicate encoded symbols, and a half-burst technique is applied to encode and communicate the PAM-4 symbols on the data lines.
  • BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
  • To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the figure number in which that element is first introduced.
  • FIG. 1 illustrates a data communication system 100 in accordance with one embodiment.
  • FIG. 2 illustrates an embodiment of a 7-8 bit encoding 200.
  • FIG. 3 illustrates an embodiment of a 7-8 bit encoding 300.
  • FIG. 4 illustrates an embodiment of an encoding architecture 400.
  • FIG. 5 illustrates an encoding process 500 in accordance with one embodiment.
  • FIG. 6 illustrates an embodiment of a decoding architecture 600.
  • FIG. 7 illustrates a decoding process 700 in accordance with one embodiment.
  • FIG. 8 illustrates an embodiment of a 7-8 bit codebook 800.
  • FIG. 9 illustrates an embodiment of an eye diagram 900.
  • FIG. 10 illustrates an embodiment of an eye diagram 1000.
  • DETAILED DESCRIPTION
  • Referring to FIG. 1, a data communication system 100 comprises a data processor 102 that includes comprises a processing core 114, PAM-4 symbol encoder 104, and a PAM-4 transmitter 108. The data processor 102 may in some embodiments comprise a GPU, a CPU, a system on a chip (SoC), or other well-known data processing systems and devices. The data processor 102 communicates with a GDDR memory 112 over a memory bus 118. A PAM-4 receiver 110 and PAM-4 symbol decoder 106 receive and process PAM-4 signals communicated from the data processor 102 to the GDDR memory 112 over the memory bus 118.
  • The data processor 102 utilizes an internal data bus 116 to transmit data bursts to and from the processing core 114. The PAM-4 symbol encoder 104 receives a burst to encode from the processing core 114 and performs encoding on that burst. The PAM-4 transmitter 108 transmits the encoded burst to the PAM-4 receiver 110 via the memory bus 118. The PAM-4 receiver 110 receives the encoded burst and sends the encoded burst to the PAM-4 symbol decoder 106 to decode the burst. Once decoded, the burst is sent to the GDDR memory 112.
  • This is a simplified diagram. In practice, there would typically be encoders and decoders on both ends of the memory bus 118 for both writing to and reading from the GDDR memory 112.
  • FIG. 2 illustrates an embodiment of 7-8 bit encoding 200. For both the raw data 202 and the encoded data 204, each row DQ[i] represents a serial data line. In the raw data 202 the columns are sequential 2-bit positions in 16-bit data bursts. For example, the second and third bits of each data burst are represented in the column labeled d[2:3]. Each data burst is represented on each serial data line DQ as two ½ bursts of 8-bits each. For example, on serial data line DQ[0], the 16-bit data burst is divided into a first ½ burst d0[O]d0[7:1] and a second ½ burst d0[8]d0[15:9]. Each ½ burst is further divided into a 1-bit:7-bit pair. For example, on serial data line DQ[0] the first ½ burst d0[0]d0[7:1] is divided into the 1-bit value d0[0] and the 7-bit value d0[7:1]. The raw data is not actually transmitted on the serial data line, and the depictions of raw data in FIG. 2 and FIG. 3 are merely to show how the raw data is divided up for encoding.
  • Referring now to the encoded data 204, the rows are once again the serial data lines, but now the columns are bit strings representing symbols. For example, s[0] represents the first 2-bit PAM-4 symbol on each serial data line, s[1] represents the second 2-bit PAM-4 symbol on each serial data line, and so on. The 7-8 bit encoding 200 encodes pairs of the 1-bit raw data values from different serial data lines as PAM-4 symbols on the DBI serial data path. The remaining 7-bits of each ½ data burst are encoded into four PAM-4 symbols (8-bits, called herein a codeword) on the corresponding serial data line. For example, d0[7:1] is encoded as codeword c0[7:0] on DQ[0]. The codeword for each 7-bits of raw data represent four PAM-4 symbols. The mapping of 7-bit raw data values into codewords is performed according to an algorithm/mapping that avoids maximum transitions between the PAM-4 domain voltage levels generated for the codewords on the serial data lines. An embodiment of this algorithm/mapping is described in more detail below.
  • The 7-8 bit encoding 200 and 7-8 bit encoding 300 illustrate an implementation in which the first bit of each ½ burst is encoded into a symbol on the DBI serial data line. In the exemplary encoded data 204, d0[0] and d1[0] are encoded as a 2-bit PAM-4 symbol on the DBI serial data line. Likewise, d2[0] and d3[0] are encoded as a 2-bit PAM-4 symbol on the DBI serial data line, and so on. FIG. 3 illustrates a different 7-8 bit encoding 300 embodiment to generate encoded data 302, in which d0[0] and d0[8] are encoded as a 2-bit PAM-4 symbol on the DBI serial data line, d1[0] and d1[8] are encoded as a 2-bit PAM-4 symbol on the DBI serial data line, and so on. In general, any pairing of the 1-bit values from the serial data lines (referred to herein as interleaving) may be utilized to form the PAM-4 symbols on the DBI serial data line. In general, any bit position from each ½ burst may be the 1-bit value that is encoded into a symbol on the DBI serial data line, not just bit 0 and/or bit 8 as illustrated herein for example.
  • The following mapping table is used in the following description to describe the codewords. This is merely one non-limiting example for purposes of illustration.
  • Code
    −3 −1 +1 +3
    Symbol bits 00 01 11 10
    Line voltage (as 50% 66% 83% 100%
    % of supply
    voltage)
  • For any given ½ burst there are 139 PAM-4 codewords that do not have internal −3 to +3 transitions and that have a pattern of {+3,+1,−1} or {−3,−1,+1}. Because only 7-bits or each ½ burst are encoded, only 128 of the 139 possible codewords with these transitions are needed to implement the maximum transition avoidance techniques described herein.
  • In one embodiment the encoder assumes that the final (4th) symbol of the previous codeword is +3, +1, or −1 (but cannot be −3), and the following codeword is inverted if the most significant bit (MSB) of the previous codeword is 1. In this description the MSB of the final symbol of the first codeword of a pair of codewords for a full raw data burst is denoted by cx[0] and the MSB of the second codeword is denoted by cx[8], where x is the number of the serial data line DQ on which the codeword is transmitted or received.
  • These techniques avoid a maximum transition event (+3=>−3 or −3=>+3) between blocks of symbols. In one embodiment, the data bus idles at +3 so that the first symbol of an encoded block can be +3, +1, −1 but not −3. However there is no restriction on the values of the last symbol of an encoded block, and thus the last symbol in an encoded block can in theory be at −3, −1, +1 or +3. The encoding selectively inverts the symbols at block boundaries to avoid a −3 to +3 transition at the block boundaries. There are four possible symbols at the end of an encoded block: −3, −1, +1, +3. If the last symbol of the present encoded block is +1 or +3 (MSB a “1”) then the next block is transmitted using the regular encoding table. If the last symbol of the present encoding block is a −3 or −1 (“MSB a “0”) then the encoder applies complements of the output of the encoding block.
  • The handling of certain boundary cases is further described below.
  • The symbols placed on the DBI serial data line may have +3/−3 transitions with this technique and should be physically spaced from the data lines to an extent to avoid interference effects on the data.
  • FIG. 4 depicts an encoding architecture 400 comprising an encoder block 402 that includes a 7:8 encoder 404 an XNOR bank 406, and a delay 408 for serial data line DQ[0], and an encoder block 410 comprising a 7:8 encoder 412, an XNOR bank 414, and a delay 416 for serial data line DQ[1]. A splitter 420 divides the bits at the input of encoder block 402, and a splitter 422 divides the bits at the input of encoder block 410. A splitter 424 divides the bits at the output of encoder block 402, and a splitter 426 divides the bits at the output of encoder block 410. This structure repeats for other data lines, which are not depicted for purposes of simplifying the description. The encoding architecture 400 also includes an interleave 418.
  • In one embodiment each XNOR bank comprises eight 2-input XNOR gates (the decoder embodiment shown in FIG. 6 uses the same structure) to selectively invert bits of a codeword that differ from the MSB of the immediately previous codeword that was sent or received. Each XNOR gate has a first input that is the MSB and a second input that is a bit from the codeword being operated on.
  • The encoding architecture 400 may operate in accordance with the encoding process 500 illustrated in FIG. 5.
  • Referring to FIG. 5, an encoding process 500 receives a 16-bit burst for each line (block 502). In some embodiments, there are eight lines. The 16-bit burst is split into two 8-bit half-bursts (block 504). One bit of each half-burst for each line is then sent to an interleave (block 506) to be interleaved with similar bits from other data lines (block 508). The interleaved bits are then sent along the DBI line as PAM-4 symbols to the receiver (block 510).
  • The remaining 7-bit half-bursts are 7:8-bit encoded (block 512). A codebook may be utilized to perform the 7:8-bit encoding. The most significant bit (MSB) of the previous code word is determined (block 514). If the MSB is “1” (decision block 516), then the code word is inverted (block 518). The MSB of the current code word is stored for use with the next code word (block 520). The code words are then sent along the line as multi-level PAM-4 symbols (block 522). The encoding process 500 then ends (done block 524).
  • FIG. 6 shows a decoding architecture 600 corresponding to the encoding architecture 400 of FIG. 4. The decoding architecture 600 comprises a decoder block 602 for DQ[0] that includes an 8:7 decoder 608, an XNOR bank 604, a delay 606, and an interleave 610. A splitter 622 splits the input data signal to the decoder block 602. The decoder block 612 for DQ[1] likewise includes an 8:7 decoder 616, an XNOR bank 614, a delay 618, and an interleave 620. A splitter 624 splits the input data signal to the decoder block 612. A splitter 626 splits the input DBI signal to the interleavers. A similar structure is repeated for the data lines that aren't illustrated.
  • The decoding architecture 600 may operate in accordance with the decoding process 700 illustrated in FIG. 7.
  • Referring to FIG. 7, a decoding process 700 receives the code word on a data line (block 702). The decoding process 700 determines whether the MSB of the previous code word is a “1” (decision block 704). If so, the current code word being processed is inverted (block 706). Once inverted or if no inversion is performed, 8:7 decoding is performed on the code word to recover the half-burst (block 708). The interleaved bits from the DBI line are received (block 710) and split off to the corresponding data lines (block 712), (block 714). The DBI bits are re-combined with their associated half-burst (block 716). The half-bursts for each line are then combined into the full burst for that line (block 718).
  • FIG. 8 illustrates an exemplary 7-8 bit codebook 800 and inverted codebook 806. The 7-8 bit codebook 800 illustration shows input data 802 and its mapping to code words 804. Each 7-bits half-burst of the input data 802 is mapped to an 8-bit value in the code words 804 by the 7:8 encoding. The inverted codebook 806 may be used to encode the input data 802 when the MSB of the previous code word was set to “1”, as previously described. Whether or not an inverted codebook 806 is used, or whether the code word from the 7-8 bit codebook 800 is inverted using logic gates such as an XNOR bank 406, is a design choice based on required performance, circuit area, and possibly other considerations.
  • The 7-8 bit codebook 800 is generated to utilize transitions that avoid +3<−>−3 (maximum transitions). Using recurrence relations:
      • a[i]: number of PAM-4 symbol sequences which end in −3
      • b[i]: number of PAM-4 symbol sequences which end in −1
      • c[i]: number of PAM-4 symbol sequences which end in +1
      • d[i]: number of PAM-4 symbol sequences which end in +3
  • Then, the recurrence relations are as follows. The a and d terms only include three relations as −3−>+3 and +3−>−3 are not utilized.
      • a[i]=a[i−1]+b[i−1]+c[i−1]
      • b[i]=a[i−1]+b[i−1]+c[i−1]+d[i−1]
      • c[i]=a[i−1]+b[i−1]+c[i−1]+d[i−1]
      • d[i]=b[i−1]+c[i−1]+d[i−1]
  • There are 139 possibilities for code words that do not result in +3/−3 transitions. From these, 128 are chosen as entries in the 7-8 bit codebook 800. There are two cases to consider when applying the codebook.
  • Case I: MSB of last symbol=1
  • Case II: MSB of symbol=0.
  • For Case I the last symbol of the burst is either +1 or +3, thus the first symbol of the subsequent burst should be restricted to {+3,+1,−1}. For Case II, the last symbol is either −3 or −1 and thus the subsequent first symbol is restricted to {−3,−1,+1}. It is unnecessary to maintain two separate code books, and sufficient to invert the codebook for different cases (e.g., where original case is MSB=0 and inverted case is MSB=1).
  • One way to study ISI in a data transmission system experimentally is to apply the received wave to the vertical deflection plates of an oscilloscope and to apply a sawtooth wave at the transmitted symbol rate R (R=1/T) to the horizontal deflection plates. The resulting display is called an eye pattern because of its resemblance to the human eye. The interior region of the eye pattern is called the eye opening. An eye pattern provides a great deal of information about the performance of the system. It is a tool for the evaluation of the combined effects of channel noise and inter-symbol interference on the performance on the transmission system. It is the synchronized superposition of all possible realizations of the signal of interest viewed within a particular signaling interval.
      • 1. The width of the eye opening defines the time interval over which the received wave can be sampled without error from ISI. The preferred time for sampling is the instant of time at which the eye is open widest.
      • 2. The sensitivity of the system to timing error is determined by the rate of closure of the eye as the sampling time is varied.
      • 3. The height of the eye opening, at a specified sampling time, defines the margin over noise.
  • The noise margin—the amount of noise required to cause the receiver to get an error—is given by the distance between the signal and the zero-amplitude point at the sampling time; in other words, the further from zero at the sampling time the signal is the better. For the signal to be correctly interpreted, it must be sampled somewhere between the two points where the zero-to-one and one-to-zero transitions cross. Again, the further apart these points are the better, as this means the signal will be less sensitive to errors in the timing of the samples at the receiver.
  • Referring to FIG. 9 and FIG. 10, the techniques described herein enlarge the upper and lower eyes (eye diagram 900, eye diagram 1000) for PAM-4 transmissions over approaches that do not utilize the MTA encoding. The center eye may also enlarge depending on the positioning of the ISI cursors. Eye enlargement may be greater for frequencies above 20 Gbps.

Claims (17)

What is claimed is:
1. A PAM-4 communication process comprising:
dividing a full burst of raw data on at least one data line into two half bursts;
extracting a bit from each half burst and communicating the extracted bits on a DBI line; and
encoding the remaining bits of the half burst to avoid maximum transitions between PAM-4 symbols on the data line.
2. The PAM-4 communication process of claim 1, wherein the full burst is 16-bits and each half burst is 8-bits.
3. The PAM-4 communication process of claim 2, wherein 7-bits of each half burst are encoded into an eight bit code word representing four PAM-4 symbols on the data line.
4. The PAM-4 communication process of claim 1, wherein the extracted bits are encoded as a PAM-4 symbol on the DBI line.
5. The PAM-4 communication process of claim 4, wherein an extracted bit from a first half burst on a particular data line is combined with an extracted bit from a second half burst on the particular data line to form the PAM-4 symbol on the DBI line.
6. The PAM-4 communication process of claim 4, wherein an extracted bit from a half burst on a first data line is combined with an extracted bit from a half burst on a different data line to form the PAM-4 symbol on the DBI line.
7. The PAM-4 communication process of claim 1, wherein the extracted bits are the least significant bit of each of the half bursts.
8. The PAM-4 communication process of claim 1, further comprising:
inverting a codebook used to encode the remaining bits of a second half burst when a most significant bit of a symbol of a first half burst has a predetermined value.
9. A transmitter for a data bus, the transmitter comprising:
a splitter to divide a full burst of raw data on at least one data line into two half bursts, and to extract a bit from each half burst for communication on a DBI line; and
an encoder configured to encode the remaining bits of the half burst to avoid maximum transitions between PAM-4 symbols on the data line.
10. The transmitter of claim 9, wherein the full burst is 16-bits and each half burst is 8-bits.
11. The transmitter of claim 10, wherein the encoder is configured to encode 7-bits of each half burst into an eight bit code word representing four PAM-4 symbols on the data line.
12. The transmitter of claim 9, further comprising an interleaver to encode the extracted bits as a PAM-4 symbol on the DBI line.
13. The transmitter of claim 12, wherein the encoder is configured to encode the extracted bit from a first half burst on a particular data line with the extracted bit from a second half burst on the particular data line to form the PAM-4 symbol on the DBI line.
14. The transmitter of claim 12, wherein the encoder is configured to encode the extracted bit from a half burst on a first data line with the extracted bit from a half burst on a different data line to form the PAM-4 symbol on the DBI line.
15. The transmitter of claim 9, wherein the extracted bit is the least significant bit of the half burst.
16. The transmitter of claim 9, wherein the encoder is configured to invert a codebook used to encode the remaining bits of a second half burst when a most significant bit of a symbol of a first half burst has a predetermined value.
17. A decoder comprising:
a splitter to extract one bit each from two received half bursts;
a decoder;
a delay to cause the extracted bits to be received by the decoder after a delay from receiving the two half bursts; and
an interleaver to combine data output from the decoder with bits received on a DBI line.
US16/124,085 2018-01-24 2018-09-06 Maximum transition avoidance (MTA) encoding Active US10491238B2 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US16/124,085 US10491238B2 (en) 2018-01-24 2018-09-06 Maximum transition avoidance (MTA) encoding
US16/557,637 US10594337B2 (en) 2018-01-24 2019-08-30 Maximum transition avoidance (MTA) encoding
DE102019123711.4A DE102019123711A1 (en) 2018-01-24 2019-09-04 CODING TO AVOID MAXIMUM TRANSITIONS

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862621056P 2018-01-24 2018-01-24
US16/124,085 US10491238B2 (en) 2018-01-24 2018-09-06 Maximum transition avoidance (MTA) encoding

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/557,637 Division US10594337B2 (en) 2018-01-24 2019-08-30 Maximum transition avoidance (MTA) encoding

Publications (2)

Publication Number Publication Date
US20190229749A1 true US20190229749A1 (en) 2019-07-25
US10491238B2 US10491238B2 (en) 2019-11-26

Family

ID=67300253

Family Applications (2)

Application Number Title Priority Date Filing Date
US16/124,085 Active US10491238B2 (en) 2018-01-24 2018-09-06 Maximum transition avoidance (MTA) encoding
US16/557,637 Active 2038-09-08 US10594337B2 (en) 2018-01-24 2019-08-30 Maximum transition avoidance (MTA) encoding

Family Applications After (1)

Application Number Title Priority Date Filing Date
US16/557,637 Active 2038-09-08 US10594337B2 (en) 2018-01-24 2019-08-30 Maximum transition avoidance (MTA) encoding

Country Status (2)

Country Link
US (2) US10491238B2 (en)
DE (1) DE102019123711A1 (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210234732A1 (en) * 2020-01-27 2021-07-29 Micron Technology, Inc. Postamble for multi-level signal modulation
US11218343B2 (en) * 2020-06-02 2022-01-04 Samsung Electronics Co., Ltd. Memory device and memory system including the same
EP4057515A1 (en) * 2021-03-10 2022-09-14 Samsung Electronics Co., Ltd. Devices and methods for encoding and decoding
EP4057516A1 (en) * 2021-03-10 2022-09-14 Samsung Electronics Co., Ltd. Encoding and decoding apparatuses and methods for implementing multi-mode coding
CN115277283A (en) * 2021-04-29 2022-11-01 迈络思科技有限公司 Redundant data bus inversion sharing
US20220350512A1 (en) * 2021-05-03 2022-11-03 Micron Technology, Inc. Masked training and analysis with a memory array
WO2023288178A1 (en) * 2021-07-14 2023-01-19 Micron Technology, Inc. Array access with receiver masking
WO2023122445A1 (en) * 2021-12-20 2023-06-29 Nvidia Corporation Techniques for data scrambling on a memory interface

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11159153B2 (en) * 2018-03-29 2021-10-26 Nvidia Corp. Data bus inversion (DBI) on pulse amplitude modulation (PAM) and reducing coupling and power noise on PAM-4 I/O
US11966348B2 (en) 2019-01-28 2024-04-23 Nvidia Corp. Reducing coupling and power noise on PAM-4 I/O interface
KR20220086904A (en) 2020-12-17 2022-06-24 삼성전자주식회사 Method for transmitting data and data transmitting device
US11894099B2 (en) 2020-12-28 2024-02-06 Micron Technology, Inc. Programmable memory timing
KR20220140234A (en) 2021-04-09 2022-10-18 삼성전자주식회사 Signal Encoding Method and Semiconductor Device to Generate Optimal Transition code in a Multi-level Signaling System

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7260155B2 (en) * 2001-08-17 2007-08-21 Synopsys, Inc. Method and apparatus for encoding and decoding digital communications data
US7620116B2 (en) * 2003-02-28 2009-11-17 Rambus Inc. Technique for determining an optimal transition-limiting code for use in a multi-level signaling system
US7561624B2 (en) * 2004-11-22 2009-07-14 Fonseka John P Multi-interval line coding for high speed data communication
US11159153B2 (en) * 2018-03-29 2021-10-26 Nvidia Corp. Data bus inversion (DBI) on pulse amplitude modulation (PAM) and reducing coupling and power noise on PAM-4 I/O
US10599606B2 (en) * 2018-03-29 2020-03-24 Nvidia Corp. 424 encoding schemes to reduce coupling and power noise on PAM-4 data buses

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11870616B2 (en) * 2020-01-27 2024-01-09 Micron Technology, Inc. Postamble for multi-level signal modulation
US20210234732A1 (en) * 2020-01-27 2021-07-29 Micron Technology, Inc. Postamble for multi-level signal modulation
US11627021B2 (en) * 2020-06-02 2023-04-11 Samsung Electronics Co., Ltd. Data processing device and memory system including the same
US11218343B2 (en) * 2020-06-02 2022-01-04 Samsung Electronics Co., Ltd. Memory device and memory system including the same
TWI760199B (en) * 2020-06-02 2022-04-01 南韓商三星電子股份有限公司 Memory device and memory system including the same
US20220123967A1 (en) * 2020-06-02 2022-04-21 Iucf-Hyu (Industry-University Cooperation Foundation Hanyang University) Data processing device and memory system including the same
EP4057515A1 (en) * 2021-03-10 2022-09-14 Samsung Electronics Co., Ltd. Devices and methods for encoding and decoding
EP4057516A1 (en) * 2021-03-10 2022-09-14 Samsung Electronics Co., Ltd. Encoding and decoding apparatuses and methods for implementing multi-mode coding
US11824563B2 (en) 2021-03-10 2023-11-21 Samsung Electronics Co., Ltd. Encoding and decoding apparatuses and methods for implementing multi-mode coding
TWI814271B (en) * 2021-03-10 2023-09-01 南韓商三星電子股份有限公司 Encoding and decoding apparatus
CN115277283A (en) * 2021-04-29 2022-11-01 迈络思科技有限公司 Redundant data bus inversion sharing
CN115292217A (en) * 2021-05-03 2022-11-04 美光科技公司 Mask training and analysis with memory arrays
US11500561B1 (en) * 2021-05-03 2022-11-15 Micron Technology, Inc. Masked training and analysis with a memory array
US20220350512A1 (en) * 2021-05-03 2022-11-03 Micron Technology, Inc. Masked training and analysis with a memory array
US11954342B2 (en) 2021-05-03 2024-04-09 Micron Technology, Inc. Masked training and analysis with a memory array
WO2023288178A1 (en) * 2021-07-14 2023-01-19 Micron Technology, Inc. Array access with receiver masking
US11907119B2 (en) 2021-07-14 2024-02-20 Micron Technology, Inc. Array access with receiver masking
WO2023122445A1 (en) * 2021-12-20 2023-06-29 Nvidia Corporation Techniques for data scrambling on a memory interface

Also Published As

Publication number Publication date
US10491238B2 (en) 2019-11-26
US10594337B2 (en) 2020-03-17
DE102019123711A1 (en) 2020-03-12
US20190386677A1 (en) 2019-12-19

Similar Documents

Publication Publication Date Title
US10491238B2 (en) Maximum transition avoidance (MTA) encoding
CN106576087B (en) Orthogonal differential vector signaling code with embedded clock
US5144304A (en) Data and forward error control coding techniques for digital signals
US8649460B2 (en) Techniques for multi-wire encoding with an embedded clock
US7098817B2 (en) Methods and apparatus for constant-weight encoding and decoding
KR101483535B1 (en) Coding system for memory systems employing high-speed serial links
US5691993A (en) Rate 4/5 trellis code for PR4 channels with improved error propagation
US7495587B2 (en) Low power balance code using data bus inversion
US10491435B2 (en) Unrelaxed 433 encoding to reduce coupling and power noise on PAM-4 data buses
US20150249559A1 (en) Clock-Embedded Vector Signaling Codes
CN101599811B (en) Data processing device, communication equipment and data processing method
US10599606B2 (en) 424 encoding schemes to reduce coupling and power noise on PAM-4 data buses
WO2009086078A1 (en) Receiver for multi-wire communication with reduced input capacitance
RU2011104005A (en) METHOD FOR CODING SYMBOLS, METHOD FOR DECODING SYMBOLS, METHOD FOR TRANSFER OF SYMBOLS FROM THE TRANSMITTER TO THE RECEIVER, CODER, DECODER AND SYSTEM FOR TRANSFER OF SYMBOLS FROM THE TRANSMITTER TO THE RECEIVER
US10657094B2 (en) Relaxed 433 encoding to reduce coupling and power noise on PAM-4 data buses
US11966348B2 (en) Reducing coupling and power noise on PAM-4 I/O interface
CN110471876A (en) A kind of ultrahigh speed serial data channel system
EP4057515B1 (en) Devices for encoding
AU618680B2 (en) Data and forward error control coding techniques for digital signals
KR102223031B1 (en) Differential signal processing device using for advanced braid clock signaling
US7064683B1 (en) Speed optimized encoder with running disparity constraint
US6829315B1 (en) Alignment of parallel data channels using header detection signaling
EP4057516B1 (en) Encoding apparatuses for implementing multi-mode coding
TW202324040A (en) Transition encoder and method for transition encoding with reduced error propagation
KR20220127113A (en) Apparatuses and methods for encoding and decoding to implement maximun transition avoidance(MTA) coding with minimum overhead

Legal Events

Date Code Title Description
FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

AS Assignment

Owner name: NVIDIA CORP., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SUDHAKARAN, SUNIL;NEWCOMB, RUSS;RATHI, ROHIT;SIGNING DATES FROM 20181024 TO 20190306;REEL/FRAME:048799/0233

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: EX PARTE QUAYLE ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO EX PARTE QUAYLE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4