The present invention relates to communication systems and improving the received signal quality in a high-speed communications environment through the use of equalization. The improvement in signal quality affords gains in system performance such as increased data throughput capacity or reduced error rate. Specifically, the present invention relates to a method and system for improving the quality of a received signal by counteracting distortions introduced in signal generation, transmission, and reception.
Network bandwidth consumption is rising at a rapid rate. Existing network capacity is marginally adequate and is expected, as of this writing, to soon be inadequate. Thus, there is a need to increase network bandwidth capacity. This increase in bandwidth can be achieved by increasing the symbol transmission rate to yield a corresponding increase in the data rate or by using advanced modulation techniques with higher spectral efficiency (i.e. techniques that communicate more than one information bit per symbol).
Regardless of the technique employed to achieve higher data throughput, the higher data throughput can place more stringent requirements on the fidelity of the signal communicated. Fidelity of the signal communicated can be hampered by signal degradation. Signal degradation can occur during signal generation and signal transmission. Signal degradation incurred in generating and transmitting a signal over a channel can largely be categorized as arising from two sources: (i) filtering of the signal and (ii) corruption from noise.
In classical communications (e.g. wireless or wireline communications), the noise component is commonly addressed by using optimal detection (i.e. matched-filtering followed by optimal thresholding). However, such a conventional approach often neglects the inter-symbol interference (ISI) associated with the filtering that occurs in the channel, i.e. that approach assumes that the noise is the dominant source of distortion. If the ISI is the dominant source of signal degradation, then the conventional approach is to equalize the channel, e.g. filter the received signal with an inverse filter prior to detection. The use of any one of these approaches in isolation may not improve signal fidelity since matched-filtering and equalization are often contradicting goals.
For example, equalization generally corresponds to high-pass filtering which, while removing ISI, increases the presence of high-frequency noise. A low-pass filter (LPF) is usually employed to the equalized signal in order to reduce the effect of the high-frequency noise but which also re-introduces ISI. Matched-filtering, on the other hand, is often low-pass in nature and thus frequently exacerbates the ISI in the signal in the process of reducing noise.
The separate application of matched-filtering and equalization can be characterized as “ad-hoc” because it does not consider the problem of noise mitigation and equalization in a combined framework, and thus, neglects the impact each has on the other.
There exist techniques in the conventional art which address noise mitigation and equalization in a common framework. In particular, the well-known Least-Mean Squares (LMS) based approaches minimize a distortion measure that captures the impact of both noise and ISI. Furthermore, these methods are adaptive in the sense that the settings of the filter are automatically adjusted to the optimal value. This adaptive feature is often necessary as the exact characteristics of the channel distortion and noise spectral content vary from installation to installation and also with time and temperature in some instances.
Unfortunately, the use of these traditional adaptive LMS-based control methodologies for high-data rate systems can be impractical due to data acquisition and processing difficulties. In particular, it can be economically impractical (and often technically infeasible) to (i) produce the analog-to-digital converters (ADC's) capable of digitizing the signal at the required speed and resolution and (ii) produce a processor capable of handling the digitized data at the high speeds.
Therefore, there is a need in the art for an adaptive filtering approach that combines channel equalization and noise filtering. Another need exists in the art for a method and system for high speed digital communications that combines channel equalization and noise filtering in a single framework and that can account for the effects that equalization can have on noise filtering, and vice-versa. Additionally, there is a need for such a method and system which is economically and technically practical for high-speed data systems.
A Signal Conditioning Filter (SCF) and a Signal Integrity Unit (SIU) can control elements that filter a digital (i.e. binary or multilevel) signal. A multilevel signal uses discrete amplitudes, which can change from one time interval to another, to convey information in each time interval. The simplest example of multilevel signaling is binary signaling where two amplitudes are used to represent a logical 0 or 1 (i.e. one bit of information). By using more levels, more information can be conveyed with each symbol or in each time interval. In some of the prior art and conventional art, the term “multilevel” conveys the use of more than two amplitude levels. To avoid any ambiguity, the term “digital signaling” will be used in this writing to refer to signaling with discrete amplitudes and time intervals, i.e. digital signaling that can include both binary and multilevel signaling.
The SCF and SIU form part of a method and system for equalizing and filtering a digital signal. This method and system for equalizing and filtering may be used in a variety of high-speed communications systems. Applications can include, but are not limited to, (i) electrical systems such as backplane, telecom, and datacom systems and (ii) optical systems such as long-haul, metro, and short-reach applications.
Regardless of the application, the method and system can process a received digital signal in the electrical domain prior to decoding. Thus, in optical systems, the method and system can be used either after photodetection in the receiver or prior to modulation in the transmitter.
The present invention can address the coupled problem of equalization and noise filtering in order to improve signal fidelity for decoding. Specifically, a received digital signal can be filtered in a manner to optimize the signal fidelity even in the presence of both significant (large magnitudes of) ISI and noise. Furthermore, the method and system of the present invention can be adaptive in the sense that filter coefficients can be continuously updated to reflect any time-varying changes in the system characteristics.
The present invention can provide an adaptive method that continuously monitors a signal fidelity measure. For example, monitoring the fidelity of a digital signal can be performed by external means such as a Signal Integrity Unit (SIU). A received signal y(t) can be “conditioned” by application of a filter with an electronically adjustable impulse response g(t). A resulting output z(t) can then be interrogated to characterize the quality of the conditioned signal.
This fidelity measure q(t) can then be fed back to the SCF. Utilizing the signal fed back to the SCF, the response of the SCF can be adjusted to maximize the received fidelity measure. For the SIU, the signal fidelity measure can be directly associated with a decision error probability in a subsequent decoder with optimal decision thresholds. Combining the proposed approach with such a control system can balance (in a principled fashion) the trade-off between the degree to which ISI is corrected and noise is mitigated for optimal decoding.
The SCF can include a cascade of two or more tapped delay line filters with electronically controllable gain coefficients. The tap spacings of the two filters can be different in order to effectively combat both the effect of ISI which occurs on a large time scale and the effects of noise, jitter, and signal ringing which occur on a small time scale.
Using a cascade of two distinct filters can minimize the number of taps required to address both of these phenomena. The delay lines in these filters can include artificial transmission lines which can absorb the parasitic capacitance of the tap amplifiers. The tap amplifiers which vary the gain coefficients can be implemented using special Gilbert cell multipliers.
The present invention can address the problems of equalization and noise filtering in order to improve signal fidelity for decoding. Specifically, a received digital signal can be filtered in a manner to optimize the signal fidelity even in the presence of both large magnitudes of ISI and noise. Furthermore, the method and system of the present invention can be adaptive in the sense that filter coefficients can be continuously updated to reflect any time-varying changes in the channel behavior.
Filter Structure
Referring now to
According to one exemplary embodiment, each filter 110, 115 of the signal conditioning filter 100 can comprise a tapped-delay line or finite impulse response (FIR) filter with electrically controllable gain coefficients. Filtering is separated into these two stages, where the short-time filter 110 can comprise the first stage and the long-time filter can comprise the second stage. Each stage is designed to address a particular type of distortion using a relatively small number of taps.
As its name implies, the short-time filter 110 can be designed to mitigate degradations such as ringing, noise, and timing jitter that can occur on a relatively small time scale. Meanwhile, the long-time filter 115 is designed to remove signal artifacts (such as ISI) that can occur on a larger time scale.
Referring now to
As mentioned above, the output of the LPF 132 can be fed to the analog-to-digital converter (ADC) 135. The ADC 135 may be characterized as a low-speed high-resolution ADC that measures the averaged event-detector output representing the cumulative distribution function (CDF) value. Specifically, the reference voltage is swept over a range of voltage levels while the ADC 135 samples the voltage from the filter 132 to produce an estimate of the CDF. The SIU 125 can set the reference voltage via the DAC 145 to a fixed value and then measures the averaged event detection output. The SIU 125 can then set the reference voltage to a different fixed value and measures another point of the CDF. This process is completed until the CDF curve is formed.
The ADC 135 feeds its output to a microcontroller 140. Microcontroller 140 can process the cumulative distribution function (CDF) to determine threshold voltage values for signal decoding, receiver gain for the variable gain amplifier 105, and filter coefficients for the SCF 100. The microcontroller 140 is responsible for feeding the filter coefficients to the SCF for equalizing and filtering the received signal. Further details of the signal integrity unit 125 are discussed in the commonly owned U.S. Non-provisional application Ser. No. 10/108,598 entitled, “METHOD AND SYSTEM FOR DECODING MULTILEVEL SIGNALS,” filed on Mar. 28, 2002 in the name of Vincent Hietala et al., the entire contents of which are hereby incorporated by reference.
Referring now to
A first output of the signal detection and fidelity characterization circuit 130 can comprise the decoded data from the filtered signal z(t). A second output of the signal detection and fidelity characterization circuit 130 can comprise a control signal q(t) that forms a second input to the SCF 100.
Referring now to
The long-time filter 115 manipulates the signal y-prime′(t) according to a second function gL(t). The output from the long-time filter 115 can comprise a second filtered signal or z(t) as mentioned above with respect to
Referring now to
The short-time filter 110 can support a frequency resolution of 1/Nδ. It is assumed that the delay δ is sufficiently small so that there is no aliasing in the short-time filter 110. Specifically, the short-time filter 110 has a frequency response that is periodic in frequency with period 1/δ. Any signal (or noise) energy at frequencies higher than f=1/(2δ) will distort the filtered signal as they overlap into adjacent spectral periods. Because of this distortion, it is recommended that the signal be pre-filtered with a passive analog low-pass filter (not shown) prior to the short-time filter 110. This pre-filtering may not needed if any of the receiver components already sufficiently bandlimits the signal, as is often the case with circuit hardware and the high speeds considered.
The output of the short-time filter 110 can be written as
y′(t)=α0y(t)+α1y(t−δ)+ . . . +αNy(t−Nδ) (1)
or equivalently as
y′(t)=[α0+α1+ . . . +αN]y(t)−α1[y(t)−y(t−δ)]− . . . −αN[y(t)−y(t−Nδ)] (2)
where the latter form explicitly conveys how the short-time filter 110 operates on the difference between the current sample and a sample from the past, i.e. each term can provide a first-order correction for the signal fluctuation within a symbol period. Furthermore, the coefficient on y(t) in Eq. (2) provides the DC gain of the signal, i.e. the gain on the signal when the signal is already flat within a symbol period, and hence, all the differential terms are zero. As a reference, unity DC gain can be chosen by setting α0 to
α0=1−α1− . . . −αN (3)
or by alternatively normalizing the filter coefficients to sum to one.
Referring now to
Similar to Eqs. (1) and (2), the output of the long-time filter 115 can be written as
z(t)=a0y′(t)+a1y′(t−T0)+ . . . +aMy′(t−MT0) (4)
or equivalently,
z(t)=[a0+a1+ . . . +aM]y′(t)−a1[y′(t)−y′(t−Δ)]− . . . −aM[y′(t)−y′(t−MΔ)] (5)
where again, a unity DC gain can be arbitrarily chosen by setting
a0=1−a1− . . . −aN (6)
or by scaling the coefficients to sum to one.
Those skilled in the art can extend the exemplary filters in
y′(t)=[α0+ . . . +αN+L]y(t)−α1[y(t)−y(t−δ)]− . . . −αN+L[y(t)−y(t−(N+L)δ)].
The signal sample y(t−Lδ) can be interpreted as the sample to be decoded, i.e. where the decoding has been delayed by process by time Lδ. Because, the signal points y(t) though y(t−(L−1)δ) precede y(t−Lδ), the ISI associated from these symbols can be removed. Thus, the short-time filter 110 can now remove ISI originating from both preceding and succeeding signal samples. The long-time filter 115 may be similarly modified. This extension can be applied to both the short and long-time filters 110, 115 in practice as it can help improve equalization.
Filtering in the Transmitter
Referring now to
Removing these distortions prior to transmission is advantageous because the noise introduced by the channel limits the degree to which the transmitter 600 distortions can be compensated by the receiver's SCF 100. Additionally, if a supervisory communications link is available between the transmitter 600 and receiver (not shown), then the fidelity signal q(t) may be fed from the receiver (not shown) to the transmitter 600 over this link so that the SCF 100 in the transmitter not only compensates for transmitter distortions, but also pre-compensates for link distortions. This pre-compensation would be advantageous because it prevents the noise introduced by the link from limiting the degree to which the channel distortions can be compensated.
Filter Realization
The exemplary short- and long-time filters 110, 115 forming the SCF 100 can be implemented using an integrated tapped-delay line filter structure 100A with the basic structure illustrated in
The filter structure 100A shown in
To understand this efficient “re-use” of the delays, shown in
which is identical to the form of Equations (1) and (4) discussed above.
A block diagram of an exemplary variable gain tap amplifier 900 for a tap filter is illustrated in
For one exemplary embodiment of the present invention, a delay element can comprise a simple LC (inductor-capacitor) delay line. However, those skilled in art will recognize that other delay elements can be used and are not beyond the scope and spirit of the present invention.
A representative LC delay line 1800 is illustrated in
For the simple delay structure shown, assuming constant L and C1, the delay, τ is approximately:
τ=NLC√{square root over (LC1)} (8)
in which NLC is the number of LC pairs and the filter's termination resistance, Ro is:
The end of each delay element needs to be terminated with Ro in parallel with a capacitor of approximately Cl/2 for proper operation.
Referring now to
First, it is important to realize that the cascade of delay elements 1102 and circuitry on the left-hand side of the circuit 100C is designed to form a well controlled delay line. This will be referred to as the “input delay line” 1102. Similarly, on the right-hand side of the circuit 100C comprising the two delay elements and associated circuitry in this simple exemplary embodiment, will be referred to as the “output delay line” 1104.
Both the input and output delay lines 1102, 1104 are designed to have minimal signal attenuation and reflections in order to maintain good signal fidelity. As such, as already mentioned, the inputs of the amplifiers g were designed with high impedance and the remaining input capacitance is “absorbed” into the loading capacitance of the input delay line 1102.
This absorbed capacitance can be seen in
Specifically,
The R8, R10 and R9, R11 resistor divider networks scale the input drive voltage so that desired coefficient control range is achieved (approx. +/−1 V in this case). The output of the Gilbert cell multiplier circuit is terminated by the output delay line. The Gilbert cell multiplier will usually see a real load resistance of Ro/2. The output will have a significant output capacitance due the collector capacitances of X9, X10, X11, and X12, but as discussed above, this capacitance can be absorbed into the output delay line.
Referring now to
For the long-time filter 115 (3-tap τ=T0), a six stage LC filter was required to obtain the necessary delay of 185 ps. Referring now to
Coefficient Adaptation Algorithm
The gains of the filter tap amplifiers g are adjusted to maximize a signal fidelity measure q(t) (provided by the SIU 125 for example). The general idea is to slightly perturb the coefficients and observe the effect on q(t). Doing this allows a set of coefficient values to be determined that locally maximizes the signal fidelity. The approach continually perturbs the coefficients to survey the signal fidelity's dependence on the coefficients and tune the SCF 100 to the optimal values in an adaptive fashion. The method is presented for the case of the short-time filter, but the approach is equally applicable to the long-time filter. Alternatively, the cascade of the two filters can be viewed as a single filter whose coefficients are adapted by the following method as will be discussed below.
The intuition in the preceding paragraph can be made precise by restating it as the following optimization problem
where α denotes the vector of adjustable filter coefficients and q(t) quantifies the fidelity of the signal (such as a measure of the signal's Q-factor as produced by the SIU[4]). Eq. (10) is solved via an empirical minimization of q(t). Towards this end, a coordinate descent algorithm can be used to find the local maximum by searching over each coordinate while the others are held fixed (i.e. perturbing one of the filter coefficients α0, α1, . . . , αN at a time). One skilled in the art will realize that other numerical optimization techniques (such as gradient, Newton, and conjugate methods) may also be used to solve Eq. (10).
In some contexts, simply maximizing the signal fidelity may not be sufficient to provide good SCF performance. In particular, there is the possibility of a null-space of solutions. For example, consider the task of short-time equalization when there is no ringing and noise on the received signal to compensate. An intuitive solution would be to have α0=1 and αn=0 for all other n, i.e. perform no filtering. However, an equally valid solution would be, α0=1, α1=A, α2=−A, and αn=0 for all other n where A can be any value (including arbitrarily large values). Other convoluted (but still valid) sets of coefficients can also be obtained. The drawbacks of such non-intuitive solutions are
1. They obscure the identifiability of the coefficients which are actually helping to improve signal fidelity. For instance, in the above example, α1 and α2 effectively cancel each other and do nothing to reduce ringing or noise.
2. They reduce the robustness of the system to changes in the channel characteristics. In particular, if the channel characteristics change such that the null-space “moves” (e.g. a little ringing is introduced), then α1 and α2 will no longer cancel each other and a very erratic signal will result until the coefficients are relearned to remove such artifacts.
Motivated by such problems, there may be the desire to guide the values of the filter coefficients αn, in addition to maximizing the signal fidelity. To achieve such a result, a regularization penalty can be imposed in the objective function. For example, solving the following optimization problem could be chosen in place of Eq. (10):
where γ and β are regularization parameters. The parameter β is a nominal value for α Specifically, β is the value one would expect α* to be in the absence of any channel distortion. While β represents the nominal value of α*, γ represents confidence in β and determines how strongly α* is driven towards β. Note that if no biasing is desired, then γ should be set to zero, and Eq. (11) reduces to Eq. (10). Thus, Eq. (10) can be seen as a specific case of Eq. (11). One skilled in the art will realize that a variety of penalty functions can be used in place of the 2-norm in Eq. (11).
As previously stated, the long-time filter coefficients can similarly be adapted according to Eq. (11), i.e. it can be chosen that
where b is the nominal value for the long-time filter coefficients. The nominal situation again corresponds to when the channel introduces no signal distortion. For example, if one generally believes the channel introduces no ISI, then b should generally resemble a Euclidean basis vector, i.e. a vector with a single 1 and the rest zeros. That is, the nominal long-time filter should not do much filtering.
Automatic Gain Control
Thus far, the special case of no DC amplification on the filtered multilevel signal has been considered. A non-unity gain could be selected. And if a variable gain amplifier (VGA) module 105 is to lead or follow the SCF 100, then the control of the VGA module 105 may be incorporated into the SCF's 100 control. In particular, if the desired gain AVGA can be obtained as an external signal (perhaps determined in the SIU 125, then the SCF 100 can control the gain by simply scaling all of the coefficients αn (or αn) by AVGA. This is simply a mathematical operation that can be performed after the calculation of filter coefficients in Eq. (11) or (12). Alternately, the gain control of the VGA module 105 can be adjusted as needed by the SIU.
Simulation Results
To demonstrate results of the proposed filtering method, the inventors completed a MATLAB simulation as applied to real data of a 4-PAM signal in an optical communications system.
First, a system dominated by short-time effects, i.e. ringing and noise, is examined. Specifically, an electrical drive signal and a received signal after 100 km of fiber is considered. The progression of the fidelity measure as the filter adaptation algorithm iterates is shown in
In addition to the short-time distortion noise dominated data sets in
Laboratory Results
An exemplary IC implements the filter embodiment discussed above, as illustrated by the circuit 2500 of
Meanwhile, the long-time filter 2520 comprises three coefficient amplifiers 2510 and four delay elements 2525 to realize the 3-tap long-time filter illustrated in
The improved output provided by the SCF circuit 2500 of
Meanwhile, referring now to
Referring now to
Meanwhile, in
Therefore, the present invention provides an adaptive filtering approach that combines channel equalization and noise filtering. The method and system of the present invention can easily support high speed digital communications which combines channel equalization and noise filtering in a single framework. The method and system of the present invention can account for the effects that equalization can have on noise filtering, and vice-versa. Furthermore, the method and system are adaptive in nature and have a practical means of implementation for high-speed data communications systems.
It should be understood that the foregoing relates only to illustrate the embodiments of the present invention, and that numerous changes may be made therein without departing from the scope and spirit of the invention as defined by the following claims.
This application is a continuation of and claims priority to U.S. patent application Ser. No. 11/358,901 filed Feb. 21, 2006, entitled “Adaptive Noise Filtering and Equalization for Optimal High Speed Multilevel Signal Decoding,” and issuing as U.S. Pat. No. 7,573,966 on Aug. 11, 2009, which claims priority to U.S. patent application Ser. No. 10/620,477 filed Jul. 15, 2003 entitled “Adaptive Noise Filtering and Equalization for Optimal High Speed Multilevel Signal Decoding,” now U.S. Pat. No. 7,035,361, which claims priority under 35 U.S.C. §119(e) to U.S. Provisional Application Ser. No. 60/396,065 entitled, “ADAPTIVE NOISE FILTERING AND EQUALIZATION FOR OPTIMAL HIGH SPEED MULTILEVEL SIGNAL DECODING,” filed on Jul. 15, 2002 in the name of Andrew Joo Kim et al. The entire contents of each of the above identified applications are hereby incorporated herein by reference. This application is also related to U.S. Non-provisional application Ser. No. 10/108,598 entitled, “METHOD AND SYSTEM FOR DECODING MULTILEVEL SIGNALS,” filed on Mar. 28, 2002 in the name of Vincent Hietala et al., the entire contents of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
2632058 | Gray | Mar 1953 | A |
3445771 | Clapham et al. | May 1969 | A |
3571725 | Kaneko et al. | Mar 1971 | A |
3599122 | Leuthoki | Aug 1971 | A |
3609682 | Mitcehll | Sep 1971 | A |
3633108 | Kneuer | Jan 1972 | A |
3714437 | Kinsel | Jan 1973 | A |
3806915 | Higgins et al. | Apr 1974 | A |
3977795 | Buschmann | Aug 1976 | A |
4201909 | Dogliotti et al. | May 1980 | A |
4287756 | Gallagher | Sep 1981 | A |
4288872 | Tamburelli | Sep 1981 | A |
4349914 | Evans | Sep 1982 | A |
4363127 | Evans et al. | Dec 1982 | A |
4386339 | Henry et al. | May 1983 | A |
4387461 | Evans | Jun 1983 | A |
4393499 | Evans | Jul 1983 | A |
4410878 | Stach | Oct 1983 | A |
4464771 | Sorensen | Aug 1984 | A |
4470126 | Haque | Sep 1984 | A |
4475227 | Belfield | Oct 1984 | A |
4479266 | Eumurian et al. | Oct 1984 | A |
4521883 | Roché | Jun 1985 | A |
4580263 | Watanabe et al. | Apr 1986 | A |
4584720 | Garrett | Apr 1986 | A |
4618941 | Linder et al. | Oct 1986 | A |
4646173 | Kammeyer et al. | Feb 1987 | A |
4651026 | Serfaty et al. | Mar 1987 | A |
4751497 | Torii | Jun 1988 | A |
4830493 | Giebeler | May 1989 | A |
4847521 | Huignard et al. | Jul 1989 | A |
4864590 | Arnon et al. | Sep 1989 | A |
4868773 | Coyle et al. | Sep 1989 | A |
4873700 | Wong | Oct 1989 | A |
4912726 | Iwamatsu et al. | Mar 1990 | A |
4942593 | Whiteside et al. | Jul 1990 | A |
4953041 | Huber | Aug 1990 | A |
4959535 | Garrett | Sep 1990 | A |
4978957 | Hotta et al. | Dec 1990 | A |
5007106 | Kahn et al. | Apr 1991 | A |
5008957 | Klyono | Apr 1991 | A |
5012475 | Campbell | Apr 1991 | A |
5067126 | Moore | Nov 1991 | A |
5072221 | Schmidt | Dec 1991 | A |
5111065 | Roberge | May 1992 | A |
5113278 | Degura et al. | May 1992 | A |
5115450 | Arcuri | May 1992 | A |
5121411 | Fluharty | Jun 1992 | A |
5128790 | Heidemann et al. | Jul 1992 | A |
5132639 | Blauvelt et al. | Jul 1992 | A |
5151698 | Pophillat | Sep 1992 | A |
5155742 | Ariyavisitakul et al. | Oct 1992 | A |
5181034 | Takakura et al. | Jan 1993 | A |
5181136 | Kavehrad et al. | Jan 1993 | A |
5184131 | Ikeda | Feb 1993 | A |
5208833 | Erhart et al. | May 1993 | A |
5222103 | Gross | Jun 1993 | A |
5223834 | Wang et al. | Jun 1993 | A |
5225798 | Hunsinger et al. | Jul 1993 | A |
5237590 | Kazawa et al. | Aug 1993 | A |
5243613 | Gysel et al. | Sep 1993 | A |
5252930 | Blauvelt | Oct 1993 | A |
5282072 | Nazarathy et al. | Jan 1994 | A |
5283679 | Wedding | Feb 1994 | A |
5291031 | MacDonald et al. | Mar 1994 | A |
5293406 | Suzuki | Mar 1994 | A |
5300930 | Burger et al. | Apr 1994 | A |
5321543 | Huber | Jun 1994 | A |
5321710 | Cornish et al. | Jun 1994 | A |
5327279 | Farina et al. | Jul 1994 | A |
5343322 | Pirio et al. | Aug 1994 | A |
5351148 | Maeda et al. | Sep 1994 | A |
5355240 | Prigent et al. | Oct 1994 | A |
5361156 | Pidgeon | Nov 1994 | A |
5371625 | Wedding et al. | Dec 1994 | A |
5373384 | Hebert | Dec 1994 | A |
5376786 | MacDonald | Dec 1994 | A |
5382955 | Knierim | Jan 1995 | A |
5387887 | Zimmerman et al. | Feb 1995 | A |
5408485 | Ries | Apr 1995 | A |
5413047 | Evans et al. | May 1995 | A |
5416628 | Betti et al. | May 1995 | A |
5418637 | Kuo | May 1995 | A |
5424680 | Nazarathy et al. | Jun 1995 | A |
5428643 | Razzell | Jun 1995 | A |
5428831 | Monzello et al. | Jun 1995 | A |
5436752 | Wedding | Jul 1995 | A |
5436756 | Knox et al. | Jul 1995 | A |
5444864 | Smith | Aug 1995 | A |
5450044 | Hulick | Sep 1995 | A |
5481389 | Pidgeon et al. | Jan 1996 | A |
5481568 | Yada | Jan 1996 | A |
5483552 | Shimazaki et al. | Jan 1996 | A |
5504633 | Van Den Enden | Apr 1996 | A |
5510919 | Wedding | Apr 1996 | A |
5515196 | Kitajima et al. | May 1996 | A |
5528710 | Burton et al. | Jun 1996 | A |
5541955 | Jacobsmeyer | Jul 1996 | A |
5548253 | Durrant | Aug 1996 | A |
5557439 | Alexander et al. | Sep 1996 | A |
5574743 | van der Poel et al. | Nov 1996 | A |
5574978 | Talwar et al. | Nov 1996 | A |
5589786 | Bella et al. | Dec 1996 | A |
5604724 | Shiokawa | Feb 1997 | A |
5606734 | Bahu | Feb 1997 | A |
5612653 | Dodds et al. | Mar 1997 | A |
5617135 | Noda et al. | Apr 1997 | A |
5621764 | Ushirokawa et al. | Apr 1997 | A |
5625360 | Garrity et al. | Apr 1997 | A |
5625722 | Froberg et al. | Apr 1997 | A |
5640417 | Barabash et al. | Jun 1997 | A |
5644325 | King et al. | Jul 1997 | A |
5648987 | Yang et al. | Jul 1997 | A |
5670871 | Man et al. | Sep 1997 | A |
5675600 | Yamamoto | Oct 1997 | A |
5678198 | Lemson | Oct 1997 | A |
5689356 | Rainal | Nov 1997 | A |
5691978 | Kenworthy | Nov 1997 | A |
5692011 | Nobakht et al. | Nov 1997 | A |
5699022 | Tovar | Dec 1997 | A |
5706008 | Huntley, Jr. et al. | Jan 1998 | A |
5721315 | Evans et al. | Feb 1998 | A |
5723176 | Keyworth et al. | Mar 1998 | A |
5751726 | Kim | May 1998 | A |
5754681 | Watanabe et al. | May 1998 | A |
5757763 | Green et al. | May 1998 | A |
5761243 | Russell et al. | Jun 1998 | A |
5764542 | Gaudette et al. | Jun 1998 | A |
5774505 | Baugh | Jun 1998 | A |
5783630 | Evans et al. | Jul 1998 | A |
5784032 | Johnston et al. | Jul 1998 | A |
5790595 | Benthin et al. | Aug 1998 | A |
5798854 | Blauvelt et al. | Aug 1998 | A |
5801657 | Fowler et al. | Sep 1998 | A |
5802089 | Link | Sep 1998 | A |
5812578 | Schemmann et al. | Sep 1998 | A |
5825211 | Smith et al. | Oct 1998 | A |
5825257 | Klymyshyn et al. | Oct 1998 | A |
5825825 | Altmann et al. | Oct 1998 | A |
5828329 | Burns | Oct 1998 | A |
5835848 | Bi et al. | Nov 1998 | A |
5839105 | Ostendorf et al. | Nov 1998 | A |
5841841 | Dodds et al. | Nov 1998 | A |
5844436 | Altmann | Dec 1998 | A |
5848139 | Grover | Dec 1998 | A |
5850409 | Link | Dec 1998 | A |
5850505 | Grover et al. | Dec 1998 | A |
5852389 | Kumar et al. | Dec 1998 | A |
5859862 | Hikasa et al. | Jan 1999 | A |
5861966 | Ortel | Jan 1999 | A |
5872468 | Dyke | Feb 1999 | A |
5878390 | Kawai et al. | Mar 1999 | A |
5880870 | Sieben et al. | Mar 1999 | A |
5883910 | Link | Mar 1999 | A |
5887022 | Lee et al. | Mar 1999 | A |
5889759 | McGibney | Mar 1999 | A |
5896392 | Ono et al. | Apr 1999 | A |
5912749 | Harstead et al. | Jun 1999 | A |
5920600 | Yamaoka et al. | Jul 1999 | A |
5923226 | Kakura et al. | Jul 1999 | A |
5942576 | Evans et al. | Aug 1999 | A |
5943380 | Marchesani et al. | Aug 1999 | A |
5943457 | Hayward et al. | Aug 1999 | A |
5949926 | Davies | Sep 1999 | A |
5959032 | Evans et al. | Sep 1999 | A |
5959750 | Eskildsen et al. | Sep 1999 | A |
5965667 | Evans et al. | Oct 1999 | A |
5968198 | Hassan et al. | Oct 1999 | A |
5978417 | Baker et al. | Nov 1999 | A |
5983178 | Naito et al. | Nov 1999 | A |
5985999 | Dominguez et al. | Nov 1999 | A |
5995565 | Tong et al. | Nov 1999 | A |
5999300 | Davies et al. | Dec 1999 | A |
6002274 | Smith et al. | Dec 1999 | A |
6002717 | Gaudet | Dec 1999 | A |
6009424 | Lepage et al. | Dec 1999 | A |
6011952 | Dankberg et al. | Jan 2000 | A |
6021110 | McGibney | Feb 2000 | A |
6028658 | Hamada et al. | Feb 2000 | A |
6031048 | Evans et al. | Feb 2000 | A |
6031866 | Oler et al. | Feb 2000 | A |
6031874 | Chennakeshu et al. | Feb 2000 | A |
6034996 | Herzberg | Mar 2000 | A |
6035080 | Henry et al. | Mar 2000 | A |
6041299 | Schuster et al. | Mar 2000 | A |
6052420 | Yeap et al. | Apr 2000 | A |
6072364 | Jeckeln et al. | Jun 2000 | A |
6072615 | Mamyshev | Jun 2000 | A |
6078627 | Crayford | Jun 2000 | A |
6084931 | Powell, II et al. | Jul 2000 | A |
6091782 | Harano | Jul 2000 | A |
6093496 | Dominguez et al. | Jul 2000 | A |
6093773 | Evans et al. | Jul 2000 | A |
6108474 | Eggleton et al. | Aug 2000 | A |
6111477 | Klymyshyn et al. | Aug 2000 | A |
6118563 | Boskovic et al. | Sep 2000 | A |
6118567 | Alameh et al. | Sep 2000 | A |
6127480 | Dominguez et al. | Oct 2000 | A |
6140416 | Evans et al. | Oct 2000 | A |
6140858 | Dumont | Oct 2000 | A |
6140972 | Johnston et al. | Oct 2000 | A |
6141127 | Boivin et al. | Oct 2000 | A |
6141387 | Zhang | Oct 2000 | A |
6148428 | Welch et al. | Nov 2000 | A |
6151150 | Kikuchi | Nov 2000 | A |
6154301 | Harvey | Nov 2000 | A |
6163638 | Eggleton et al. | Dec 2000 | A |
6169764 | Babanezhad | Jan 2001 | B1 |
6169912 | Zuckerman | Jan 2001 | B1 |
6181454 | Nagahori et al. | Jan 2001 | B1 |
6191719 | Bult et al. | Feb 2001 | B1 |
6201916 | Eggleton et al. | Mar 2001 | B1 |
6208792 | Hwang et al. | Mar 2001 | B1 |
6211978 | Wojtunik | Apr 2001 | B1 |
6212654 | Lou et al. | Apr 2001 | B1 |
6214914 | Evans et al. | Apr 2001 | B1 |
6215812 | Young et al. | Apr 2001 | B1 |
6219633 | Lepage | Apr 2001 | B1 |
6222861 | Kuo et al. | Apr 2001 | B1 |
6226112 | Denk et al. | May 2001 | B1 |
6236963 | Naito et al. | May 2001 | B1 |
6259836 | Dodds | Jul 2001 | B1 |
6259847 | Lenz et al. | Jul 2001 | B1 |
6268816 | Bult et al. | Jul 2001 | B1 |
6271690 | Hirano et al. | Aug 2001 | B1 |
6271944 | Schemmann et al. | Aug 2001 | B1 |
6281824 | Masuda | Aug 2001 | B1 |
6285709 | Alelyunas et al. | Sep 2001 | B1 |
6288668 | Tsukamoto et al. | Sep 2001 | B1 |
6289055 | Knotz | Sep 2001 | B1 |
6289151 | Kazarinov et al. | Sep 2001 | B1 |
6295325 | Farrow et al. | Sep 2001 | B1 |
6297678 | Gholami | Oct 2001 | B1 |
6298459 | Tsukamoto | Oct 2001 | B1 |
6304199 | Fang et al. | Oct 2001 | B1 |
6311045 | Domokos | Oct 2001 | B1 |
6313713 | Ho et al. | Nov 2001 | B1 |
6314147 | Liang et al. | Nov 2001 | B1 |
6317247 | Yang et al. | Nov 2001 | B1 |
6317469 | Herbert | Nov 2001 | B1 |
6341023 | Puc | Jan 2002 | B1 |
6356374 | Farhan | Mar 2002 | B1 |
6388786 | Ono et al. | May 2002 | B1 |
6411117 | Hatamian | Jun 2002 | B1 |
6421155 | Yano | Jul 2002 | B1 |
6445476 | Kahn et al. | Sep 2002 | B1 |
6473131 | Neugebauer et al. | Oct 2002 | B1 |
6501792 | Webster | Dec 2002 | B2 |
6531931 | Benyamin et al. | Mar 2003 | B1 |
6539204 | Marsh et al. | Mar 2003 | B1 |
6560257 | DeSalvo et al. | May 2003 | B1 |
6650189 | Romao | Nov 2003 | B1 |
6665348 | Feher | Dec 2003 | B1 |
6665500 | Snawerdt | Dec 2003 | B2 |
6718138 | Sugawara | Apr 2004 | B1 |
6751587 | Thyssen et al. | Jun 2004 | B2 |
6816101 | Hietala et al. | Nov 2004 | B2 |
6819166 | Choi et al. | Nov 2004 | B1 |
6819943 | Dalal | Nov 2004 | B2 |
6873704 | Park | Mar 2005 | B1 |
6920315 | Wilcox et al. | Jul 2005 | B1 |
6961019 | McConnell et al. | Nov 2005 | B1 |
7035361 | Kim et al. | Apr 2006 | B2 |
7050388 | Kim et al. | May 2006 | B2 |
7123676 | Gebara et al. | Oct 2006 | B2 |
7149256 | Vrazel et al. | Dec 2006 | B2 |
7173551 | Vrazel et al. | Feb 2007 | B2 |
7190742 | Popescu et al. | Mar 2007 | B2 |
7212580 | Hietala et al. | May 2007 | B2 |
7215721 | Hietala et al. | May 2007 | B2 |
7307569 | Vrazel et al. | Dec 2007 | B2 |
20010024542 | Aina et al. | Sep 2001 | A1 |
20010043650 | Sommer et al. | Nov 2001 | A1 |
20020086640 | Belcher et al. | Jul 2002 | A1 |
20020093908 | Yeap | Jul 2002 | A1 |
20020196508 | Wei et al. | Dec 2002 | A1 |
20030002121 | Miyamoto et al. | Jan 2003 | A1 |
20030007631 | Bolognesi et al. | Jan 2003 | A1 |
20030008628 | Lindell et al. | Jan 2003 | A1 |
20030030876 | Takei | Feb 2003 | A1 |
20030053534 | Sivadas et al. | Mar 2003 | A1 |
20030058976 | Ohta et al. | Mar 2003 | A1 |
20030063354 | Davidson | Apr 2003 | A1 |
20030067990 | Bryant | Apr 2003 | A1 |
20040053578 | Grabon et al. | Mar 2004 | A1 |
20040105462 | Kim et al. | Jun 2004 | A1 |
20040114888 | Rich et al. | Jun 2004 | A1 |
20040197103 | Roberts et al. | Oct 2004 | A1 |
20040213354 | Jones et al. | Oct 2004 | A1 |
20040218756 | Tang et al. | Nov 2004 | A1 |
20050069063 | Waltho et al. | Mar 2005 | A1 |
20050180520 | Kim et al. | Aug 2005 | A1 |
20060146966 | Golanbari et al. | Jul 2006 | A1 |
20060159002 | Kim et al. | Jul 2006 | A1 |
20060178157 | Gebara et al. | Aug 2006 | A1 |
20060291598 | Gebara et al. | Dec 2006 | A1 |
20070060059 | Kim et al. | Mar 2007 | A1 |
20070064923 | Schmukler et al. | Mar 2007 | A1 |
20070092265 | Vrazel et al. | Apr 2007 | A1 |
20070171998 | Hietala et al. | Jul 2007 | A1 |
20070253495 | Kim | Nov 2007 | A1 |
Number | Date | Country |
---|---|---|
0 527 966 | Sep 1994 | EP |
0 584 865 | Mar 2000 | EP |
2 223 369 | Apr 1990 | GB |
2 306 066 | Apr 1997 | GB |
62082659 | Oct 1988 | JP |
1990000063162 | Nov 1991 | JP |
04187738 | Jul 1992 | JP |
08079186 | Mar 1996 | JP |
WO2006065883 | Sep 1994 | WO |
WO 9945683 | Sep 1999 | WO |
WO 0141346 | Jun 2001 | WO |
WO 02067521 | Aug 2002 | WO |
WO 2002082694 | Oct 2002 | WO |
WO 02091600 | Nov 2002 | WO |
WO 2003071731 | Aug 2003 | WO |
WO 03077423 | Sep 2003 | WO |
WO 03092237 | Nov 2003 | WO |
WO 2004008782 | Jan 2004 | WO |
WO 2004045078 | May 2004 | WO |
WO 2004088857 | Oct 2004 | WO |
WO 2005018134 | Feb 2005 | WO |
WO 2005050896 | Jun 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20100040180 A1 | Feb 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11358901 | Feb 2006 | US |
Child | 12583006 | US |