Dynamic cell CDMA code assignment system and method

Information

  • Patent Grant
  • 6891813
  • Patent Number
    6,891,813
  • Date Filed
    Tuesday, December 12, 2000
    24 years ago
  • Date Issued
    Tuesday, May 10, 2005
    20 years ago
  • CPC
  • US Classifications
    Field of Search
    • US
    • 370 254000
    • 370 255000
    • 370 310200
    • 370 316000
    • 370 317000
    • 370 320000
    • 370 323000
    • 370 324000
    • 370 325000
    • 370 328000
    • 370 329000
    • 370 331000
    • 370 334000
    • 370 335000
    • 370 338000
    • 370 339000
    • 370 341000
    • 370 342000
    • 370 431000
    • 370 437000
    • 370 441000
    • 375 146000
    • 375 346000
    • 375 347000
    • 455 403000
    • 455 422100
    • 455 445000
    • 455 446000
    • 455 450000
    • 455 456300
    • 455 500000
    • 455 522000
    • 342 354000
    • 343 745000
  • International Classifications
    • H04Q007/20
    • Term Extension
      784
Abstract
A communications system and method of operating the communications system includes a high altitude communication device that communicates with a plurality of user terminals and a gateway station. The gateway station couples the users to terrestrial networks and other users. The high altitude communication device has a controller that assigns a first code to a beam of a first plurality of users. When one of the first plurality of users moves to interfere with one of the other of the first plurality of users, the beam associated with the user is reassigned another code.
Description
TECHNICAL FIELD

The present invention relates generally to communications systems, and more particularly, to a code division multiple access system particularly suitable for mobile applications.


BACKGROUND ART

In this communication age, content providers are increasingly investigating ways in which to provide more content to users as well as interfacing with users.


Communication satellites have become commonplace for use in many types of communication services, e.g., data transfer, voice communications, television spot beam coverage, and other data transfer applications. As such, satellites transmit and receive large amounts of signals used in either a “bent pipe” or “spot array” configuration to transmit signals to desired geographic locations on the earth.


Because the frequency resources are scarce for over-the-air transmission, various encoding schemes are used to provide a greater number of communication signals within an allocated communication band. Such encoding schemes include code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), or combination of these schemes. Further, to prevent interference the schemes may operate at various frequencies.


CDMA systems are commonly used in mobile applications. In the mobile applications a plurality of base stations are positioned to provide coverage for a cell of a service area. Each of the base stations has a plurality of orthogonal codes that are used in each base station. The same group of orthogonal codes are reused in a cell covered by another base station a predetermined distance away. No central code management resource is needed because the base station with the same orthogonal codes is located sufficient distance so that interference does not occur. As the mobile user travels throughout the service area, frequency switching must occur often as the user travels into the range of another base station. Frequency switching may cause inconvenience such as discontinuity during switching time. Also, the additional signaling required for frequency switching adds to higher overhead in the system.


It would therefore be desirable to provide a CDMA management scheme that reduces the amount of switching of users between the various orthogonal codes.


SUMMARY OF THE INVENTION

It is therefore one object of the invention to provide an improved CDMA system that allows minimal switching of CDMA codes over a service area.


In one aspect of the invention, a method for operating a communication system comprises the steps of:

    • assigning a first code to a first beam of a mobile user;
    • assigning the first code to a second beam of a user;
    • moving the first beam with the mobile user;
    • continually determining whether an interference occurs between the first beam and the second beam;
    • when an interference occurs, reassigning a second code to the first beam.


In a further aspect of the invention, a communications system has a first mobile user device and a second user device. A high altitude communications device is in communication with the first mobile user device and the second user device. The high altitude communications device assigns a first beam having a first code to the first mobile user and assigns a second beam having the first code to the second user. The device continually determines whether an interference occurs between the first beam and the second beam and, when an interference occurs, reassigns a second code to the first beam.


One advantage of the invention is that the complexity of the overall system is reduced and thereby the overall system cost is reduced. By reducing the complexity the weight of the payload for the high altitude communications device is also reduced.


Other objects and features of the present invention will become apparent when viewed in light of the detailed description of the preferred embodiment when taken in conjunction with the attached drawings and appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a system diagram of a preferred embodiment in the invention.



FIG. 2A is a octagonal approximation of a circle representing the Euclidean distance between two points.



FIG. 2B is a polygonal approximation of an ellipse.



