The present invention is related to trimming circuit components formed on chips to meet specifications, and, more particularly, to networks sharing trim values or codes to meet specifications.
On production runs of a chip, slight process variations may introduce changes that, over time and/or with other circumstances, cause the circuitry on the chip to not meet their specifications. Such changes may include, but are not limited to, chemical and composition differences, chip physical differences, photo-lithographic differences, pressure and temperature differences, etc. Each of these differences may be slight, but they may accumulate in such a way as to bring the circuitry out of specification.
One approach to recovering out-of-specification chips is to trim components on the chip. Often a parameter, e.g., a voltage, current, a resistance, or a frequency, is measured on the chip in question, and, if the measurement does not meet the specification, a trim is applied to components in the circuit so that that parameter meets its specification. The trim often applies to series arrangement of resistors with metallic connections or fuses shorting out some of the components. The fuses are selectively cut to change the resulting resistance. For example, a VCO (voltage controlled oscillator) may have an RC (resistor/capacitor) delay that determines the frequency of the VCO. The resistance may be trimmed to have the VCO meet its frequency specification.
The present disclosure includes a network of components including parallel paths. Each path includes a component that is physically shorted out over a portion of its length by one or more fuses. The value of the component portion that is not shorted out may be measured and compared to a specification. If out of specification, the component value may be changed by selectively cutting the fuses.
The specific fuses to be cut may be identified with a code, referred to as TRIM CODE. The code may be a binary code, but other codes may be used, e.g., a one to one code where each code bit identifies a fuse and a one would indicate a fuse to be cut.
The same code then may be applied to the components in parallel paths such that the percentage change to the parallel components match that in the component that was first trimmed. Moreover, the same code may be used in other trimmable networks on the same chip.
Illustratively, a component value, not in the network, may be measured that, when compared to a specification, indicates a specific trim code that may be applied to fuses in other component networks to have them meet their specifications.
One or more programmable switches may be placed in series with each parallel path in a component network, wherein closing a switch places the trimmed components in parallel with each other.
The present disclosure may apply to resistors, FETs, capacitors, virtually any component that is defined by a physical length on a chip, wherein the portions of the length may be shorted out by a fuse that may be subsequently cut.
The invention description below refers to the accompanying drawings, of which:
The present disclosure illustrates a trimmable component network of switched parallel paths each containing a component, typically a resistor, with a portion of the component bypassed by fuses. The bypassed portion may represent the same percentage of the component's value for each of the trimmable components in the parallel paths. A component is measured against a specification and, if the specification is not met, a prescribed number of fuses may be cut to bring the component within its specification. A TRIM CODE may be used to identify the specific fuses to be cut, and thus the specific fuses that are to remain intact. The same TRIM CODE is applied to the components in the parallel paths.
Note that additional paths, PATHSn with additional switches Sn, may be present, although only the three paths A, B, and C are further discussed herein.
In path A resistor R1 comprises a portion ΔR1 that is bypassed by fuses as shown in
In the example of
Note that the resistance R1 may be measured with an ohmmeter or other ways known to those skilled in the art.
Similarly the same TRIM CODE may be applied to ΔR2 and ΔR3, and to other trimmable networks on the same chip
The resulting granularity of the trim code allows for very fine as well as gross adjustments. For example, if VR1 encompasses 20% of the maximum value of R1, then that 20% may be divided down by 8 bits or 256, wherein the selection granularity of changes to R1 would be less than 0.01% (20%/256). Note that ΔR1 may be arranged to be virtually any portion of the total R1 value as may be determined by the designer. For example, ΔR1 may be more than 50% or less than 1%. The same applies to ΔR2 and ΔR3.
Illustratively, a TRIM CODE may be eight bits wide where each position in the TRIM CODE refers to a specific fuse. That is there may be eight fuses along the length of ΔR1 and each fuse corresponds, one to one, with one of the eight bit positions. A one in a bit position may indicate that fuse to be cut with a zero meaning leave the fuse intact.
The amount of change required to R1 in order for the R1, C1 circuit to meets the specification is determined directly from how far the measurement misses the specification. For example, if the measured delay is 10% longer than the specification limit, R1 might be reduced by more than 10% to bring the delay within specification.
Still referring to
In operation, assuming R1 has been changed via the TRIM CODE to be within specifications. The TRIM CODE applied to ΔR1 was also applied to ΔR2 and ΔR3. Using the same TRIM CODE means that the trimmed R2 and the rimmed R3 will track the trimmed R1. Similarly, the trimmed delay of path A alone will be tracked by the delays when path B and/or path C are placed in parallel with path A by activating switches S0 and S1. Such operation reduces mismatches.
Illustratively, with respect to
The parallel arrangement shown in
Number | Name | Date | Kind |
---|---|---|---|
5243319 | Brokaw | Sep 1993 | A |
6725436 | Koike et al. | Apr 2004 | B2 |
7663470 | Kimura | Feb 2010 | B2 |
7714694 | Landsberger et al. | May 2010 | B2 |
7825768 | Onishi | Nov 2010 | B2 |
7968826 | DeAngelis et al. | Jun 2011 | B2 |
20050212650 | Shovlin et al. | Sep 2005 | A1 |
20110025452 | Maher | Feb 2011 | A1 |
Number | Date | Country | |
---|---|---|---|
20110025452 A1 | Feb 2011 | US |