The present invention relates in general to a system for encoding financial information and in particular to a method and apparatus for encoding machine readable vouchers for use in a cashless casino gaming system.
Casino games, such as slot machines, must have the capacity to hold a large amount of cash. Although on average, a casino game takes in more cash than it dispenses, this average may accrue over a short period of time or over a long period of time. In order to continuously operate over that period of time without undue operator intervention (e.g., a casino employee retrieving excess money too often or paying off medium sized jackpots too often), the casino game must use a large portion of its interior space to store money.
Increased storage space for money and the ability to automatically handle that money increases the cost and the size of the casino game. In addition, as a casino handles more physical money, the overhead costs associated with handling that money increase. The money must be counted, stored, transported, guarded, etc.
As an alternative to physical money, some casinos employ a cashless system. For example, if a patron wins a medium sized jackpot, electronic credits are awarded. If the patron proceeds to lose those credits, the money is not needed. If the patron cashes out the credits, a receipt is printed which contains an account number. The patron may then take the receipt to a house teller to receive his cash.
However, this receipt system has certain drawbacks. First, the casino game must be in communication with a central computer in order to update the account information. In addition, criminals may attempt to produce counterfeit receipts if future account numbers can be determined by past account numbers. Still further, the patron is unable to use his receipt like cash in another casino game. He must first convert the receipt to cash and then proceed to another game.
In one aspect, the invention is directed to a method in a casino gaming system, the casino gaming system comprising a plurality of casino gaming machines operatively coupled to a host computer via a network, wherein each of the plurality of casino gaming machines has associated therewith a respective unique machine identification number. The method comprises determining a sequence number associated with a voucher number to be generated, wherein the sequence number is different from sequence numbers associated with at least some voucher numbers previously generated. The method also comprises combining, using a casino gaming machine, the machine identification number associated with the casino gaming machine with the sequence number to form a combined number. The method additionally comprises performing a cyclic redundancy check (CRC) operation on at least a portion of the combined number, using the casino gaming machine, to generate at least one CRC result, and generating a voucher number based on the at least one CRC result. The method further comprises writing the voucher number generated based on the at least one CRC result to a machine readable medium.
In another aspect, the invention is directed to a casino gaming machine for use in a casino gaming system, the casino gaming system comprising a plurality of casino gaming machines operatively coupled to a host computer via a network, wherein each of the plurality of casino gaming machines has associated therewith a respective unique machine identification number. The casino gaming machine comprises a network interface circuit to operatively link the casino gaming machine to the host computer via the network, and a voucher dispenser. The casino gaming machine additionally comprises a controller operatively coupled to the display unit, the network interface circuit, and the voucher dispenser, the controller comprising a microprocessor and a memory operatively coupled to the microprocessor. The controller is programmed to determine a sequence number associated with a voucher number to be generated, wherein the sequence number is different from sequence numbers associated with at least some voucher numbers previously generated. The controller is also programmed to combine the machine identification number associated with the casino gaming machine with the sequence number to form a combined number. The controller is additionally programmed to perform a cyclic redundancy check (CRC) operation on at least a portion of the combined number to generate at least one CRC result, and to generate a voucher number based on the at least one CRC result. The controller is further programmed to cause the voucher dispenser to write the voucher number generated based on the at least one CRC result to a machine readable medium.
In yet another aspect, the invention is directed to a computer readable medium storing a software program for use in a casino gaming system, the casino gaming system comprising a plurality of casino gaming machines operatively coupled to a host computer via a network, wherein each of the plurality of casino gaming machines has associated therewith a respective unique machine identification number, the software program for generating a voucher number at one of the plurality of casino gaming machines. The computer readable medium comprises first code for determining a sequence number associated with a voucher number to be generated, wherein the sequence number is different from sequence numbers associated with at least some voucher numbers previously generated. The computer readable medium also comprises second code for combining the machine identification number associated with the casino gaming machine that is to generate the voucher number with the sequence number to form a combined number. The computer readable medium additionally comprises third code for performing a cyclic redundancy check (CRC) operation on at least a portion of the combined number to generate at least one CRC result, and fourth code for generating a voucher number based on the at least one CRC result. The computer readable medium further comprises fifth code for writing the voucher number generated based on the at least one CRC result to a machine readable medium.
In still another aspect, the invention is directed to a method in a casino gaming system, the casino gaming system comprising a plurality of casino gaming machines and at least one voucher dispensing machine operatively coupled to a host computer via a network, wherein each of the plurality of casino gaming machines and the at least one voucher dispensing machine has associated therewith a respective unique machine identification number. The method comprises determining a sequence number associated with a voucher number to be generated, wherein the sequence number is different from sequence numbers associated with at least some voucher numbers previously generated, and combining, using a voucher dispensing machine, the machine identification number associated with the casino gaming machine with the sequence number to form a combined number. The method also comprises performing a cyclic redundancy check (CRC) operation on at least a portion of the combined number, using the voucher dispensing machine, to generate at least one CRC result. The method additionally comprises generating a voucher number based on the at least one CRC result using the voucher dispensing machine, and writing the voucher number generated based on the at least one CRC result to a machine readable medium.
In yet another aspect, a voucher dispensing machine for use in a casino gaming system, the casino gaming system comprising a plurality of casino gaming machines and at least one voucher dispensing machine operatively coupled to a host computer via a network, wherein each of the plurality of casino gaming machines and the at least one voucher dispensing machine has associated therewith a respective unique machine identification number, is provided. The voucher dispensing machine comprises a network interface circuit to operatively link the voucher dispensing machine to the host computer via the network, and a voucher dispenser. The voucher dispensing machine additionally comprises a controller operatively coupled to the display unit, the network interface circuit, and the voucher dispenser, the controller comprising a microprocessor and a memory operatively coupled to the microprocessor. The controller is programmed to determine a sequence number associated with a voucher number to be generated, wherein the sequence number is different from sequence numbers associated with at least some voucher numbers previously generated. The controller is also programmed to combine the machine identification number associated with the voucher dispensing machine with the sequence number to form a combined number. The controller is further programmed to perform a cyclic redundancy check (CRC) operation on at least a portion of the combined number to generate at least one CRC result, and to generate a voucher number based on the at least one CRC result. The controller is still further programmed to cause the voucher dispenser to write the voucher number generated based on the at least one CRC result to a machine readable medium.
These and other features and advantages of the present invention will be apparent to those of ordinary skill in the art in view of the detailed description of the preferred embodiments which is made with reference to the drawings, a brief description of which is provided below.
In general, the system and method described herein transmits a unique machine identification number and a sequence number from a local host to a casino game via a network. In the event that the local host is unable to provide the sequence number, the casino game generates the sequence number locally. Subsequently, the casino game performs a series of numerical operations starting with the machine identification number and the sequence number to generate an encoded a voucher number. The voucher is then printed for the patron and the number is reported to the local host.
A block diagram of a casino game network 100 is illustrated in
A plurality of these local game clusters 108 may be connected to a wide area server 110 by a wide area network 112. In this manner, less powerful local host computers may be used without sacrificing nearly unlimited expandability. In addition, game clusters may be located in geographically disparate locations via the wide area network 112. For example, two or more independently operated casinos located in separate physical locations may share a common cashless voucher system, thereby allowing patrons of one casino to use their vouchers in another casino and vice-versa.
A more detailed diagram of casino game 102, is illustrated in
The interface circuit 210 may be implemented using any data transceiver, such as a proprietary fiber optic data transceiver, a Universal Serial Bus (USB) transceiver, etc. One or more input devices 212 are connected to the interface circuit 210 for entering data and commands into the controller 202. For example, the input device 212 may be a pull lever, keyboard, touch screen, mouse, track pad, track ball, isopoint, and/or a voice recognition system.
In addition, a voucher reader 214 is preferably connected to the interface circuit 210 for reading cashless vouchers issued to a patron. The voucher reader 214 may be any type of device that transforms machine readable symbols into digital data. For example, the voucher reader 214 may be a bar code reader, a magnetic card stripe reader, a magnetic disk drive, an optical disk drive, a solid state memory interface, a radio receiver, an infrared receiver, etc. Preferably, the voucher reader 214 reads an encoded number which is then transmitted to the local host 104 by the controller 202 via the local network 106. In response, the local host 104 verifies the number and determines the monetary value associated with the voucher. This value may then be transmitted back to the controller 202 which issues game credits to the patron. Alternatively, the voucher reader 214 reads the encoded number and the controller 202 verifies the number and determines the monetary value associated with the voucher locally. This alternative approach is especially useful when communication to the local host 104 is temporarily disabled.
One or more output devices 216 are also connected to the controller 202 via the interface circuit 210. Examples of output devices 216 include slot machine reels, cathode ray tubes (CRTs), liquid crystal displays (LCDs), lights, and/or speakers. The output devices 216 generate visual displays of data generated during operation of the casino game 102. The visual displays may include prompts for human operator input, run time statistics, calculated values, and/or detected data.
In addition, a voucher dispenser 218 is preferably connected to the interface circuit 210 for dispensing cashless vouchers to a patron. The voucher dispenser 218 may be any type of device that transforms digital data into machine readable symbols. For example, the voucher dispenser 218 may be a bar code printer, a magnetic card stripe writer, a magnetic disk drive, an optical disk drive, a solid state memory interface, a radio transmitter, an infrared transmitter, etc. Preferably, the voucher dispenser 218 encodes a number onto a voucher which may be easily carried by a patron to another casino game 102. This voucher number is indicative of a monetary value owed by the casino to the patron.
Preferably, the voucher number is determined by the controller 202 based on a unique machine identification number associated with the casino game 102 and a sequence number provided by the local host 104 over the local network 106. The machine identification number may be embedded into the casino game 102 when manufactured, programmed into the casino game memory 208 during a game setup operation, and/or transmitted to the casino game 102 from the local host 104. Preferably, the sequence number is updated by the local host 104 after each voucher is issued. Alternatively, the sequence number may be determined locally by the controller 202 based on the most recently used sequence number. This alternative approach is especially useful when communication to the local host 104 is temporarily disabled.
The casino game 102 exchanges data with other computing devices, including the local host 104, via a connection to the local network 106. The connection may be any type of network connection, such as an Ethernet connection. The local network 106 may be any type of network, such as an intranet or the Internet.
A more detailed diagram of a local host 104, is illustrated in FIG. 3. At a high level, a local host 104 is similar to a casino game 102. However, a local host 104 need not include the specialized input/output devices of the casino game 102. Similar to the casino game 102, the local host 104 preferably includes a controller 302 with a central processing unit 304 electrically coupled by an address/data bus 306 to a memory device 308 and an interface circuit 310. The CPU 304 may be any type of well known CPU, such as an Intel i960 Intel Pentium™ processor. The memory device 308 preferably includes volatile memory, such as a random-access memory (RAM), and non-volatile memory, such as a read only memory (ROM) and/or a magnetic disk. The memory device 308 stores a software program that implements all or part of the method described below. This program is executed by the CPU 304, as is well known. Some of the steps described in the method below may be performed manually or without the use of the local host 104.
The interface circuit 210 may be implemented using any data transceiver. Optionally, the local host 104 may include standard input and output devices such as keyboards and displays. In addition to the memory 308 (or included in the memory 308), the local host 104 preferably includes a storage device 314 for storing digital data associated with the cashless voucher operation described in detail below.
The local host 104 may also exchange data with other computing devices via a connection to the local network 106 and the wide area network 112. The connection(s) may be any type of network connection, such as an Ethernet connection. The local network 106 and the wide area network 112 may be separate networks. For example, the local network 106 may be based on a first communication protocol, and the signals associated with the local network 106 may travel over a first set of wires; while the wide area network 112 is based on a second communication protocol, and the signals associated with the wide area network 112 travel over a second set of wires. Alternatively, the local network 106 and the wide area network 112 may share a common protocol (e.g., TCP/IP), but have their own physical wires. For example, the local network 106 may be an intranet and the wide area network 112 may be the Internet. In yet another alternative, the local network 106 and the wide area network 112 may be the same network (e.g., the Internet).
A more detailed diagram of the wide area server 110, is illustrated in FIG. 4. The wide area server 110 is preferably a more powerful version of the local host 104 running different software adapted to coordinate the efforts of all the local hosts 104. The wide area server 110 also includes a controller 402 with a central processing unit 404 electrically coupled by an address/data bus 406 to a memory device 408 and an interface circuit 410. The CPU 404 may be any type of well known CPU, such as an Intel Pentium™ processor. The memory device 408 preferably includes volatile memory, such as a random-access memory (RAM), and non-volatile memory, such as a read only memory (ROM) and/or a magnetic disk. The memory device 408 stores a software program that implements all or part of the method described below. This program is executed by the CPU 404, as is well known. Some of the steps described in the method below may be performed manually or without the use of the wide area server 110.
The interface circuit 410 may be implemented using any data transceiver. Optionally, the wide area server 110 may include standard input and output devices such as keyboards and displays. In addition to the memory 408 (or included in the memory 408), the wide area server 110 preferably includes a storage device 414 for storing digital data associated with the cashless voucher operation described in detail below.
The wide area server 110 may also exchange data with other computing devices via a connection to the wide area network 112. The connection may be any type of network connection, such as an Ethernet connection. As described above, the wide area network 112 may be any type of network, such as an intranet or the Internet.
An example of a cashless casino voucher 500 is illustrated in FIG. 5. In this example, the voucher 500 includes a machine readable bar code symbol 502. The bar code 502 represents an encoded voucher number. A human readable version 504 of the voucher number may also be included on the voucher 500. In the event that the bar code cannot be read, a human operator may type the number into a machine for redemption. Optionally, the value 506 of the voucher 500 is also included in human readable form. In this manner, the patron need not remember how much “cash” they have. The entire voucher 500 may be produced by a standard printing device such as a thermal printer or an ink jet printer. Preferably, proprietary stock is used in place of standard paper.
A flowchart of a process 600 for encoding vouchers 500 in a cashless casino gaming system is illustrated in FIG. 6. Preferably, the process 600 is embodied in a software program which is stored in the casino game 102 memory 208 and executed by the casino game CPU 204 in a well known manner. However, some or all of the steps of the process 600 may be performed by another device such as the local host CPU 304 and/or the wide area server CPU 404. Further, one or more of the steps of the process 600 described below may be performed manually without the use of a CPU.
Generally, the process 600 receives a unique machine identification number and a sequence number from a local host 104. In the event that the local host 104 is unable to provide a sequence number, the process 600 generates a sequence number locally. Subsequently, the process 600 performs a series of numerical operations using the machine identification number and the sequence number to encode the voucher number. The voucher 500 is then printed for the patron and the number is reported to the local host 104.
The process 600 begins by receiving a unique machine identification number from the local host 104 via the local network 106 (step 602). Alternatively, the process 600 may retrieve the unique machine identification number locally, if the unique machine identification number is embedded into the casino game 102 when manufactured or programmed into the casino game memory 208 during a game setup operation.
Preferably, the sequence number is updated by the local host 104 after each voucher 500 is issued. Accordingly, the process 600 determines if the casino game 102 has received a sequence number from the local host 104 (step 604). If the casino game 102 has not received a sequence number from the local host 104, the sequence number may be generated locally by the controller 202 based on the most recently used sequence number (step 606). For example, the most recently used sequence number may be incremented by a predetermined amount to generate the next sequence number.
In a preferred embodiment, the casino game 102 receives a finite list of sequence numbers from the local host 104 after each voucher 500 is issued. As long as the casino game 102 and the local host 104 remain in communication, only the first sequence number in the list is used to generate a voucher number. However, if communication between the casino game 102 and the local host 104 is temporarily disabled, the process 600 uses subsequent sequence numbers on the list until communication is restored or the list is exhausted. In this manner, the next sequence number is still based on the previous sequence number (i.e., each number is only used once), but the next sequence number is not a simple increment of the most recently used sequence number. As a result, the encoding algorithm is more difficult to determine by simple inspection of issued voucher numbers, and fewer unauthorized vouchers 500 are issued.
Regardless of how the unique machine identification number and the sequence number are determined, the process 600 reversibly combines the unique machine identification number and the sequence number (step 608). Preferably, predetermined bits of the unique machine identification number are combined with predetermined bits of the sequence number using an exclusive- or (XOR) operation as described in detail with reference to
Subsequently, the process 600 preferably performs a series of two byte cyclic redundancy check (CRC) operations (step 610). For example, given a six byte combination from step 608, the process 600 may take the first two bytes and perform a CRC with base zero, resulting in another two byte number. Similarly, the middle two bytes from step 608 may be processed in this manner, as well as the last two bytes from step 608 as described in detail with reference to
Next, the CRC results are preferably converted from binary to binary coded decimal (BCD) in a well known manner (step 612), and a checksum, based on the BCD conversion result is preferably appended to the number as described in detail below with reference to
Once the voucher number based on the unique machine identification number and the sequence number has been determined, the process 600 may print the voucher 500 for the patron (step 616). Of course, if a non-paper medium is used for the voucher 500, other means are used to “print” the voucher 500. For example, a magnetic media is written and a radio signal is transmitted.
The process 600 also transmits the voucher number and the value 506 of the voucher 500 to the local host 104 via the local network 106 if possible (step 618). If communication to the local host 104 is temporarily disabled, the process 600 preferably waits until communication is restored to report all of the voucher numbers that were issued since the last communication to the local host 104. Alternatively, the process 600 may just report the most recent voucher number issued, and the local host 104 may determine the complete list of voucher numbers issued by reversing the encoding (as described below with reference to
A flowchart of a process 700 for decoding vouchers 500 in a cashless casino gaming system is illustrated in FIG. 7. Preferably, the process 700 is embodied in a software program which is stored in the casino game 102 memory 208 and executed by the casino game CPU 204 in a well known manner. However, some or all of the steps of the process 700 may be performed by another device such as the local host CPU 304 and/or the wide area server CPU 404. Further, one or more of the steps of the process 700 described below may be performed manually without the use of a CPU.
Generally, the process 700 receives a voucher number by reading an encoded voucher 500. Preferably, the voucher number is sent to a local host 104 for confirmation. However, in the event that the casino game 102 is unable to communicate with the local host 104, the process 700 performs a series of numerical operations on the voucher number to determine the machine identification number and the sequence number encoded on the voucher 500. If the process 700 receives a confirmation message form the local host 104, or the process 700 determines locally that the voucher 500 is valid, the process 700 issues the appropriate number of game credits to the patron. The number of game credits may be determined by reading a number encoded on the voucher 500 and/or by receiving a message from the local host 104.
The process 700 begins by receiving an encoded voucher 500 (step 702). In a preferred embodiment, the process 700 receives the encoded voucher 500 by scanning a bar code symbol 502 printed on the voucher 500 in a well known manner. However, a person of ordinary skill in the art will readily appreciate that any method of transforming machine readable symbols into digital data may be used. For example, the voucher reader 214 may be a bar code reader, a magnetic card stripe reader, a magnetic disk drive, an optical disk drive, a solid state memory interface, a radio receiver, an infrared receiver, etc. In many instances, the digital data obtained from the voucher reader 214 may require further processing before the voucher number is represented in a typical binary format. For example, in the case of a bar code, the digital data indicative of the bars is converted to a binary number based on a particular bar code standard (step 704). Similarly, other well known standards of decoding may be used in the case of a magnetic card stripe reader, a magnetic disk drive, an optical disk drive, a solid state memory interface, a radio receiver, an infrared receiver, etc.
Subsequently, the process 700 preferably transmits the voucher number to the local host 104 for confirmation (step 706). The local host 104 may check the voucher number against a list of known good voucher numbers previously received from this casino game 102 as well as other casino games 102. Alternatively, or in addition, the local host 104 may perform a series of numerical operations on the voucher number to determine the machine identification number and the sequence number associated with the voucher number. The machine identification number and the sequence number may then be verified against a list of valid machine identification numbers and sequence numbers.
If the process 700 does not receive a confirmation message form the local host 104 within a predetermined time period (step 708), the process 700 performs a series of numerical operations on the voucher number to determine the machine identification number and the sequence number associated with the voucher number (steps 710-716). In the preferred embodiment, the first step in this process is removing and verifying the checksum (710). The checksum may be verified by performing the checksum operation described in detail below and obtaining a result of zero for a correct checksum. In this embodiment, the checksum may then be removed by replacing two nibbles holding the checksum with a value of zero.
If the checksum is correct, the process 700 converts the number (with the checksum removed) from binary coded decimal (BCD) to binary in a well known manner (step 712). The results of the conversion are then processed to reverse the two byte CRC operations (step 714). It is known from the theory of polynomials that applying 2-byte CRC polynomials over any two different 2-byte values amounts to two different CRC results. This observation provides the grounds for reversing the CRC applied over 2-byte values. The reversing can be done in different ways depending, for example, on how the implementation for the direct CRC is done. In the preferred embodiment, a table-based algorithm for implementing the direct CRC calculation is used for real-time efficiency. Using the same table and a reverse algorithm allows the process 700 to obtain the direct data given the calculated CRC over it.
Once the CRC is reversed, the process 700 preferably reverses the combination process in a well know manner (step 716). For example, if the machine identification number and the sequence number are combined in an exclusive- or (XOR) operation as described in detail below, the process may be reversed because one of the inputs to the XOR is known, and the output of the XOR is known. Similarly, if bits have been swapped or shifted one way in a predetermined manner, the bits may be swapped or shifted back in an opposite manner. Subsequently, the machine identification number and the sequence number may be parsed (step 718). In the preferred embodiment, the machine identification number and the sequence number are concatenated, therefore, the parsing step is performed by splitting the concatenated number at the midpoint.
Once the machine identification number and the sequence number are determined from the voucher number, the process 700 may determine if the machine identification number and the sequence number are valid by checking the numbers against a predetermined list of valid numbers (step 720). If the machine identification number or the sequence number is invalid, the process 700 generates an error message (step 722). The error message may be reported to the patron via the casino game display 216, and the error message may be reported to the local host 104 via the local network 106. If the machine identification number and the sequence number are valid, regardless of whether this determination is made locally by the casino game 102 or reported to the casino game 102 by the local host 104, the process 700 issues the appropriate number of game credits (step 724). The appropriate number of game credits may be determined by reading a number encoded on the voucher 500 and/or by receiving a message from the local host 104.
An example of converting a machine identification number and a sequence number into a cashless casino voucher number is illustrated in FIG. 8. In this example, a three byte machine identification number and a three byte sequence number 802 are used. The machine identification number and the sequence number are combined using an exclusive- or (XOR) operation 804. Specifically, byte-2 of the machine identification number is XORed with byte-1 of the sequence number to produce byte-5 of the XOR result 806 (i.e., 01000001 XOR 00000000=01000001). Similarly, byte-1 of the machine identification number is XORed with byte-0 of the sequence number to produce byte-4 of the XOR result 806 (i.e., 00101011 XOR 00000001=00101010). Byte-0 of the machine identification number is XORed with byte-1 of the sequence number to produce byte-3 of the XOR result 806. Byte-2 of the sequence number is XORed with byte-0 of the sequence number to produce byte-2 of the XOR result 806. Byte-1 of the sequence number is used as byte-1 of the XOR result 806, and byte-0 of the sequence number is used as byte-0 of the XOR result 806.
A cyclic redundancy check 808 (CRC) is then performed on the XOR result 806 to produce a CRC result 810 in a well known manner. Preferably, the CRC function is performed on the XOR result 806 two bytes at a time. A binary to binary coded decimal (BCD) conversion 812 is then performed on the CRC result 810 to produce a BCD result 814 in a well known manner. For example, 100011011100111001011110 binary is equal to 9293406 decimal which would be stored as 0000 1001 0010 1001 0011 0100 0000 0110). In this example, the checksum 816 is appended to the BCD result 814 to produce the voucher number 818 by summing the individual BCD results 814, performing a modulus-5 operation, and doubling the result for storage in the unused upper nibble of the BCD result 814. For example, ((0+9+2+9+3+4+0+6) mod 5)*2=6.
In summary, persons of ordinary skill in the art will readily appreciate that a method and apparatus of encoding machine readable vouchers for use in a cashless casino gaming system has been provided.
The foregoing description has been presented for the purposes of illustration and description. It 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 above teachings. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.
This application is a continuation of, and claims priority to, U.S. patent application Ser. No. 09/652,163, filed Aug. 31, 2000 now abandoned, entitled “METHOD AND APPARATUS FOR ENCODING VOUCHERS IN A CASINO GAMING SYSTEM,” which is herein incorporated by reference in its entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
3825905 | Allen, Jr. | Jul 1974 | A |
3838264 | Maker | Sep 1974 | A |
4200770 | Hellman et al. | Apr 1980 | A |
4218582 | Hellman et al. | Aug 1980 | A |
4354251 | Hellwig et al. | Oct 1982 | A |
4405829 | Rivest et al. | Sep 1983 | A |
4467424 | Hedges et al. | Aug 1984 | A |
4727544 | Brunner et al. | Feb 1988 | A |
4752068 | Endo | Jun 1988 | A |
4759064 | Chaum | Jul 1988 | A |
4837728 | Barrie et al. | Jun 1989 | A |
4845715 | Francisco | Jul 1989 | A |
4848744 | Steininger et al. | Jul 1989 | A |
4856787 | Itkis | Aug 1989 | A |
4865321 | Nakagawa et al. | Sep 1989 | A |
4930073 | Cina, Jr. | May 1990 | A |
4951149 | Faroudja | Aug 1990 | A |
5004232 | Wong et al. | Apr 1991 | A |
5021772 | King et al. | Jun 1991 | A |
5235642 | Wobber et al. | Aug 1993 | A |
5259613 | Marnell, II | Nov 1993 | A |
5265874 | Dickinson et al. | Nov 1993 | A |
5283734 | Von Kohorn | Feb 1994 | A |
5288978 | Iijima | Feb 1994 | A |
5290033 | Bittner et al. | Mar 1994 | A |
5291585 | Sato et al. | Mar 1994 | A |
5326104 | Pease et al. | Jul 1994 | A |
5342047 | Heidel et al. | Aug 1994 | A |
5343527 | Moore | Aug 1994 | A |
5465364 | Lathrop et al. | Nov 1995 | A |
5488702 | Byers et al. | Jan 1996 | A |
5489095 | Goudard et al. | Feb 1996 | A |
5586766 | Forte et al. | Dec 1996 | A |
5604801 | Dolan et al. | Feb 1997 | A |
5643086 | Alcorn et al. | Jul 1997 | A |
5644704 | Pease et al. | Jul 1997 | A |
5655965 | Takemoto et al. | Aug 1997 | A |
5704835 | Dietz, II | Jan 1998 | A |
5725428 | Achmüller | Mar 1998 | A |
5737418 | Saffari et al. | Apr 1998 | A |
5800264 | Pascal et al. | Sep 1998 | A |
5934672 | Sines et al. | Aug 1999 | A |
6048269 | Burns et al. | Apr 2000 | A |
6071190 | Weiss et al. | Jun 2000 | A |
6104815 | Alcorn et al. | Aug 2000 | A |
6106396 | Alcorn et al. | Aug 2000 | A |
6116402 | Beach et al. | Sep 2000 | A |
6280326 | Saunders et al. | Aug 2001 | B1 |
6280328 | Holch et al. | Aug 2001 | B1 |
6340331 | Saunders et al. | Jan 2002 | B1 |
6500067 | Luciano et al. | Dec 2002 | B1 |
6652380 | Luciano | Nov 2003 | B1 |
6679775 | Luciano et al. | Jan 2004 | B1 |
6682421 | Rowe et al. | Jan 2004 | B1 |
20020049909 | Jackson et al. | Apr 2002 | A1 |
Number | Date | Country |
---|---|---|
WO 0122267 | Sep 1999 | WO |
Number | Date | Country | |
---|---|---|---|
20030166412 A1 | Sep 2003 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09652163 | Aug 2000 | US |
Child | 10352435 | US |