FIG. 3 is a flow chart illustrating the preferred method of operating the present invention.



FIG. 4 is a plot illustrating a first code assignment of the present invention.



FIG. 5 is a plot of a second code assignment according to the present invention.



FIG. 6 is a plot of a third code assignment according to the present invention.



FIG. 7 is a plot showing the combination of a four code assignment system.





BEST MODES FOR CARRYING OUT THE INVENTION

In the following figures the same reference numerals are used to identify the same components in the various views.


The present invention is applicable to many communications systems including various mobile, fixed, point-to-point broadcast and other types of communications.


Referring now to FIG. 1, a communications system 10 is used to cover a predetermined service area 12 on the earth's surface. A plurality of user terminals 14M and 14F are used to illustrate mobile users and fixed users respectively. Mobile user terminals 14M may comprise but are not limited to automotive applications, personal digital assistant applications, and cellular phone applications. Fixed user terminals 14F may, for example, comprise business based or home based communications systems. Each user terminal 14F,14M may receive a signal with a predetermined signal strength or receive an antenna radiation spot in a spot beam pattern that is available from and provided by high altitude communications device 16.


Communications system 10 further includes a gateway station 18 that is coupled to terrestrial networks 20 and a device operations center 22. Both gateway station 18 and device operations center 22 are in communication with high altitude communications device 16. Gateway station 18 provides a link between user terminals 14F,14M and terrestrial networks 20 through high altitude communications device 16. Device operations center 22 provides command and control functions to communications device 16. Although illustrated as two separate units, gateway station 18 and device operations center 22 may be combined into the same physical location.


High altitude communications device 16 may, for example, be a low earth orbit satellite (LEO), middle earth orbit (MEO) satellite or a geostationary orbit (GEO) satellite. Also, communications device 16 may also comprise a stratosphere-based platform. A stratospheric platform is preferably an unmanned vehicle that can fly for several months at an altitude of about 60,000 feet above the earth in small circles. The stratospheric platform 16 has numerous advantages including that capacity can be concentrated over a populated area, transmission delays associated with geostationary satellites are significantly reduced, the power for transmitting and receiving is substantially smaller than satellites, and the elevation angles of the system are high. The stratospheric platforms may also deploy relatively rapidly compared to satellites and thus, if the need increases, the system capability may be increased or modified. If the device is a stratospheric platform, the device operation center 22 may control the platform to fly in a small radius flight path over a given spot on the earth. Device operations center 22 may also provide replacement of parts and platforms for system 10.


The platform 16 is used as a communications node for gateway station 18 and user terminals 14M and 14F, each of which have antennas that are pointed in the direction of the platform. The gateway antenna 24 of gateway station 18 and user terminal antennas 26 has a beam width wide enough to maintain communication links with platform 16 throughout the flight path. In the case of a medium earth orbit and low earth orbit satellite, antennas 24,26 may be electronically steered. The antennas 24,26 allow for large data throughput.


High altitude communications device 16 has a controller 28 that is used to control communications with the user terminals 14F,14M. In the present invention, the controller 28 is used to generate a plurality of beams in a code division multiple access system. In a code division multiple access system, each beam is assigned an orthogonal code. Various numbers of users may communicate within a beam. Typically, a predetermined number of codes are used over the service area. As will be further described below, the beams are assigned codes that do not interfere with adjacent beams. Upon the detection of an interference, the code may be switched for a particular beam and thus for a particular user. In the following description, the code referred to is an orthogonal code. However, various groups of orthogonal codes may be classified together as a single code for the purposes of the following description.


Referring now to FIG. 2A, a beam 30 is shown as approximately circular in area. Beam 30 may be approximated, for example, by an octagon 32 for interference purposes. The beam 30 has an outer boundary defined where an interference level is tolerable. For example, the beam 30 may be approximated at the 20-dB side load contour. The interference contours may be of different shape and size throughout the coverage area. This is a result of maximizing the resource utilization instead of equalizing the beam size and shape. If a second beam has a center beyond the beam 30 or an octagonal approximation 32, then no interference is present. An interference is present when the center of another beam is within beam 30 or the approximation of octagon 32. The present invention is particularly suitable for mobile applications and therefore the beams move with the users and continual interference checking must be performed.


Referring now to FIG. 2B, a beam 30′ is illustrated with a polygonal approximately 34. As mentioned above, the beam 30′ may be a variety of shapes depending on the particular system requirements. However, adjacent users should be outside the polygonal approximation 34 to prevent interference.


