This application relates to the provision of a transmission identification code to a remote entry transmitter wherein the code is assigned in a fashion such that it will always be unique, and such that the transmission identification codes for any two consecutive transmitters will not be consecutive binary numbers.
Remote entry transmitters are utilized in most modem vehicles. In a remote entry transmitter a signal is sent from a small signaling device, typically known as a keyfob, to the vehicle. The vehicle receives the signal and controls components on the vehicle based on the signal. As an example, remote entry transmitters are typically utilized to lock and unlock the doors on the vehicle.
When the signal is initially sent from the transmitter to the vehicle, the vehicle checks the signal to determine whether the transmitter is an appropriate transmitter for the vehicle. Transmitters typically have a unique code which is distinct from other transmitters. In this way, the control on the vehicle can identify whether the particular transmitter sending the particular signal is a transmitter which has been programmed for the vehicle. Typically the programming occurs at the factory, when the vehicle is initially assembled and associated with a particular transmitter. Under some circumstances a transmitter may be programmed to a vehicle later, such as when a keyfob has been lost, etc.
Some vehicle manufacturers have a goal of ensuring that no two transmitter identification codes will be identical. This has a resulted in a requirement for storing all of the previously used codes such that it can be ensured that no future identical code is utilized.
It would be desirable to provide a simplified way of assigning transmission identification codes to remote entry transmitters that eliminate the need to store all prior codes.
In a disclosed embodiment of this invention, a transmitter identification code is provided in a fashion such that the codes are non-consecutive for two sequentially assigned codes, but is still based upon some information with regard to the time the code is assigned to the transmitter. In this fashion, it is no longer necessary to remember used codes, as each future assigned code will be ensured to be unique.
In a first embodiment, the code is assigned by incorporating information with regard to the manufacture time. The code thus has sections based upon the date and time at a minimum. Other ways of increasing the number of the available codes including the assigning of a plant code, an assembly line code, and additional random numbers, etc. can be utilized. In this fashion, there is no need to keep a database of previously used transmitter identification codes, since the date/time will never repeat. If the time is taken to include seconds, and also includes the date, there is a very high likelihood that no two codes will be the same. The use of additional plant and line codes will ensure there will be no repeating codes in the event that a particular time is the exact time assigned at two distinct assembly lines for two distinct transmitters.
As to what is meant by this application by the “time” the code is assigned, it should be understood that this time could be associated with when the code is first identified, first developed, or any other method. What is important is that the code is identified utilizing some time associated with some event. In this way, the unique code as described above will be achieved.
In a second embodiment, each receiver is assigned to a sequentially increasing digital number. That assigned number is then modified in some fashion such that it will no longer be sequential. In one proposed embodiment, the initial counter number can be modified by an EXCLUSIVE OR logic process with some standard bit pattern. As an example, if a bit pattern of repeating ones and zeros were subject to an EXCLUSIVE OR process with an initial counter, the final resulting number would be unique for the receiver, and non-sequential.
This embodiment provides the further function of utilizing all available codes with a minimal number of bits.
These and other features of the present invention can be best understood from the following specification and drawings, the following of which is a brief description.
In a first embodiment of this invention, the transmitter identification code is shown to include at least four types of information 24, 26, 28 and 29. The boxes of information 24, 26, 28 and 29 are shown as a series of digital bits. The bits are simply exemplary, and do not reflect the actual bits which may be utilized with this invention, either as to the number of bits, or the fact of whether a particular bit is a one or a zero.
However, in this embodiment, at least one of the sections 24 would preferably relate to the date of manufacture, another 26 would relate to the time, another 28 would relate to either the plant, or assembly line, or both, or neither could be a random number. The use of a random number for each assembly line may eliminate the need for having a particular code identifier for assembly line or plant. As mentioned above, if transmitters are being manufactured on parallel assembly lines, there is the possibility of an identical code based solely on date and time, and thus some use of another number may be preferred.
Now, as shown in
The use of a transmission identification code which incorporates date and time to which the code is initially assigned ensures that the codes will all be unique. The exact date and time will not repeat, and thus the use of this method ensures that each future-assigned transmission identification code will be distinct from all previously assigned codes.
Since the codes will always be distinct, there is no need to store previously used codes. Instead, the invention will self-ensure that no two codes are identical.
In a preferred embodiment the
Since the code is provided by initially assigning a counter number in a sequential fashion, and then modifying that sequentially assigned counter number with some other operation to ensure the final code is non-sequential, and always unique. Setting the counter in a sequential manner will ensure that all codes are distinct, however, and thus the main goal of this invention will still be achieved. This embodiment provides the additional benefit of utilizing all available codes for a given number of bits, which may not ever be achieved by the date and time assigning method.
Although preferred embodiments of this invention have been disclosed, a worker in this art would recognize that certain modifications would come within the scope of this invention. For that reason the following claims should be studied to determine the true scope and content of this invention.
This application claims priority to U.S. Provisional Application No. 60/227,540 filed on Aug. 24, 2000.
Number | Name | Date | Kind |
---|---|---|---|
4525805 | Prosan et al. | Jun 1985 | A |
4683540 | Kurosu et al. | Jul 1987 | A |
4881148 | Lambropoulos et al. | Nov 1989 | A |
5144667 | Pogue et al. | Sep 1992 | A |
5363448 | Koopman et al. | Nov 1994 | A |
5412379 | Waraksa et al. | May 1995 | A |
5477041 | Miron et al. | Dec 1995 | A |
5625349 | Disbrow et al. | Apr 1997 | A |
5675622 | Hewitt et al. | Oct 1997 | A |
5767784 | Khamharn | Jun 1998 | A |
6380843 | Guerin et al. | Apr 2002 | B1 |
Number | Date | Country |
---|---|---|
196 33 802 | Feb 1998 | DE |
198 41 514 | Apr 1999 | DE |
0 663 650 | Dec 1994 | EP |
2 257 552 | Jan 1993 | GB |
Number | Date | Country | |
---|---|---|---|
20020024417 A1 | Feb 2002 | US |
Number | Date | Country | |
---|---|---|---|
60227540 | Aug 2000 | US |