Variable key press resynchronization for remote keyless entry systems

• US 5,923,758 A
• Filed: 01/30/1997
• Issued: 07/13/1999
• Est. Priority Date: 01/30/1997
• Status: Expired due to Term

• Current Assignee: Delphi Technologies, Inc. (BorgWarner Incorporated)
• Original Assignee: Delco Electronics Corporation (Motors Liquidation Co. GUC Trust)
• Inventors: Khamharn, Oddy N, Kell, Curtis Norman
• Primary Examiner(s): Gregory, Bernarr E.
• Application Number:
  US08/794,224
• Time in Patent Office: 894 Days
• Field of Search: 380/23, 380/25, 380/49, 380/50, 380/54, 380/59, 380/48, 340/825.31, 340/825.34, 375/354, 375/356, 375/358, 375/359
• US Class Current: 380/262
• CPC Class Codes: G07C 2009/00253 dynamically, e.g. variable code - rolling code
• CPC Class Codes: G07C 2009/00793 by Hertzian waves
• CPC Class Codes: G07C 2209/06 Involving synchronization or resynchronization between transmitter and receiver; reordering of codes
• CPC Class Codes: G07C 9/00182 operated with unidirectional data transmission between data carrier and locks

Abstract

The present invention provides, in a preferred embodiment, a method whereby resynchronization between a transmitter and receiver is activated intuitively by, and transparently to, an authorized user, including: transmitting at least a first message from the transmitter to the receiver; and, in response to the receiver receiving the first message, the receiver detecting the absence of synchronization between the transmitter and the receiver and performing a resynchronization procedure to restore synchronization between the transmitter and the receiver.

Claims

1. A method for restoring synchronization between a transmitter and a receiver comprising:

(a) transmitting at least a first message from said transmitter to said receiver, said message including a first function code, said first function code comprising a binary value derived from a button depression of said transmitter; and

(b) in response to said receiver receiving said at least said first message, said receiver detecting the absence of synchronization between said transmitter and said receiver and performing a resynchronization procedure to restore synchronization between said transmitter and said receiver.

2. A method, as defined in claim 1, whereby:

said first message also comprises message elements including a preamble, a transmitter ID, a first sequence number, an authenticator code, and a CRC code.

3. A method, as defined in claim 2, whereby:

said transmitter ID is a unique binary value common for said transmitter and said receiver.

4. A method, as defined in claim 2, whereby:

said first sequence number is a 16 bit binary which is incremented for each said first message by a program algorithm.

5. A method, as defined in claim 2, whereby:

said authenticator code is a binary value algorithmically derived based on a cryptographic key contained within said transmitter and said receiver.

6. A method, as defined in claim 2, whereby:

said CRC is a binary value algorithmically calculated from said binary values of other said elements of said first message.

7. A method, as defined in claim 1, whereby:

said receiving said first message includes parsing said first message into message elements.

8. A method, as defined in claim 7, whereby:

selected said message elements are stored in said receiver as synchronizing parameters which include a second sequence number, a second function code, a message count value, a message number value, a sequence number history memory, and first, second, and third message verification values.

9. A method, as defined in claim 1, whereby:

said resynchronization procedure includes validating said transmitter ID, determining one of first, second, third, or fourth resynchronization levels, and establishing one of first, second, third, or fourth resynchronization processes.

10. A method, as defined in claim 9, whereby:

said transmitter ID is compared with said second transmitter ID such that a comparison match permits continued processing of said first message.

11. A method, as defined in claim 9, whereby:

establishing said first resynchronization process results from comparing said first sequence number with said second sequence number stored in said receiver and determining that a relationship exists according to the following equation;

space="preserve" listing-type="equation">SQN2<

SQN1<

=SQN2+K

where;

SQN1 is said first sequence number,

SQN2 is said second sequence number, and

K is a binary constant.

12. A method, as defined in claim 11, whereby:

said first resynchronization process comprises;

(a) storing said first sequence number into memory location of said second sequence number, checking for valid said authenticator whereby if valid go to step