Referring now to FIG. 3, a method 36 for operating the present invention according to a code division multiple access system is illustrated. As illustrated for simplicity, four code bins 38A-38D are illustrated. The various numbers of users in the system in each code bin are illustrated as well. For example, in bin 38A, 8 users are present, in bin 38B, 10 users are present, in bin 38C, 25 users are present, and in bin 38D, 40 users are present. When a new user comes into the system in step 40, step 42 checks to determine whether there are any empty code bins. If there are empty code bins in step 42, the new user is assigned a code within the empty bin in step 44. In step 46, the code bins are sorted with the number of users in ascending order as illustrated by bins 38A-38D.


Referring back to step 42, if there are no code bins empty, step 48 is executed. In step 48, the position of the user relative to the other code groupings are determined. That is, preferably, the bin 38 with the lowest number of users is selected. The position of the user relative to the other code users in the first bin are determined and an interference contour is developed. If an interference is found, then step 52 is executed in which the code bin with the second lowest number of users is checked to determine whether there is an interference between the location of the second user and the other users of the second code. In step 54, if an interference is found in the second code, the codes are incremented until a suitable code is found. That is, if an interference is found in step 54, step 52 is re-executed until a suitable code is found.


If in step 50 or 54 no interference is found, then the user is assigned a code in step 56. The bins are then resorted in step 46 to an ascending order for further interference determinations. After step 56, step 58 is executed that provides a continual interference check for all users. Because the system is suitable for mobile applications, the users are continually moving and thus continual checks are necessary to prevent interference between the codes as the movers move about the service area 12. In step 58, if an interference is not found between a mobile user and other users, then step 58 is continually executed.


If in step 58 interference is found between the mobile user and other users, then steps 42 et seq. are executed as described above so that the user may be reassigned another code that does not interfere with other users.


Thus, in the present invention, the user is assigned a code and the beam moves with the user until the user interferes with another user with the same code. Then, another code is assigned to the beam corresponding with the user.


Referring now to FIG. 4, a plurality of users 62 are illustrated with a corresponding beam 63. Although the beams 63 overlap, the beams do not incorporate another user and thus the orthogonal code assignment for the beams 63 do not interfere.



FIG. 4 also illustrates that the size of the beam may vary. As those skilled in the art would recognize, the beam pattern may also be referred to as a “color.” Thus, FIG. 4 illustrates a single color of code assignments. As mentioned above, beams 63 may also represent a plurality of codes rather than a single code.


Referring now to FIG. 5, a plurality of users 64 having corresponding beam 65 is illustrated in a non-interfering manner. FIG. 5 thus illustrates a second color.


Referring now to FIG. 6, a third set of users 66 is illustrated with corresponding beams 67. Thus, FIG. 6 illustrates a third color of a multi-color system.



FIG. 7 illustrates a system illustrating the combination of the various users over the service area 12. FIG. 7 is merely illustrative of a potential snapshot of the present invention. Because the system is designed for mobile users, the various positions of the users changes over time.


Advantageously, the present invention provides a system that allows the user to maintain a code assignment until the code assignment interferes with another user. Thus, the controller 28 on the high altitude communications device 16 may be reduced in size and complexity. This type of configuration is particularly suitable for high altitude communications devices such as satellites or stratospheric platforms. Also, only four code assignments have been illustrated. However, those skilled in the art will recognize more or a greater number of code assignments may be used. Thus, no predefined cells are present in the present invention.


While particular embodiments of the invention have been shown and described, numerous variations alternate embodiments will occur to those skilled in the art. Accordingly, it is intended that the invention be limited only in terms of the appended claims.

