|Publication number||US5481555 A|
|Application number||US 08/206,914|
|Publication date||Jan 2, 1996|
|Filing date||Mar 7, 1994|
|Priority date||Jun 29, 1990|
|Also published as||CA2044051A1, DE4121444A1|
|Publication number||08206914, 206914, US 5481555 A, US 5481555A, US-A-5481555, US5481555 A, US5481555A|
|Inventors||Paul C. Wade, Samuel H. Duncan, Donald W. Smelser|
|Original Assignee||Digital Equipment Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (23), Non-Patent Citations (4), Referenced by (42), Classifications (20), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This is a continuation of application Ser. No. 07/546,245 filed Jun. 29, 1990, now abandoned.
The present invention relates generally to systems and methods that are used to reduce the amount of noise caused by simultaneously switching output pins of digital integrated circuit chips. More specifically, the present invention relates to systems and methods that are used to reduce the amount of noise caused by simultaneously switching output pins of digital integrated circuit chips and that also provide multiple types of error detection.
In the evolutionary development of digital integrated circuit ("IC") chips, their capabilities have improved dramatically. These improvements include a sharp increase in the speed at which these IC chips process data. Coupled with these improvements is a decrease in the package size of these chips.
One of the problems that has affected the operation of advanced digital IC chips is simultaneous switching noise. This noise is generated by a chip's output pins switching from a driving current to a sinking current or vice-versa in a very short period of time, for instance in 1-3 ns (nanoseconds). Thus, the greater the number of output pins that simultaneously switch in this short period of time, the greater the noise level. When this simultaneous switching noise becomes great enough, it may cause data transmission errors.
Simultaneous switching noise was not a critical problem in older digital IC chip designs because the cycle times were much longer and the switching rise and fall times were slower than those for the advanced digital IC chips. Since the cycle times in these older chip designs were much longer than those in the advanced digital IC chips, output pin switching could be spread out over this long cycle time which greatly reduced the likelihood that simultaneous switching noise would be great enough to cause data transmission errors.
These longer cycle times also lended themselves to other schemes for reducing the chances of generating enough simultaneous switching noise to cause data transmission errors. For example, longer cycle times could be divided into portions that were devoted to just data transmission and others devoted to just switching the output pins. The portions devoted to switching the output pins would be long enough to spread the switching out so that there was only a very small possibility that the simultaneous switching noise would ever reach a level sufficient to cause data transmission errors.
The luxury of long cycle times is not available in advanced digital IC chips. The few nanoseconds during which a requisite number of simultaneously switching output pins may generate a noise level that is sufficient to cause data transmission errors may be 1/2 or more of the cycle time of these advanced chips. Accordingly, there is not a sufficient cycle time to solve the simultaneous switching problem as it was done in older IC chip designs.
Simultaneous switching noise is proportional to the number of output pins that change during a particular short time period. There are situations in which changing from one output pattern to another will necessarily cause the simultaneous switching noise to be at a level high enough to cause data transmission errors. Therefore, there is some pattern dependency for generating data transmission errors. This can only be prevented by reducing the simultaneous switching noises.
There have been a number of suggested solutions to the simultaneous switching noise problem in advanced digital IC chips; however, these solutions either require that the digital IC chip undergo costly reconfiguration, or significantly affect the effective data bandwidth or the speed at which the digital IC chips process information.
One suggestion to reconfigure the digital IC chips is to make all of the output pins differential pins. Hence, each bit is transmitted by two complementary pins so that the net signaling current for that bit is zero. Even though the simultaneous switching noise is reduced and the full transition speeds are allowed, this scheme uses two output pins per bit which cuts the effective data bandwidth in half. Obviously, it will take twice as much time or twice as many output pins to get signals off a chip as it would for a chip configured with single-ended output pins. This solution is not desirable.
Another suggestion is to reconfigure the digital IC chips to include a greater number of ground pins or ensure that the chip has a ground level plane. These have the effect of reducing the inductance at single-ended output pins, and thereby the switching noise. Even when either one of these is provided and the inductance is reduced, there still is a substantial amount of inductance remaining at each output pin. Thus, it simply takes a larger number of simultaneously switching output pins to generate sufficient noise to cause data transmission errors.
Since most systems today are synchronous switching type systems, another suggestion is to wait to sample the output waveform after a time period that ensures that the simultaneous switching noise has died out. Obviously, this necessarily requires lengthening the cycle time which, as stated, is highly undesirable in fast switching parallel system such as advanced digital IC chips.
Another suggested method is simply to spread out the switching time but not to the extent that it was done in older digital IC chip designs. Again, this will require lengthening of the cycle time which is not desired.
In the past, an error detection method was used for long distance transmissions of serial data. According to this method, it is desirable to eliminate the DC component of the transmission. This is done by ensuring that an equal number "1s" and "0s" are transmitted in the serial data over a long period of time--an averaging method. This, however, would not be too effective with fast parallel switching networks of digital IC chips.
There is a need to overcome these problems and provide a system and method for reducing simultaneous switching noise, while at the same time providing effective error detection, all without significantly changing the effective data bandwidth.
The present invention is a system and method for reducing the amount of simultaneous switching noise that may cause data transmission errors and for providing effective error detection.
According to the system and method of the present invention, data signals that are to be output from the output pins of a digital IC chip are encoded so that at every cycle they contain an equal number of "1s" and "0s" allowing the net signaling current to be approximately zero. This reduces the simultaneous switching noise and any delay penalty caused by inductance, thereby minimizing the possibility of causing data transmission errors based on simultaneous switching noise. This is accomplished without substantially increasing the effective data bandwidth and it reduces the number of ground return pins that are required for the chip design.
The system and method of the present invention also incorporate multiple error detection techniques for detecting errors in the encoded transmission and decoded transmission.
The system and method of the present invention is set forth in detail in the remainder of the application and shown in the accompanying drawings.
FIGS. 1A and 1B shows a representative first encoding scheme according to the present invention.
FIGS. 2A and 2B shows a representative second encoding scheme according to the present invention.
FIG. 3 shows a grouping of bits for encoding that includes the low order bits of the word in FIG. 2 and error detection bits.
FIG. 4 shows the bytes of the word in FIG. 2 with their associated error detection bits.
FIGS. 5A and 5B shows a representative third encoding scheme according to the present invention.
FIG. 6 shows a grouping of bits for encoding that includes the low order bits of the word in FIG. 5 and error detection bits.
FIG. 7 shows the bytes of the word in FIG. 5 with their associated error detection bits.
FIG. 8 shows an illustrative embodiment of the present invention.
The present invention is a system and method for reducing the amount of switching noise generated by simultaneously switching outputs and for providing multiple types of error detection.
The system and method of the present invention are useful for digital ICs chips, especially bipolar devices and even more particularly emitter-coupled logic ("ECL") IC chips. According to the present invention, the simultaneous switching noise and the processing delays caused by inductance are reduced by an encoding scheme that results in a net signaling current of about zero at each cycle time for fast parallel switching networks of digital IC chips.
The encoding scheme of the system and method of the present invention is used to encode single-ended output pins of digital IC chips. According to this encoding scheme, each encoded word has an equal number of "1s" and "0s," so there will be an equal number of driving currents and sinking currents, leaving a net signaling current of zero. According to this encoding scheme, the following expressions are applicable:
S=Number of "1s" in the encoded word.
N=Total number of bits in the encoded word.
T=Number of "0s" in the encoded word.
N=Total number of bits in the encoded word.
S=Number of "1s" in the encoded word.
T=Number of "0s" in the encoded word.
Many computers and, therefore, the digital IC chip which are components of those computers, operate on 32-bit words. Hence, for the purpose of discussing the system and method of the present invention, a 32-bit word will be considered the standard length word. It is to be understood that other length words, both longer and shorter, are considered within the scope of the present invention.
The encoding of a binary 32-bit word according to the encoding scheme system and method of the present invention will be discussed referring to Table 1.
TABLE 1______________________________________ No. OfNo. Of Poss. No. OfBits No. of Combos. Combos.To Be Encode Used To Used ToEncoded Bits Eff. Encode Bits Encode Bits______________________________________ 1 2 50% 2 2 2 4 50% 6 4 3 6 50% 20 8 4 6 66% 20 16 5 8 63% 70 32 6 8 75% 70 64 7 10 70% 252 128 8 12 66% 924 256 9 12 75% 924 51210 14 71% 3432 102411 14 79% 3432 204812 16 75% 12870 409613 16 81% 12870 819214 18 78% 48620 1638415 18 83% 48620 3276816 20 75% 184756 6553617 20 85% 184756 13107218 22 82% 705432 26214419 22 86% 705432 52428820 24 83% 2028117 104857621 26 81% 7800450 209715222 26 85% 7800450 419430423 28 83% 30087450 838860824 28 86% 30087450 1677721625 30 83% 116338140 3355443226 30 87% 116338140 6710886427 32 84% 300540195 13421772828 32 89% 300540195 26843545629 34 85% 1166402480 53687091230 34 88% 1166402480 107374182431 36 86% 4536567650 214748364832 36 88% 4536567650 4254967296______________________________________
In Table 1, the first column is the number of bits of the original 32-bit word that are grouped for encoding. That is, the 32-bit word to be encoded may be divided into groupings of bits for purposes of encoding. These bit groupings may range for a grouping of 1 bit to a grouping of 32 bits. The complexity for encoding increases with the grouping size.
The second column is the number of bits that result from the encoding scheme.
The third column is the efficiency in effective data bandwidth of the grouping before and after encoding. The efficiency is determined by the expression:
M=Number of bits in the first column.
N=Number of bits in the second column.
The efficiency ranges from 50% at the smaller groupings to 89% for larger groupings.
The fourth column represents the number of possible combinations that are available for encoding the bits in the second column. And, the fifth column is the number of combinations that are used to encode bits in the second column.
The encoding scheme of the system and method of the present invention is based on there being a net signaling current of zero at each cycle time. To achieve this, the encoded word must include equal numbers of "1s" and "0s."
According to the encoding scheme of the system and method of the present invention, for each bit grouping from 1 to 32 that is shown in the first column of Table 1, the number of encoding combinations that is required for that bit grouping is determined by the expression:
No. of Combos. Used=2M (5)
M=Number of bits in the first column.
These combinations are shown in the fifth column of Table 1.
For each of the even number of encode bits, the possible number of encoding combinations is determined by the expression: ##EQU1## where, Poss. Combos.=Possible number of combinations according to N encode bits.
N=Even number of encode bits.
These combinations are shown in the fourth column of Table 1.
After these determinations are made, the number of combinations for the different groupings of bits (according to expression (5)) is compared with the possible number of encoding combinations for the even number of encode bits (according to expression (6)). The number of encode bits for a grouping is then determined to be that number of encode bits associated with the largest number of possible encoding combinations (according to expression (6)) that the number of encoding combinations (according to expression (5)) does not exceed.
As an example, in Table 1, a 6-bit grouping will require 64 encoding combinations (according to expression (5)). The possible number of encoding combinations for 6, 8, and 10 encode bits is 20, 70, and 252, respectively (according to expression (6)). The 20 encoded combinations for 6 encode bits is less than 64 and 70 encode combinations is just above 64, while 252 encode combinations is well above 64. For efficient use of the encode bits, 8 encode bits would be selected to encode 6-bit groupings of the 32-bit word since it is the closest number of possible combinations that is greater than the required number of combinations.
A greater number than 8 encode bits could be used, such as 10 encode bits, but the efficiency will suffer: 6 encoded to 8 has 75% efficiency, while 6 encoded to 10 has 60% efficiency. Thus, 8 encode bits would be selected to encode 6-bit groupings of the 32-bit word.
The encoding scheme of the present invention will now be discussed referring to the figures and Table 1.
Referring to FIG. 1, a first representative encoding of a 32-bit word according to the present invention is shown. As is shown in the figure, 32-bit word 100 is divided into eight 4-bit groupings. These are <31:28> at 102, <27:24> at 104, <26:20> at 106, <19:16> at 108, <15:12> at 110, <11:8> at 112, <7:4> at 114, and <3:0> at 116. According to the encoding scheme of the system and method of the present invention described above, each 4-bit grouping will encode to 6 encode bits (See Table 1). According to expression (5) and column 5 of Table 1, each 4-bit grouping may have one of 16 values and each of these 16 values is assigned one of the 20 possible encoding combinations of equal "1s" and "0s" that is shown in Table 2.
TABLE 2______________________________________ 111000 000111 110100 001011 110010 001101 110001 001110 101100 010011 101010 010101 101001 010110 100110 011001 100101 011010 100011 011100______________________________________
The selection and assignment of one of the 20 encoding combinations for a particular 4-bit value does not have to follow any predetermined pattern. For instance, the 4 bit value 0101 (or 9) may be at bits <31:28> and encode to 6 encode bit encoding combination 011100, while the 4 bit value 1111 (or 15) may be at bits <27:24> and encode to 6 encode bit encoding combination 000111.
Since each of the eight 4-bit groupings is encoded to 6 encode bits, when encoded, the original 32-bit word is 48-bits long. This 48-bit encoded word has an equal number of "1s" and "0s." Hence, the net signaling current is approximately zero which minimizes, if not eliminates, the chance that there will be enough simultaneous switching noise to cause data transmission errors regardless of the number of output pins that simultaneously by switch.
FIGS. 2 and 5 show other grouping of bits of the 32-bit word: FIG. 2 shows groupings of 6 bits and FIG. 5 shows groupings of 10 bits. The encoding principle described above with regard to 4-bit groupings also applies to each of the other grouping of the bits in the first column of Table 1, with FIGS. 2 and 5 being just two representative groupings.
Another aspect of the present invention is that error detection is coupled with the encoding scheme of the system and method of the present invention. The error detection methods of the present invention are incorporated with the encoding scheme to minimize the number of bits that have to be transmitted for any encoded word.
The first type of error detection is more readily understood referring to FIGS. 1 and 8. In FIG. 1, the 32-bit word is divided into eight 4-bit groupings. Each grouping is encoded to 6 encode bits. Since there are eight 4-bit groupings, all 32 bits are included in one of the groupings.
FIG. 8 shows an exemplary system according to the present invention. An IC 10 includes an encoder 100 and a decoder 110, each coupled to outputs 130 of the IC 10. As shown, when the 32-bit word is encoded by the encoder 100, the resulting encoded word is 48 bits long. This 48 bit word includes an equal number of "1s" and "0s," in accordance with expressions 1, 2, and 3, above. Thus, on the decoder 110, at a receiver 120, the number of "1s" and "0s" can be counted to determine if they are equal. If the received number of "1s" equals the received number of "0s," then there is no single bit data transmission error in the encoded word. If there is a difference in these numbers, there is a data transmission error of the encoded word. This method of error detection is always available because the encoding scheme of the present invention requires that the encoded word contain an equal number of "1s" and "0s."
Referring to FIGS. 2, 3, and 4, simultaneous switching noise reduction with "1s" and "0s" count error detection and single-bit error detection will be discussed.
32-bit word 200 is divided into five 6-bit groupings and one 2-bit grouping. They are <31:26> at 202, <25:20> at 204, <19:14> at 206, <13:8> at 208, <7:2> at 210, and <1:0> at 212. Since the grouping at 212 is only 2 bits, 4 bits are added so that this last grouping will have 6 bits like the other five groupings: <31:26> at 202, <25:20> at 204, <19:14> at 206, <13:8> at 208, <7:2> at 210. The 4 bits that are added may be "X" (no care) bits or they may be used for single-bit error detection.
Referring specifically to FIG. 3 at 250, the last 6-bit grouping at 264 is shown. This grouping includes the 2 bits at 212 and the 4 bits shown at 252. The bits at 252 are bits 274, 278, 282, and 286. This 6-bit grouping, along with the other five 6 bit groupings, are each encoded to 8 encode bits. This will mean that the encode word is 48 bits long, the same as the encoded word in FIG. 1.
The 4 bits that are added to the low order bits of a 32-bit word may be parity bits. Thus, each of these bits may be used to provide byte parity to the 4 bytes of the 32-bit word. The assignment of the parity bits at 252 to the bytes of the 32-bit word is shown generally at 270 in FIG. 4. According to that figure, parity bit 274 is assigned to byte <31:24> at 272, parity bit 278 is assigned to byte <23:16> at 276, parity bit 282 is assigned to byte <15:8> at 280, and parity bit 286 is assigned to <7:0> at 284.
Therefore, the 6-bit groupings of the bits of the 32-bit word provide two types of error detection. The first is error detection based of an equal number of "1s" and "0s" in the 48-bit encoded word. The second is error detection based on a parity bit for each byte of the 32-bit word.
Referring to FIGS. 5, 6, and 7, simultaneous switching noise reduction with "1s" and "0s" count error detection and full two-bit error detection will be discussed.
32-bit word 200 is divided into three 10-bit groupings and one 2-bit grouping. These groupings as shown in FIG. 5 are: <31:22> at 302, <21:12> at 304, <11:2> at 306, and <1:0> at 308.
To complete the last grouping, 8 bits are added to the 2 low order bits of the 32 bit word. The bits that are added may be "X" (no care) bits but are likely used to provide full two-bit error detection.
Referring to FIG. 6 generally at 350, 10-bit grouping 354 is shown. This last grouping includes the 2 bits at 308 plus the 8 bits shown at 352. The bits at 352 are bit pairs at 374, 378, 382, and 386. 10-bit grouping 354 and the three other 10-bit groupings are each encoded to 14 encode bits. The encoded word is 56 bits long, which is slightly longer than the encoded words at FIGS. 1 and 2.
As shown at FIG. 7, the 8 bits (or 4 pairs of bits) that were added may be parity bits. A pair of parity bits is associated with each byte of original 32-bit word to provide full two-bit error detection. According to FIG. 7, the assignment of parity bits is the pair of parity bits at 374 is assigned to byte <31:24> at 372, the pair at 378 to byte <23:16> at 376, the pair of parity bits at 382 to byte <15:8> at 380, and the pair of parity bits at 386 to <7:0> at 384.
The 10-bit groupings of the bits of the 32-bit word, therefore, permit two types of error detection. The first is error detection based on the equal number of "1s" and "0s" in the encoded 56-bit word. The second is error detection based on full two-bit (double bit) error detection.
It is to be understood that when two bits per byte are provided one may be used for single-bit error detection, while the other may have an unrelated use.
The terms and expressions that are used herein are used as terms of expression and not of limitation. And, there is no intention in the use of such terms and expressions of excluding the equivalents of the features shown and described, or portions thereof, it being recognized that various modifications are possible in the scope of the invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US3015805 *||Sep 11, 1957||Jan 2, 1962||Int Standard Electric Corp||Circuit arrangement for encoding devices|
|US3250998 *||Jun 28, 1961||May 10, 1966||Int Standard Electric Corp||Error eliminating code transmission system|
|US3568149 *||Oct 15, 1968||Mar 2, 1971||Gen Signal Corp||Digital code receiving system|
|US3631471 *||Dec 8, 1969||Dec 28, 1971||Post Office||Low disparity binary codes|
|US3646517 *||May 15, 1970||Feb 29, 1972||Int Standard Electric Corp||Error detection and correction system|
|US3902117 *||Jan 24, 1974||Aug 26, 1975||Int Standard Electric Corp||Pcm error detection|
|US4309694 *||Mar 27, 1980||Jan 5, 1982||Bell Telephone Laboratories, Incorporated||Zero disparity coding system|
|US4334310 *||Jun 23, 1980||Jun 8, 1982||International Business Machines Corporation||Noise suppressing bilevel data signal driver circuit arrangement|
|US4414659 *||May 4, 1981||Nov 8, 1983||U.S. Philips Corporation||Method and apparatus for encoding digital data so as to reduce the D.C. and low frequency content of the signal|
|US4486739 *||Jun 30, 1982||Dec 4, 1984||International Business Machines Corporation||Byte oriented DC balanced (0,4) 8B/10B partitioned block transmission code|
|US4569050 *||Jan 14, 1983||Feb 4, 1986||Honeywell Inc.||Data communication system with fixed weight error correction and detection code|
|US4620311 *||Dec 7, 1984||Oct 28, 1986||U.S. Philips Corporation||Method of transmitting information, encoding device for use in the method, and decoding device for use in the method|
|US4675880 *||May 2, 1985||Jun 23, 1987||The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration||Antimultipath communication by injecting tone into null in signal spectrum|
|US4811361 *||Oct 29, 1987||Mar 7, 1989||Bull, S.A.||Method and apparatus for transmission of digital data|
|US5016258 *||Jun 9, 1989||May 14, 1991||Matsushita Electric Industrial Co., Ltd.||Digital modulator and demodulator|
|US5022051 *||Nov 2, 1988||Jun 4, 1991||Hewlett-Packard Company||DC-free line code for arbitrary data transmission|
|US5042037 *||Aug 1, 1989||Aug 20, 1991||Kabushiki Kaisha Toshiba||Digital data modulation circuit having a DC component suppression function|
|US5142167 *||May 1, 1991||Aug 25, 1992||International Business Machines Corporation||Encoding for simultaneous switching output noise reduction|
|GB1569076A *||Title not available|
|GB2041702A *||Title not available|
|GB2083322A *||Title not available|
|GB2099263A *||Title not available|
|GB2232858A *||Title not available|
|1||Bergmann, et al., AT&T Technical Journal, "Half Weight Block Codes for Optical Communications", Jun. 1986, vol. 65, No. 3.|
|2||*||Bergmann, et al., AT&T Technical Journal, Half Weight Block Codes for Optical Communications , Jun. 1986, vol. 65, No. 3.|
|3||IBM Technical Disclosure Bulletin, "Code for Leveling Bus Driver Current", Feb. 1988, vol. 30, No. 9.|
|4||*||IBM Technical Disclosure Bulletin, Code for Leveling Bus Driver Current , Feb. 1988, vol. 30, No. 9.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US5590067 *||Mar 14, 1995||Dec 31, 1996||Discovision Associates||Method and arrangement for transformation of signals from a frequency to a time domain|
|US5594678 *||Mar 7, 1995||Jan 14, 1997||Discovision Associates||Method and arrangement for transformation of signals from a frequency to a time domain|
|US5596517 *||Mar 7, 1995||Jan 21, 1997||Discovision Associates||Method and arrangement for transformation of signals from a frequency to a time domain|
|US5890005 *||Jun 2, 1997||Mar 30, 1999||Nokia Mobile Phones Limited||Low power, low interconnect complexity microprocessor and memory interface|
|US5974259 *||Sep 18, 1996||Oct 26, 1999||International Business Machines Corporation||Data processing system and method of operation having input/output drivers with reduced power consumption and noise levels|
|US6133747 *||Jul 22, 1998||Oct 17, 2000||University Of New Mexico||Time redundant radiation tolerant logic|
|US6217234||Jun 7, 1995||Apr 17, 2001||Discovision Associates||Apparatus and method for processing data with an arithmetic unit|
|US6583470||Jan 19, 2000||Jun 24, 2003||Science & Technology Corporation @ Unm||Radiation tolerant back biased CMOS VLSI|
|US7275123||Dec 6, 2004||Sep 25, 2007||Nvidia Corporation||Method and apparatus for providing peer-to-peer data transfer within a computing environment|
|US7321628||Sep 30, 2003||Jan 22, 2008||Infineon Technologies Ag||Data transmission system with reduced power consumption|
|US7451259||Dec 6, 2004||Nov 11, 2008||Nvidia Corporation||Method and apparatus for providing peer-to-peer data transfer within a computing environment|
|US7456655||May 16, 2005||Nov 25, 2008||Marvell Israel (Misl) Ltd.||System and process for overcoming wire-bond originated cross-talk|
|US7469309||Dec 12, 2005||Dec 23, 2008||Nvidia Corporation||Peer-to-peer data transfer method and apparatus with request limits|
|US7506165||Apr 29, 2002||Mar 17, 2009||Cryptography Research, Inc.||Leak-resistant cryptographic payment smartcard|
|US7587044||Dec 3, 2001||Sep 8, 2009||Cryptography Research, Inc.||Differential power analysis method and apparatus|
|US7599488||Oct 29, 2007||Oct 6, 2009||Cryptography Research, Inc.||Differential power analysis|
|US7634083||Dec 15, 2009||Cryptography Research, Inc.||Differential power analysis|
|US7668310||Feb 23, 2010||Cryptography Research, Inc.||Cryptographic computation using masking to prevent differential power analysis and other attacks|
|US7764792 *||Jul 27, 2010||Marvell International Ltd.||System and method for encoding data transmitted on a bus|
|US7787620||Aug 31, 2010||Cryptography Research, Inc.||Prevention of side channel attacks against block cipher implementations and other cryptographic systems|
|US7792287||Oct 30, 2007||Sep 7, 2010||Cryptography Research, Inc.||Leak-resistant cryptographic payment smartcard|
|US7941666||May 10, 2011||Cryptography Research, Inc.||Payment smart cards with hierarchical session key derivation providing security against differential power analysis and other attacks|
|US8010730 *||Jun 24, 2008||Aug 30, 2011||Ricoh Company, Ltd.||Bus converter, semiconductor device, and noise reduction method of bus converter and semiconductor device|
|US8296704||Jul 9, 2010||Oct 23, 2012||Altera Corporation||Method and apparatus for simultaneous switching noise optimization|
|US8879724||Dec 14, 2009||Nov 4, 2014||Rambus Inc.||Differential power analysis—resistant cryptographic processing|
|US8922246||Oct 22, 2008||Dec 30, 2014||Marvell Israel (M.I.S.L) Ltd.||System and process for overcoming wire-bond originated cross-talk|
|US9148171 *||Jul 29, 2014||Sep 29, 2015||Avago Technologies General Ip (Singapore) Pte. Ltd.||Parallel interface pattern modification for addressing signal integrity concerns|
|US20020124178 *||Dec 3, 2001||Sep 5, 2002||Kocher Paul C.||Differential power analysis method and apparatus|
|US20030028771 *||Apr 29, 2002||Feb 6, 2003||Cryptography Research, Inc.||Leak-resistant cryptographic payment smartcard|
|US20030188158 *||Mar 24, 2003||Oct 2, 2003||Kocher Paul C.||Payment smart cards with hierarchical session key derivation providing security against differential power analysis and other attacks|
|US20050069043 *||Sep 30, 2003||Mar 31, 2005||Oliver Kiehl||Data transmission system with reduced power consumption|
|US20060045264 *||Oct 18, 2005||Mar 2, 2006||Kocher Paul C||Prevention of side channel attacks against block cipher implementations and other cryptographic systems|
|US20060120376 *||Dec 6, 2004||Jun 8, 2006||Nvidia Corporation||Method and apparatus for providing peer-to-peer data transfer within a computing environment|
|US20060123142 *||Dec 6, 2004||Jun 8, 2006||Nvidia Corporation||Method and apparatus for providing peer-to-peer data transfer within a computing environment|
|US20080043406 *||Aug 16, 2006||Feb 21, 2008||Secure Computing Corporation||Portable computer security device that includes a clip|
|US20080049940 *||Oct 24, 2007||Feb 28, 2008||Kocher Paul C||Payment smart cards with hierarchical session key derivation providing security against differential power analysis and other attacks|
|US20080104400 *||Oct 30, 2007||May 1, 2008||Kocher Paul C||Leak-resistant cryptographic payment smartcard|
|US20090031060 *||Jun 24, 2008||Jan 29, 2009||Masaharu Adachi||Bus converter, semiconductor device, and noise reduction method of bus converter and semiconductor device|
|US20100091982 *||Dec 14, 2009||Apr 15, 2010||Kocher Paul C||Differential power analysis - resistant cryptographic processing|
|USRE44777||Jul 26, 2012||Feb 25, 2014||Marvell International Ltd.||System and method for encoding data transmitted on a bus|
|USRE45334 *||Sep 19, 2013||Jan 13, 2015||Marvell International Ltd.||System and method for encoding data transmitted on a bus|
|WO2012006553A3 *||Jul 8, 2011||Apr 19, 2012||Altera Corporation||Method and apparatus for simultaneous switching noise optimization|
|U.S. Classification||714/812, 341/58, 714/817, 326/26|
|International Classification||H03M7/14, H03M7/00, H04L1/00, G06F11/00, H03M13/00, G06F11/10, H04L25/02, H03K17/16, H03M13/51, H03M7/20, H03K19/003, H03M5/14|
|Cooperative Classification||H03M7/20, H03M5/145|
|European Classification||H03M5/14B, H03M7/20|
|Jun 28, 1999||FPAY||Fee payment|
Year of fee payment: 4
|Jan 9, 2002||AS||Assignment|
Owner name: COMPAQ INFORMATION TECHNOLOGIES GROUP, L.P., TEXAS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DIGITAL EQUIPMENT CORPORATION;COMPAQ COMPUTER CORPORATION;REEL/FRAME:012447/0903;SIGNING DATES FROM 19991209 TO 20010620
|Jun 9, 2003||FPAY||Fee payment|
Year of fee payment: 8
|Nov 3, 2003||AS||Assignment|
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS
Free format text: CHANGE OF NAME;ASSIGNOR:COMPAQ INFORMANTION TECHNOLOGIES GROUP LP;REEL/FRAME:014102/0224
Effective date: 20021001
|Jul 2, 2007||FPAY||Fee payment|
Year of fee payment: 12