(b), otherwise if not valid, store said first sequence number and said authenticator value in said verification memory indexed by said count value, increment said count value by 1, check if said count value is greater or equal to 3 and if so authenticate all said verification memory values, performing said function, setting sand count value equal 1, setting said second sequence number value equal to said first sequence number value and await a subsequent message;

(c) comparing said first function code with said stored second function code, whereby if not equal store said first function code value into said second function code memory location, then set said stored count value equal 1;

otherwise if comparison is equal, check for said first sequence number greater by 1 than said stored second sequence number whereby increment said count value by 1, otherwise set said count value equal 1; and

(d) checking if said count value is greater or equal to three, whereby store said first sequence number into said sequence number history FIFO memory, then set said second sequence number memory location equal to said first sequence number value and await a subsequent message, otherwise set said second sequence number memory location equal to said first sequence number value and await a subsequent message.

13. A method, as defined in claim 9, whereby establishing said second resynchronization process results from comparing said first sequence number with said second sequence number stored in said receiver and determining that a relationship exists according to the following equation:

space="preserve" listing-type="equation">16>

=SQN1, SQN2

where;

SQN1 is said first sequence number, and

SQN2 is said second sequence number.

14. A method, as defined in claim 13, whereby:

said second resynchronization process comprises said first sequence number into memory location of said second sequence number, authenticating said first message, storing said first sequence number into said sequence number history memory, and awaiting a subsequent message.

15. A method, as defined in claim 9, whereby:

establishing said third resynchronization process results from comparing said first sequence number with said second sequence number stored in said receiver and determining that a relationship exists according to the following equation;

space="preserve" listing-type="equation">SQN1>

SQN2+K

where;

SQN1 is said first sequence number,

SQN2 is said second sequence number, and

K is a binary value constant.

16. A method, as described in claim 15, whereby:

said third resynchronization process comprises;

(a) setting number of message cycles value equal 2 to be received for said resynchronization process to be complete;

(b) comparing said first function code with said stored second function code, whereby if not equal store said first function code value into said second function code memory location, then set said stored count value equal 1;

otherwise if comparison is equal, check for said first sequence number greater by 1 than said stored second sequence number whereby increment said count value by 1, otherwise set said count value equal 1;

(c) comparing said stored count value with said message cycle value whereby if not equal store said first sequence number and said authenticator value in said verification memory indexed by said count value, otherwise if equal, compare said first sequence number with values stored in said sequence number history FIFO for match with previously stored said first sequence number values and if no match then authenticate all said verification memory values, perform said function, set said count value equal 1, set said second sequence number memory location equal to said first sequence number value, and await a subsequent message, whereas if match between said first sequence number value with values stored in said sequence number history FIFO, then set said second sequence number memory location equal co said first sequence number value and await next said message; and

(d) repeating steps (a) through (c) until said receiver is resychronized with said transmitter.

17. A method, as defined in claim 9, whereby:

establishing said fourth resynchronization process results from comparing said first sequence number with said second sequence number stored in said receiver and determining that a relationship exists according to the following equation;

space="preserve" listing-type="equation">16<

SQN1<

SQN2

where;

SQN1 is said first sequence number, and

SQN2 is said second sequence number.

18. A method, as defined in claim 17, whereby:

said fourth resynchronization process comprises;

(a) setting number of message cycles value equal 3 to be received for said resynchronization process to be complete;

(b) comparing said first function code with said stored second function code, whereby if not equal store said first function code value into said second function code memory location, then set said stored count value equal 1;

otherwise if comparison is equal, check for said first sequence number greater by 1 than said stored second sequence number whereby increment said count value by 1, otherwise set said count value equal 1;

(c) comparing said stored count value with said message cycle value whereby if not equal store said first sequence number and said authenticator value in said verification memory indexed by said count value, otherwise if equal, compare said first sequence number with values stored in said sequence number history FIFO for match with previously stored said first sequence number values and if no match then authenticate all said verification memory values, perform said function, set said count value equal 1, set said second sequence number memory location equal to said first sequence number value, and await next said message, whereas it match between said first sequence number value with value stored in said sequence number history FIFO, then set said second sequence number memory location equal to said first sequence number value and await a subsequent message; and

(d) repeating steps (a) through (c) until said receiver is resynchronized with said transmitter.