1. Technical Field
The present invention generally relates to searching data relating to a spatial region using a prioritized search order, and more particularly to a Terrain Awareness Warning System (“TAWS”) for use by an aircraft for searching terrain elevation data for a geographic area to determine aircraft terrain clearance.
2. Background Art
Various systems are known in the art that provide warnings and advisory indications of hazardous flight conditions. Among such systems are systems generally known as Ground Proximity Warning Systems (“GPWS”) which monitor the flight conditions of an aircraft and provide a warning if flight conditions are such that inadvertent contact with terrain is imminent. Among flight conditions normally monitored by such systems are radio altitude and rate, barometric altitude and rate, air speed, and flap and gear positions. These parameters are monitored and an advisory signal and/or warning signal is generated when the relationship between the parameters is such that terrain impact is likely to occur.
Other systems improve upon earlier GPWS by utilizing ground-based navigational information. Monitoring stored terrain data and providing modified ground proximity warnings may provide more accurate warnings. U.S. Pat. Nos. 4,646,244, and 4,675,823 each disclose terrain advisory systems that utilize ground-based navigational systems and stored terrain data to provide various ground proximity warnings in relation to the position of the aircraft. U.S. Pat. No. 5,839,080 discloses a Global Positioning System (“GPS”) and stored terrain data to provide warning indications.
Satellite-based navigational systems, such as GPS, which can track longitude, latitude, altitude, groundtrack, and ground speed, are becoming an important and reliable source of information for aircraft. An aircraft's Forward Looking Terrain Avoidance (“FLTA”) system looks ahead of the aircraft during flight along and below the aircraft's lateral and vertical flight path to provide suitable alerts if a potential threat exists of the aircraft colliding or coming too close to terrain. The computation involves searching through a terrain database for terrain cells that are within the search area and violate the Required Terrain Clearance (“RTC”). The RTC is the value set by the Federal Aviation Administration as the permitted flight “floor” for various phases of aircraft flight. The RTC indicates the clearance distance from terrain below which the aircraft should not fly. Searching the search area and finding the cells in violation is expensive in both processor and memory resources.
Two common methods of searching terrain data are sequential and radial. Both of these methods suffer from the deficiency that they expend precious processor and memory resources. For the sequential search method, some common deficiencies include: First, every cell in a rectangular area encompassing the search area is searched, even those cells that are outside the search area boundary. This requires a determination of whether a cell is within the search area or not, which could be complicated and expensive. Second, a large data buffer is needed to store the cells found during the search, the dimension of the buffer needed is difficult to determine accurately because the upper bound could equal the size of the search area which varies by the speed of the plane. Third, sorting the cells in the result buffer by distance to the aircraft position is expensive, especially if a large number of cells are returned in the search and if both distance and bearing are considered.
For the radial search method, some common deficiencies include: First, many possible flight directions are searched, even some of those that are highly unlikely. This requires expensive processing time to be spent on searching all flight directions even when the aircraft is flying straight. Second, because the search is performed in a plurality of radial arms originating at the same point and extending in a fan shape over the underlying data sectioned into a square grid, many cells near the origin of the arms are searched numerous times, and some cells farther from the origin are potentially missed if the radial arms become too far apart at their extents. Third, the position of each point on each radial arm is calculated and terrain data is searched throughout the full database. This is complicated and expensive. Fourth, a large data buffer is needed to store the cell identities found during the search, and the dimension of the buffer needed is difficult to determine accurately because the upper bound could equal the full number of the search points on all radial arms. Fifth, in systems which sort the results, sorting the cells in the result buffer by distance to the aircraft position is expensive, especially if a large number of cells is returned in the search and if both distance and bearing are considered.
Both conventional systems require extensive processor search time and memory storage for crucial Terrain Awareness and Warning systems (“TAWS”), for which the costs of developing, repairing and maintaining are increasing. The additional time required for these searches also reduces the time available for the processor to perform other tasks and lengthens the time in which search results can be made available to a pilot of the aircraft.
The present invention relates to methods, apparatus and a system for searching spatial data in a prioritized manner. In a general form of the invention, spatial data along and adjacent to a search vector is searched by storing a portion of a larger spatial information database into a smaller memory buffer and searching the buffer in a predetermined prioritized order. Different from conventional methods of searching spatial data, particular embodiments of the present invention search the data in the memory buffer in a non-linear order along and adjacent to a search vector, comparing spatial data values stored in select memory cells of the buffer with a predetermined search criteria. The identity of each cell searched which stores a value meeting the search criteria is included in an alert list which, when the length of the list equals a predetermined list length, is used to calculate an alert status for each cell on the list. Each cell in the memory buffer is searched no more than once for each alert cycle. Subsequent cycles may search using the same predetermined search order along the search vector, or a different predetermined search order.
Embodiments of the present invention are also particularly useful for searching geographic terrain data for use with TAWS for aircraft. By reference to a satellite navigation reference signal and possibly other signals that provide an indication of an aircraft's altitude, location and direction of travel, a processor determines a search vector in relation to the aircraft's coordinates. The processor accesses a geographic terrain information database and stores elevation data corresponding to the spatial area portion of the database representing the geography over which the aircraft is traveling in a memory buffer. Using a predetermined prioritized order for searching the cells of the memory buffer along the search vector, the processor compares the aircraft's projected altitude at each cell with the elevation value stored in the cell plus an appropriate RTC value for the flight phase (elevation+RTC=“clearance elevation”). Particular embodiments of the invention employ a non-linear prioritized order. For all searched cells where the projected altitude of the aircraft is less than the clearance elevation at that cell, the identities of the cells are stored in an alert list until the list is full or the predetermined order is finished. When a predetermined number of alert list elements have been recorded, the processor, in association with a look-ahead warning generator, provides either caution or warning alert indicators to a pilot of the aircraft based upon a separate time-related analysis of the data. The alert indicators may be visual, aural, or both. Embodiments of the invention employ a select number of predetermined search patterns between which a selection is made and implemented for an alert cycle depending upon an exterior criteria such as a pilot's actions or the aircraft's movements. In particular embodiments of the invention, the predetermined search pattern searches a few cells in the direction of the flight path, then back-steps and searches unsearched cells adjacent the flight path, then returns to the flight path and searches at least one next unsearched cell in the flight path, then again searches unsearched cells adjacent the flight path.
Particular advantages of the present invention are found in significantly reduced processing and computation requirements for system resources employing embodiments of the present invention for use in spatial data searching. By storing a relevant portion of the larger terrain information database in a smaller memory buffer, less data needs to be accessed and dismissed to find relevant data, significantly reducing the calculations needed. By searching the cells of the memory buffer no more than once per alert cycle and in a predetermined prioritized order, the alert list is automatically prioritized and cell data is not searched repeatedly. By searching each memory buffer cell using a single simple comparison, searching the search region only until the alert list reaches a predetermined number of cells, and performing a time-related analysis on the significantly shorter list of cells rather than the entire database, even further processing and calculation savings is achieved as well as providing and displaying relevant alert information to the pilots more quickly.
The foregoing and other features and advantages of the present invention will be apparent from the following more detailed description of the particular embodiments of the invention, as illustrated in the accompanying drawings.
As discussed above, embodiments of the present invention relate to searching spatial region data using a prioritized search order. One embodiment of the invention relates specifically to a Terrain Awareness Warning System (“TAWS”) for use by an aircraft for searching terrain elevation data.
The purpose of a FLTA function of an aircraft is to predict whether the aircraft is heading toward terrain that will cause the terrain clearance to be less than the clearance required by federal guidelines. The Federal Aviation Administration (“FAA”) establishes minimum terrain clearance levels that must be maintained for safety. The precise minimum clearance levels required for any given situation depends upon the type of aircraft, flight pattern, and the like. The FAA also determines minimum performance standards for TAWS equipment used by an aircraft. One example of FAA TAWS equipment standards may be found in the Technical Standard Order TSO-C151a issued in November 1999 by the FAA.
Embodiments of the present invention reduce the amount of data which must be stored by a TAWS to operate properly, and reduce the number of terrain data cells which must be searched for a useful result by focusing upon the cells containing data most important to the aircraft; those directly in front of and immediately adjacent to the aircraft's flight path. As is explained further herein, methods of searching spatial data according to embodiments of the present invention are also applicable to searching other spatial data sets where a primary area of importance is identified and a prioritized data search is desired.
Referring to
The general process for searching the spatial data once it is loaded into the memory buffer is to search along the vector in an order which focuses upon the most important and closest cells first, those being the cells along and adjacent to the search vector. In many cases, when searching data associated with spatial coordinates, data of interest relates to or is expected near a particular path through a spatial region. For these cases, search methods of the present invention are particularly useful. In simple terms, the method involves searching a few cells along a vector path, then back-stepping and searching a few cells immediately adjacent the vector path, then returning to the next one or two unsearched cells ahead along the vector path, then searching the next unsearched cells adjacent vector path. In this way, the order of the search through the cells, and thus the spatial region data stored in the buffer, may be numbered. Each sequential search cycle may be performed in the same order through the memory buffer data, each search computation relating only to the data value, search criteria and the cell location in relation to the originating cell. By searching in this manner, the most important cells, those along the vector path are searched first, but the cells adjacent the vector path are not left until last. The adjacent cells are intermixed in the search order with those cells immediately on the vector path to provide a prioritized search pattern. Those cells that are beyond a predetermined distance from the vector path 20 are not searched through this method.
Data from the first spatial cell is compared with the search criteria (Step 6). If the data meets the search criteria, the cell identity is stored in an alert list. Data from the second spatial cell is then compared with the search criteria (Step 8), and the cell identity is stored if the data meets the search criteria. This comparison process continues until a predetermined number of cell identities, or elements, have been identified and included in the alert list (Step 10).
The terrain data stored in the geographic terrain database is stored according to latitudinal and longitudinal positions. Accordingly, and because the earth is not a perfect sphere, the spatial area represented by each database subdivision is not exactly identical as far as its actual dimensions, and is not exactly a square or rectangular region. Thus, the geographic region represented by each cell in the memory buffer varies by region. Since the earth is approximately an ellipsoid, if the earth's surface is divided into latitude/longitude grids, the area that each grid represents will get smaller towards the pole. In an effort to keep the variation to a minimum, embodiments of the present invention divides the earth's surface into latitude bands. For example, 0 to N 60, N60 to N 71, N 71 to N 76, etc. to make groupings of longitude divisions. Even so, the size of the cell still varies to a degree, with a grid size of approximately 0.25 square nautical miles being around the equator. However, the size of the cells does not have significant effect on the searching method used herein. Other smaller and larger cell sizings and geographical representations known in the art may also be applied using embodiments of the present invention depending upon the particular TAWS application. The memory buffer cell 42 representations are shown, for illustrative purposes only, as identically sized and shaped squares.
The proportional spatial dimensions represented by the subset of terrain data from the geographic terrain database, which are dependent upon the length and direction of the search vector, are dependent upon the direction of travel for the aircraft and the aircraft speed. Larger proportional spatial dimensions will result in a larger subset of terrain data in the memory array 40 of the data buffer. The geographic dimensions of each subdivision of the geographic terrain database may be set to any scale by one of ordinary skill in the art.
After terrain data for an appropriate geographic region is copied into the spatial data buffer, each cell 42 of the memory array 40 contains elevation data for a corresponding subdivision of the geographic region. The cells 42 each include a maximum value of the terrain elevation within a geographic region corresponding to the cell for a search. The flight path for an aircraft 46, and search vector for the search, is shown as an arrow 44. The box 48 illustrates an approximate search width of interest around the primary flight path. Box 49 illustrates a list of cells, according to their position in the data array 40, which meet predetermined elevation search criteria. The cells may alternatively be identified in the list by other identifying indicia such as spatial coordinates, latitude and longitude, and the like.
In reference to
In reliance upon the aircraft's location, air speed, and direction of travel, as discussed above, a portion of a terrain information database 92 is identified and loaded into the terrain buffer space 94 (Step 54). The full size of the terrain buffer space 94 is selected based upon a safe look-ahead distance for the maximum air speed at which the aircraft may travel. Each time data is loaded into the terrain buffer space 94 as buffer data, a portion of the terrain buffer space 94 is configured to receive a data set having a predetermined dimension based upon a safe look-ahead distance for the actual air speed and heading of the aircraft.
After the elevation data for the pertinent geographic region is loaded into the terrain buffer space 94, a search of the buffer space may begin in the primary flight path direction (Step 56) according to a predetermined path and cell order through the buffer space 94. The exact sequence of cell search is not crucial, only that the most important cells to the particular aircraft be searched first. However, it has been found that by following a search path which moves forward a few cells in the direction of the flight path, returns to search a few cells adjacent to the flight path, moves forward to search an unsearched cell in the direction of the flight path, then returns again to search more cells adjacent the flight path, such as that shown in
It is also contemplated that the algorithm followed to determine the precise path order may change during sequential alert cycles depending upon the actions of the pilot, the flight behavior of the aircraft, or any number of other criterion. Any number of prioritized search path orders is possible and contemplated for use with the TAWS of the present invention. Whatever the search pattern, however, it is followed by the algorithm controlled by the processor 82 (
In general terms, the search criteria for a cell may be any criteria relevant to the purpose for the search and the data contained in each cell. For a TAWS search, where each cell contains an elevation value, it is desirable to identify all cells having a clearance elevation value (elevation plus RTC), or alert value, greater than the aircraft's projected flight altitude for that cell. By establishing a clearance elevation value for each cell, a lower boundary is established.
Using the ground speed and vertical velocity of the aircraft, the flying altitude of the aircraft is projected out to each cell in the memory buffer for comparison. By projecting the aircraft flying altitude forward based upon its vertical velocity, the aircraft's present course may be evaluated against the terrain clearance boundary, and an appropriate alert provided when the projected aircraft altitude is below the terrain clearance boundary. For example, if the aircraft is cruising over terrain at approximately 5000 ft, the aircraft must maintain at least a 700-foot clearance between the aircraft and the terrain. Accordingly, 700 feet clearance is subtracted from the projected aircraft altitude when compared with each cell elevation value to compensate for the terrain clearance boundary through a projected aircraft safety altitude. Subtracting 700 feet from the projected aircraft altitude requires fewer resources than adding 700 feet to the elevation value of each cell. Nevertheless, in the alternative, 700 feet clearance may be added to the elevation value for each cell within the search area to create a terrain clearance boundary for comparison with the projected altitude of the aircraft. In either case, if the elevation of the aircraft has a projected altitude of 5700 feet at a cell, and the elevation value for the cell is only 3500 feet, no alert would be needed. Alternatively, if the elevation value for the cell were 5800 feet, the cell would be included within the alert list (element 49 of
With specific reference again to
The ability of the present system to search less than the entire region before providing the alerts to the pilot is enabled by the cell search being performed in a prioritized order. Otherwise, the cells identified at any point in a search may not be the most relevant cells. Thus, if the list is full, the processor 82 and look-ahead warning generator 96 (
Referring again to
Copying a subset of the larger terrain information database to a terrain buffer and comparing the projected aircraft elevation against a single alert value for each cell eliminates significant processing and calculations as compared to conventional systems and methods. By searching the cells of the terrain data buffer in a predetermined prioritized order, cells for the buffer are only searched once for each alert cycle and the alert list is automatically prioritized, further reducing the processing and calculations required. By searching the terrain data buffer cells only until a predetermined number of alert cells have been identified, even further reduction of processing and calculations is achieved over conventional systems and methods.
As illustrated in
Once a list of alert cells has been identified, the look-ahead warning generator 96 and/or the processor 82 (
For each cell within the cell list, further analysis includes a time-based comparison to determine whether a pilot has sufficient time to correct the aircraft's flight path to clear the elevation clearance value for each alert cell. For the following equations: Ttravel=aircraft travel time to geographic region corresponding to cell (Ttravel may be calculated by dividing the distance to the geographic region corresponding to the cell by the speed of the aircraft); Tpuc=minimum time required for pilot to pull-up to clear terrain elevation with required terrain clearance (“RTC”) amount without additional measures; Trc=estimated pilot reaction delay time allowed for caution alert; Tpuw=minimum time required for pilot to pull-up to clear terrain elevation; Trw=estimated pilot reaction delay time allowed for warning alert. Tpuc and Tpuw are calculated using the assumption of constant pull-up and climb gradient given by FAA guidelines. Trc and Trw are calculated based upon predetermined research indicating pilot response times from receiving a warning plus additional time to provide a buffer to ensure clearance. Many of the elements of the calculations described herein are aircraft dependent and may be stored in a database table and accessed by the processor 82. By storing the relevant data in a look-up table that includes values for a plurality of aircraft types, the system thereby may include a scalable solution adaptable to a number of aircraft types. The actual duration for the additional buffer of time depends upon how far ahead of the latest response distance a pilot should receive an alert. A shorter buffer of time may result in fewer nuisance alerts given because the pilot has already made corrections. However, a shorter buffer of time will also reduce the available time to react and may result in more warning alerts being given. Because the time available to react to a warning alert is less than the time available to react to a caution alert, Trw is generally less than Trc. RTC is the minimum clearance amount established by the FAA. Keep in mind that the cells identified in the alert list are only those for which the projected aircraft altitude is already below the lower boundary for the cell.
A first embodiment of the further analysis for each cell in the alert list involves a comparison of Ttravel with one or two time values as explained below:
First, if Ttravel<Tpuw+Trw, a Warning alert should be issued for the cell because the time required for the pilot to pull-up to clear the terrain obstacle without additional measures plus the reaction time is greater than the time to travel to the region represented by the cell. If no action is taken, the danger of terrain impact is imminent. If the criteria of this equation is met and a Warning alert should be issued, no further comparison is needed and another cell may be analyzed.
Second, if Ttravel<Tpuc+Trc, a Caution alert should be issued for the cell because the time required for the pilot to react and pull-up from the pilot's current flight path to clear the terrain obstacle by the RTC is greater than the time to travel to the region represented by the cell. If the pilot takes no action, the aircraft may enter that region without the required terrain clearance. If Ttravel is not less than Tpuc+Trc, no alert is needed. This condition is automatically discovered by virtue of the first two comparisons and no specific comparison is needed.
In this first embodiment of the analysis, some of the cells may be marked as Warning alerts, some of the cells may be marked as Caution alerts, and other of the cells may remain unmarked. These unmarked cells were indicated as cells where the flight path of the aircraft, if continued, would extend below the clearance elevation boundary. However, because the cells are still far enough out or relatively low enough in elevation for the pilot to easily correct the flight path to avoid the alert and may do so on his or her own without a warning, the alerts for these cells are not given until the cells are closer to the aircraft.
A second embodiment of the further analysis for each cell in the alert list involves a comparison of Ttravel with only one time value as explained below:
If Ttravel<Tpuw+Trw, a Warning alert is issued for the cell because the time required for the pilot to pull-up to clear the terrain obstacle without additional measures plus the reaction time is greater than the time to travel to the region represented by the cell. If no action is taken, the danger of terrain impact is imminent.
In this second embodiment of the analysis, some of the cells may be marked as Warning alerts and the remainder of the alert cells will be marked as Caution alerts. Because each of the cells in the alert list were previously indicated as those cells in which the projected altitude of the aircraft is below the clearance elevation boundary, each of the alert cells are marked with an alert. The second embodiment of the analysis, in contrast to the first embodiment, will result in more Caution alerts being issued, but all of the alerts are for cells within the look-ahead distance and along or adjacent to the search vector. If these Caution alerts are too much of a nuisance, the look-ahead distance may be shortened to reduce the number of alerts given farther away, or a second comparison for a Caution alert time may be provided as with the first embodiment.
For the above equations described with relation to both the first and second embodiments of the analysis, if there is no need for the aircraft to pull-up to clear the terrain, Tpuw will be zero, and the equation for the Warning alert simply reduces to Ttravel<Trw. This insures that a more serious alert will be given when the aircraft gets closer to the obstacle, to make the pilot aware that the aircraft does not have the required terrain clearance even if the current altitude is above the terrain elevation.
Those of ordinary skill in the art will understand how to calculate Ttravel, Tpuw and Tpuc and how to determine appropriate values for Trc and Trw. The following, with reference to
a=v
2
/r
0.25g=v2/r
r=v2/0.25g
tan(α)=d/r
d=r tan(α)=r tan(θ/2)
sin(θ)=h/d
h=d sin(θ)
d′=d cos(θ)
x=d+d′
Vy=v tan(θ)
To simplify the calculations, the velocity of the aircraft during and after pull-up may be approximated as a constant equal to the current velocity of the aircraft. Using this basic understanding of the relationships between the constants and variables provided above, Tpuw and Tpuc may be calculated as follows:
In summary, Tpuw and Tpuc may be determined by calculating the time spent during the pull-up on a circular track (
The underlying geographic region may be displayed in any method or in any configuration known or used in the art. However, in particular embodiments of the display of the present invention, such as that shown in
In addition to the terrain information being displayed, and pursuant to Step 66 of
The embodiments and examples set forth herein were presented to best explain the present invention and its practical application and to thereby enable those of ordinary skill in the art to make and use the invention. However, those of ordinary skill in the art will recognize that the foregoing description and examples have been presented for the purposes of illustration and example only. The description as set forth is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the teachings above without departing from the spirit and scope of the forthcoming claims.
The present application is a continuation-in-part and claims priority benefit, with regard to all common subject matter, of an earlier-filed U.S. patent application entitled “System, Method and Apparatus for Searching Geographic Area Using Prioritized Spatial Order”, Ser. No. 10/337,598, filed Jan. 7, 2003 now U.S. Pat. No. 6,745,115.
Number | Name | Date | Kind |
---|---|---|---|
3668623 | Caaposs | Jun 1972 | A |
4071843 | Marien | Jan 1978 | A |
4224669 | Brame | Sep 1980 | A |
4319218 | Bateman | Mar 1982 | A |
4433323 | Grove | Feb 1984 | A |
4484192 | Seitz et al. | Nov 1984 | A |
4495483 | Bateman | Jan 1985 | A |
4567883 | Langer et al. | Feb 1986 | A |
4639730 | Paterson et al. | Jan 1987 | A |
4646244 | Bateman et al. | Feb 1987 | A |
4675823 | Noland | Jun 1987 | A |
4684948 | Bateman | Aug 1987 | A |
4792799 | Grove | Dec 1988 | A |
4818992 | Paterson | Apr 1989 | A |
4849756 | Bateman | Jul 1989 | A |
4857923 | Bateman | Aug 1989 | A |
4894655 | Joguet et al. | Jan 1990 | A |
4903212 | Yokouchi et al. | Feb 1990 | A |
4914436 | Bateman et al. | Apr 1990 | A |
4916448 | Thor | Apr 1990 | A |
4939513 | Paterson et al. | Jul 1990 | A |
4940987 | Frederick | Jul 1990 | A |
4951047 | Paterson et al. | Aug 1990 | A |
4980684 | Paterson et al. | Dec 1990 | A |
4987413 | Grove | Jan 1991 | A |
5001476 | Vermilion et al. | Mar 1991 | A |
5038141 | Grove | Aug 1991 | A |
5075685 | Vermilion et al. | Dec 1991 | A |
5086396 | Waruszewski, Jr. | Feb 1992 | A |
5136512 | Le Borne | Aug 1992 | A |
5140532 | Beckwith, Jr. et al. | Aug 1992 | A |
5153588 | Muller | Oct 1992 | A |
5166682 | Bateman | Nov 1992 | A |
5187478 | Grove | Feb 1993 | A |
5192208 | Ferguson et al. | Mar 1993 | A |
5196847 | Bateman | Mar 1993 | A |
5202690 | Frederick | Apr 1993 | A |
5220322 | Bateman et al. | Jun 1993 | A |
5265025 | Hirata | Nov 1993 | A |
5293318 | Fukushima | Mar 1994 | A |
5369589 | Steiner | Nov 1994 | A |
5389712 | El Sayed et al. | Feb 1995 | A |
5392048 | Michie | Feb 1995 | A |
5410317 | Ostrom et al. | Apr 1995 | A |
5414631 | Denoize et al. | May 1995 | A |
5420582 | Kubbat et al. | May 1995 | A |
5442556 | Boyes et al. | Aug 1995 | A |
5448233 | Saban et al. | Sep 1995 | A |
5448241 | Zeoli et al. | Sep 1995 | A |
5485156 | Manseur et al. | Jan 1996 | A |
5488563 | Chazelle et al. | Jan 1996 | A |
5495249 | Chazelle et al. | Feb 1996 | A |
5511153 | Azarbayejani et al. | Apr 1996 | A |
5519392 | Oder et al. | May 1996 | A |
5638282 | Chazelle et al. | Jun 1997 | A |
5661486 | Faivre et al. | Aug 1997 | A |
5677842 | Denoize et al. | Oct 1997 | A |
5781126 | Paterson et al. | Jul 1998 | A |
5798712 | Coquin | Aug 1998 | A |
5839080 | Muller et al. | Nov 1998 | A |
5884223 | Tognazzini | Mar 1999 | A |
5892462 | Tran | Apr 1999 | A |
5936552 | Wichgers et al. | Aug 1999 | A |
6002347 | Daly et al. | Dec 1999 | A |
6038498 | Briffe et al. | Mar 2000 | A |
6043758 | Snyder, Jr. et al. | Mar 2000 | A |
6076042 | Tognazzini | Jun 2000 | A |
6088634 | Muller et al. | Jul 2000 | A |
6088654 | Lepere et al. | Jul 2000 | A |
6092009 | Glover | Jul 2000 | A |
6122570 | Muller et al. | Sep 2000 | A |
6125432 | Hanami et al. | Sep 2000 | A |
6127944 | Daly et al. | Oct 2000 | A |
6138060 | Conner et al. | Oct 2000 | A |
6154151 | McElreath et al. | Nov 2000 | A |
6216064 | Johnson et al. | Apr 2001 | B1 |
6219592 | Muller et al. | Apr 2001 | B1 |
6233522 | Morci | May 2001 | B1 |
6292721 | Conner et al. | Sep 2001 | B1 |
6304800 | Ishihara et al. | Oct 2001 | B1 |
6347263 | Johnson et al. | Feb 2002 | B1 |
6433729 | Staggs | Aug 2002 | B1 |
6456940 | Higgins | Sep 2002 | B1 |
6489916 | Block | Dec 2002 | B2 |
6690298 | Barber et al. | Feb 2004 | B1 |
6745115 | Chen | Jun 2004 | B1 |
6765965 | Hanami et al. | Jul 2004 | B1 |
6778605 | Hamanaka | Aug 2004 | B1 |
6793173 | Salesse-Lavergne | Sep 2004 | B2 |
6879280 | Bull et al. | Apr 2005 | B1 |
6995690 | Chen et al. | Feb 2006 | B1 |
7064680 | Reynolds et al. | Jun 2006 | B2 |
20010056316 | Johnson et al. | Dec 2001 | A1 |
20020041631 | Arita et al. | Apr 2002 | A1 |
20020089432 | Staggs et al. | Jul 2002 | A1 |
20020131500 | Gandhi et al. | Sep 2002 | A1 |
20030063673 | Riemens et al. | Apr 2003 | A1 |
20030107499 | Lepere et al. | Jun 2003 | A1 |
20030225489 | Tsao | Dec 2003 | A1 |
20050007270 | Block | Jan 2005 | A1 |
20050105616 | Kim et al. | May 2005 | A1 |
Number | Date | Country | |
---|---|---|---|
Parent | 10337598 | Jan 2003 | US |
Child | 10720371 | US |