Claims
  • 1. A method of operating a communication system comprising the steps of: assigning a first code to a first beam of a mobile user; assigning a first code to a second beam of a second user; moving the first beam with the mobile user; continually determining whether an interference occurs between the first beam and the second beam; and, when an interference occurs between the first beam and the second beam, reassigning a second code to the first beam from a plurality of code bins.
  • 2. A communications system comprising: a first mobile user device; a second user device; and, a high altitude communications device in communication with the first mobile user device and the second user device, the high altitude communications device assigning a first beam having a first code to the first mobile user and assigning a second beam having the first code to the second user, said device continually determining whether an interference occurs between the first beam and the second beam and, when an interference occurs, reassigning a second code to the first beam from a plurality of code bins.
  • 3. A system as recited in claim 2 wherein said high altitude communications device comprises a communications platform.
  • 4. A system as recited in claim 3 wherein said communications platform is located in a stratospheric location.
  • 5. A system as recited in claim 2 wherein said high altitude communications device comprises a satellite.
  • 6. A system as recited in claim 5 wherein said satellite is selected from the group consisting of a medium earth orbit satellite, a low earth orbit satellite, and a geostationary satellite.
  • 7. A system as recited in claim 2 further comprising a device operations center.
  • 8. A system as recited in claim 7 further comprising a gateway station coupled to the high altitude communication device.
  • 9. A system as recited in claim 8 wherein said gateway station couples said first mobile user device and said second user device to terrestrial networks through the high altitude communications device.
  • 10. A method of operating a communications system comprising the steps of: introducing a first user into the system; establishing a plurality of code bins; when an empty code bin exists, assigning the first user to an empty code bin; when no empty code bin exists, determining whether the first user may be assigned to a first one of the plurality of code bins by performing an interference check; when the interference check is not passed, determining a second one of the plurality of code bins; performing an interference check with the second of the plurality of code bins; and, when an interference of the second code bin is not found, assigning the first user a second code associated with the second bin.
  • 11. A method as recited in claim 10 further comprising introducing subsequent users into the system; performing an interference check for each of the subsequent users; assigning a non-interference code to each of the subsequent users.
  • 12. A method as recited in claim 10 further comprising continually determining whether an interference occurs between the first user and subsequent users, when an interference occurs assigning a non-interfering code thereto.
  • 13. A method as recited in claim 10 wherein introducing a first user into the system comprises introducing the first user into the system comprising an automotive communication system.
  • 14. A method as recited in claim 10 wherein introducing a first user into the system comprises introducing the first user into the system comprising a personal digital assistant communication system.
  • 15. A method as recited in claim 10 wherein introducing a first user into the system comprises introducing the first user into the system comprising a cellular phone communication system.
  • 16. A method as recited in claim 10 wherein introducing a first user into the system comprises introducing the first user into the system comprising a business-based communication system.
  • 17. A method as recited in claim 10 wherein introducing a first user into the system comprises introducing the first user into the system comprising a home-based communication system.
  • 18. A method as recited in claim 10 further comprising the step of monitoring a number of users of a code in each of the plurality of code bins; wherein the step of assigning the first user a second code comprises assigning a second code to the first user corresponding to a second code bin having a least number of users.
  • 19. A system as recited in claim 2 wherein said communication system comprises a personal digital assistant communication system.
  • 20. A system as recited in claim 2 wherein said communication system comprises a cellular phone communication system.
  • 21. A system as recited in claim 2 wherein said communication system comprises a business-based communication system.
  • 22. A system as recited in claim 2 wherein said communication system comprises a home-based communication system.
  • 23. A method for code management system comprising: assigning each one a plurality of users a code from a plurality of non-interfering codes; moving the plurality of users; continually monitoring the plurality of users for an interference; and when a first user of the plurality of users interferes with another of said plurality of users, assigning another non-interfering code to said first user from a plurality of code bins.
  • 24. A method for code management comprising: establishing a plurality of code bins having a respective plurality of codes; assigning each of said plurality of users to one of the plurality of codes so that each of said plurality of users does not have an interfering code with an adjacent user; moving the plurality of users; continually monitoring the plurality of users for an interference; when one of the plurality of users interferes with another of said plurality of users, assigning a non-interfering code to said one of the plurality of users.
  • 25. A method as recited in claim 24 further comprising the step of monitoring a number of users of a code in the code bin; wherein the step of assigning a non-interfering code to said first user comprises assigning a non-interfering code corresponding to one of the plurality of code bins having a least number of users.
US Referenced Citations (234)
Number Name Date Kind
2470787 Nosker May 1949 A
3384891 Anderson May 1968 A
3541553 Gubin Nov 1970 A
3544995 Bottenburg et al. Dec 1970 A
3593138 Dunn et al. Jul 1971 A
3611435 Cooper Oct 1971 A
3720953 Ajioka Mar 1973 A
3742498 Dunn Jun 1973 A
3982075 Jefferis et al. Sep 1976 A
4019138 Wantanabe et al. Apr 1977 A
4161730 Anderson Jul 1979 A
4161734 Anderson Jul 1979 A
4236161 Ohm Nov 1980 A
4359733 O'Neill Nov 1982 A
4555782 Alaria et al. Nov 1985 A
4613864 Hofgen Sep 1986 A
4635063 Chang et al. Jan 1987 A
4689625 Barmat Aug 1987 A
4799065 Thompson Jan 1989 A
4819227 Rosen Apr 1989 A
4823341 Rosen Apr 1989 A
4897661 Hiraiwa Jan 1990 A
4901307 Gilhousen et al. Feb 1990 A
4979170 Gilhousen et al. Dec 1990 A
4994809 Yung et al. Feb 1991 A
5006855 Braff Apr 1991 A
5017927 Agrawal et al. May 1991 A
5077562 Chang et al. Dec 1991 A
5077759 Nakahara Dec 1991 A
5081464 Renshaw Jan 1992 A
5099245 Sagey Mar 1992 A
5109390 Gilhousen et al. Apr 1992 A
5111209 Toriyama May 1992 A
5126748 Ames et al. Jun 1992 A
5151706 Roederer et al. Sep 1992 A
5218619 Dent Jun 1993 A
5233626 Ames Aug 1993 A
5245612 Kachi et al. Sep 1993 A
5278863 Briskman Jan 1994 A
5319673 Briskman Jun 1994 A
5327455 DeGaudenzi et al. Jul 1994 A
5361398 Christian et al. Nov 1994 A
5365447 Dennis Nov 1994 A
5379320 Fermandes et al. Jan 1995 A
5387916 Cohn Feb 1995 A
5408237 Patterson et al. Apr 1995 A
5410314 Frush et al. Apr 1995 A
5416808 Witsaman et al. May 1995 A
5423058 Cudak et al. Jun 1995 A
5423059 LoGalbo et al. Jun 1995 A
5444450 Olds et al. Aug 1995 A
5467282 Dennis Nov 1995 A
5475520 Wissinger Dec 1995 A
5485485 Briskman et al. Jan 1996 A
5510797 Abraham et al. Apr 1996 A
5525995 Benner Jun 1996 A
5550809 Bottomley et al. Aug 1996 A
5555257 Dent Sep 1996 A
5555444 Diekelman et al. Sep 1996 A
5572216 Weinberg et al. Nov 1996 A
5589834 Weinberg Dec 1996 A
5592471 Briskman Jan 1997 A
5594941 Dent Jan 1997 A
5608722 Miller Mar 1997 A
5612701 Diekelman Mar 1997 A
5613219 Vogel et al. Mar 1997 A
5617410 Matsumoto Apr 1997 A
5625640 Palmer et al. Apr 1997 A
5644572 Olds et al. Jul 1997 A
5696766 Yeung et al. Dec 1997 A
5732351 Olds et al. Mar 1998 A
5739785 Allison et al. Apr 1998 A
5754139 Turcotte et al. May 1998 A
5764188 Ghosh et al. Jun 1998 A
5790070 Natarajan et al. Aug 1998 A
5810284 Hibbs et al. Sep 1998 A
5828659 Teder et al. Oct 1998 A
5839053 Bosch et al. Nov 1998 A
5856804 Turcotte et al. Jan 1999 A
5862480 Wild et al. Jan 1999 A
5864579 Briskman Jan 1999 A
5867109 Wiedeman Feb 1999 A
5878034 Hershey et al. Mar 1999 A
5890067 Chang et al. Mar 1999 A
5899957 Loomis May 1999 A
5903549 Von der Embse et al. May 1999 A
5907813 Johnson, Jr. et al. May 1999 A
5907816 Newman et al. May 1999 A
5909460 Dent Jun 1999 A
5909470 Barratt et al. Jun 1999 A
5917447 Wang et al. Jun 1999 A
5918157 Wiedeman et al. Jun 1999 A
5920284 Victor Jul 1999 A
5937332 Karabinis Aug 1999 A
5940774 Schmidt et al. Aug 1999 A
5943331 Lavean Aug 1999 A
5944770 Enge et al. Aug 1999 A
5945948 Buford et al. Aug 1999 A
5946625 Hassan et al. Aug 1999 A
5949766 Ibanez-Meier et al. Sep 1999 A
5956619 Gallagher et al. Sep 1999 A
5966371 Sherman Oct 1999 A
5969674 Von Der Embse et al. Oct 1999 A
5973647 Barrett et al. Oct 1999 A
5974039 Schilling Oct 1999 A
5974317 Djuknic et al. Oct 1999 A
5974324 Henson Oct 1999 A
5982337 Newman et al. Nov 1999 A
5983113 Asanuma Nov 1999 A
5990928 Sklar et al. Nov 1999 A
6002935 Wang Dec 1999 A
6014372 Kent et al. Jan 2000 A
6016124 Lo et al. Jan 2000 A
6018316 Rudish et al. Jan 2000 A
6020845 Weinberg et al. Feb 2000 A
6023463 Wiedeman et al. Feb 2000 A
6028884 Silberger et al. Feb 2000 A
6032041 Wainfan et al. Feb 2000 A
6040798 Kinal et al. Mar 2000 A
6047186 Yu et al. Apr 2000 A
6061562 Martin et al. May 2000 A
6067442 Wiedeman et al. May 2000 A
6072986 Blanchard et al. Jun 2000 A
6088341 Hinedi et al. Jul 2000 A
6104911 Diekelman Aug 2000 A
6111542 Day et al. Aug 2000 A
6119016 Matusevich Sep 2000 A
6125261 Anselmo et al. Sep 2000 A
6138012 Krutz et al. Oct 2000 A
6138020 Galyas et al. Oct 2000 A
6147658 Higashi et al. Nov 2000 A
6150977 Wilcoxson et al. Nov 2000 A
6151308 Ibanez-Meier et al. Nov 2000 A
6157621 Brown et al. Dec 2000 A
6167263 Campbell Dec 2000 A
6169910 Tamil et al. Jan 2001 B1
6173178 Hammill et al. Jan 2001 B1
6175737 Kao Jan 2001 B1
6176451 Drymon Jan 2001 B1
6178328 Tang et al. Jan 2001 B1
6188896 Perahia et al. Feb 2001 B1
6195037 Gross et al. Feb 2001 B1
6195555 Dent Feb 2001 B1
6198920 Doviak et al. Mar 2001 B1
6201797 Leuca et al. Mar 2001 B1
6205320 Coleman Mar 2001 B1
6208858 Antonio et al. Mar 2001 B1
6236834 Poskett et al. May 2001 B1
6240072 Lo et al. May 2001 B1
6243587 Dent et al. Jun 2001 B1
6246363 Yung et al. Jun 2001 B1
6266533 Zadeh et al. Jul 2001 B1
6272317 Houston et al. Aug 2001 B1
6289211 Koorapaty et al. Sep 2001 B1
6295440 Chang et al. Sep 2001 B2
6298238 Dai Oct 2001 B1
6308045 Wright et al. Oct 2001 B1
6311068 Leung et al. Oct 2001 B1
6313790 Chang et al. Nov 2001 B2
6314269 Hart et al. Nov 2001 B1
6317412 Natali et al. Nov 2001 B1
6317420 Schiff Nov 2001 B1
6324381 Anselmo et al. Nov 2001 B1
6324398 Lanzerotti et al. Nov 2001 B1
6336030 Houston et al. Jan 2002 B2
6337980 Chang et al. Jan 2002 B1
6339611 Antonio et al. Jan 2002 B1
6339708 Wang Jan 2002 B1
6340947 Chang et al. Jan 2002 B1
6366256 Ramanujam et al. Apr 2002 B1
6366761 Montpetit Apr 2002 B1
6374080 Uchida Apr 2002 B2
6377208 Chang et al. Apr 2002 B2
6380893 Chang et al. Apr 2002 B1
6381228 Prieto, Jr. et al. Apr 2002 B1
6385434 Chuprun et al. May 2002 B1
6388615 Chang et al. May 2002 B1
6392611 Smith et al. May 2002 B1
6396819 Fleeter et al. May 2002 B1
6408180 McKenna et al. Jun 2002 B1
6414646 Luh Jul 2002 B2
6418158 Vishwanath et al. Jul 2002 B1
6424831 Schiff Jul 2002 B1
6434384 Norin et al. Aug 2002 B1
6438379 Gitlin et al. Aug 2002 B1
6452541 Zhao et al. Sep 2002 B1
6452962 Linsky et al. Sep 2002 B1
6456846 Norin et al. Sep 2002 B2
6463282 Norin et al. Oct 2002 B2
6463294 Holma et al. Oct 2002 B1
6480788 Kilfeather et al. Nov 2002 B2
6501941 Chang et al. Dec 2002 B1
6507314 Chang et al. Jan 2003 B2
6507739 Gross et al. Jan 2003 B1
6513758 Lloyd Feb 2003 B1
6529740 Ganucheau et al. Mar 2003 B1
6542754 Sayers et al. Apr 2003 B1
6563457 Chang et al. May 2003 B2
6567052 Wang et al. May 2003 B1
6570858 Emmons, Jr. et al. May 2003 B1
6574270 Madkour et al. Jun 2003 B1
6591084 Chuprun et al. Jul 2003 B1
6615024 Boros et al. Sep 2003 B1
6633559 Asokan et al. Oct 2003 B1
6665316 Eidson Dec 2003 B1
6756937 Chang et al. Jun 2004 B1
6757546 Hagen et al. Jun 2004 B1
6763242 Feria et al. Jul 2004 B1
20010000167 Chang et al. Apr 2001 A1
20010045903 Chang et al. Nov 2001 A1
20010048389 Nakagawa Dec 2001 A1
20020006795 Norin Jan 2002 A1
20020041575 Karabinis et al. Apr 2002 A1
20020050946 Chang et al. May 2002 A1
20020072332 Chang et al. Jun 2002 A1
20020072360 Chang et al. Jun 2002 A1
20020072361 Knoblach et al. Jun 2002 A1
20020072374 Chang et al. Jun 2002 A1
20020073437 Chang et al. Jun 2002 A1
20020080732 Feria et al. Jun 2002 A1
20020081969 Chang et al. Jun 2002 A1
20020106041 Chang et al. Aug 2002 A1
20020107034 Chang et al. Aug 2002 A1
20020118654 Chang et al. Aug 2002 A1
20020126042 Chang et al. Sep 2002 A1
20020128044 Chang et al. Sep 2002 A1
20020128045 Chang et al. Sep 2002 A1
20020146058 Feria et al. Oct 2002 A1
20020150067 Feria et al. Oct 2002 A1
20020168991 Kochanski et al. Nov 2002 A1
20030076258 Chang et al. Apr 2003 A1
20030083103 Drawert May 2003 A1
20030231613 Bertrand et al. Dec 2003 A1
20040032883 Knapp et al. Feb 2004 A1
Foreign Referenced Citations (47)
Number Date Country
0 335 558 Apr 1989 EP
0 549 220 Jun 1993 EP
0 682 416 Nov 1995 EP
0 749 252 Dec 1996 EP
0 776 099 May 1997 EP
0 837 568 Apr 1998 EP
0 845 874 Jun 1998 EP
0 860 708 Aug 1998 EP
0 860 709 Aug 1998 EP
0 860 710 Aug 1998 EP
0 860 952 Aug 1998 EP
0 887 951 Dec 1998 EP
1 010 988 Jun 2000 EP
1 037 403 Sep 2000 EP
1 139 583 Oct 2001 EP
1 148 662 Oct 2001 EP
1 152 552 Nov 2001 EP
1 158 698 Nov 2001 EP
1 161 001 Dec 2001 EP
2 271 902 Oct 1993 GB
2 306 827 May 1997 GB
2 349 045 Oct 2000 GB
59-097239 Jun 1984 JP
02-028580 Jan 1990 JP
3-291584 Dec 1991 JP
04-027887 Jan 1992 JP
07-146995 Jun 1995 JP
08-015405 Jan 1996 JP
09-026328 Jan 1997 JP
09-113600 May 1997 JP
10-190391 Apr 1998 JP
20-01345747 Dec 2001 JP
WO 9013186 Nov 1990 WO
WO 9504407 Feb 1995 WO
WO 9622661 Jul 1996 WO
WO 9631016 Oct 1996 WO
WO 9707609 Feb 1997 WO
WO 9851568 Nov 1998 WO
WO 9913598 Mar 1999 WO
WO 9923769 May 1999 WO
WO 0014902 Mar 2000 WO
WO 0191310 Nov 2001 WO
WO 0193458 Dec 2001 WO
WO 0194969 Dec 2001 WO
WO 0195220 Dec 2001 WO
WO 0195522 Dec 2001 WO
WO 0195523 Dec 2001 WO
Related Publications (1)
Number Date Country
20020080732 A1 Jun 2002 US