Method and apparatus to facilitate message transmission and reception using different transmission characteristics

Information

  • Patent Grant
  • 10862924
  • Patent Number
    10,862,924
  • Date Filed
    Monday, September 28, 2015
    9 years ago
  • Date Issued
    Tuesday, December 8, 2020
    4 years ago
Abstract
Upon providing (101) message content (such as a remote control instruction) to be transmitted, and in conjunction with provision (102) of a plurality of different transmission characteristics (as correspond, for example, to different types of transmission) and a corresponding plurality of correlated recovery identifiers (103), a particular transmission characteristic is selected (104) and used to transmit (105) a joint message. In particular, in a preferred approach, the selected transmission characteristic (106) is used when transmitting at least a portion of the message content portion of the joint message while another part of the joint message carries the recovery identifier to thereby facilitate selection of an appropriate reception technique by a receiver when receiving the joint message.
Description
TECHNICAL FIELD

This invention relates generally to message transmission and reception techniques and more particularly to the relatively secure conveyance of message contents.


BACKGROUND

Various means of conveying messages are known in the art. In many cases an interest exists in preserving or otherwise maintaining at least some degree of security with respect to conveyance of the message. For example, in some cases it may be desired to prevent an eavesdropping party from gleaning the substantive content of the message. In other cases, as when the message comprises, at least in part, an instruction, command, or similar content it may be desirable to prevent an unauthorized party from effectively transmitting an unauthorized message in order to prevent instigation of unauthorized action by the receiving entity.


For example, movable barrier operators (such as but not limited to garage door openers) often respond to receipt of a wireless remote control signal. In particular, the movable barrier operator will often move a corresponding movable barrier between closed and opened positions in response to such remote control signals. In such a case it often behooves the system operator to seek to ensure that the movable barrier operator will not respond to a remote control signal when transmitted from an unauthorized transmission source.


In some cases the movable barrier operator expects to see a unique identifier or other code in conjunction with, or in lieu of, a specific remote control command. This approach provides at least some degree of security though a more sophisticated unauthorized party may be able to themselves receive such a transmission and co-opt the identifier/code for their own future unauthorized use. With this in mind, so-called rolling codes are often employed to frustrate this approach to breaching the security of such a system. With rolling codes, the code itself changes on a frequent basis pursuant to a plan (such as an implementing algorithm) known to both the transmitter and the receiver. Without knowledge of the underlying scheme by which a next code is selected, an unauthorized party who gains access to a presently used code or identifier will still remain unable to leverage that knowledge in support of effecting unauthorized control over the receiver.


There may be instances, however, when additional security may be desired or appropriate. For example, a given rolling code instantiation may be open to brute force attacks or other weaknesses due to local and/or otherwise unique circumstances.





BRIEF DESCRIPTION OF THE DRAWINGS

The above needs are at least partially met through provision of the method and apparatus to facilitate message transmission and reception using different transmission characteristics described in the following detailed description, particularly when studied in conjunction with the drawings, wherein:



FIG. 1 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 2 comprises a schematic view of a data format as configured in accordance with various embodiments of the invention;



FIG. 3 comprises a schematic view of a data format as configured in accordance with various embodiments of the invention;



FIG. 4 comprises a schematic view of a data format as configured in accordance with various embodiments of the invention;



FIG. 5 comprises a schematic view of a data format as configured in accordance with various embodiments of the invention;



FIG. 6 comprises a flow diagram as configured in accordance with various embodiments of the invention;



FIG. 7 comprises a call flow diagram as configured in accordance with various embodiments of the invention;



FIG. 8 comprises a block diagram as configured in accordance with various embodiments of the invention; and



FIG. 9 comprises a block diagram as configured in accordance with various embodiments of the invention.





Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions and/or relative positioning of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments of the present invention. Also, common but well-understood elements that are useful or necessary in a commercially feasible embodiment are often not depicted in order to facilitate a less obstructed view of these various embodiments of the present invention. It will further be appreciated that certain actions and/or steps may be described or depicted in a particular order of occurrence while those skilled in the art will understand that such specificity with respect to sequence is not actually required. It will also be understood that the terms and expressions used herein have the ordinary meaning as is accorded to such terms and expressions with respect to their corresponding respective areas of inquiry and study except where specific meanings have otherwise been set forth herein.


DETAILED DESCRIPTION

Generally speaking, pursuant to these various embodiments, one provides a plurality of different transmission characteristics as each corresponds, for example, to various selectable types of transmission techniques or means. When message content exists to be transmitted (such as, but not limited to, a remote control signal) a particular one of the transmission characteristics is selected and a corresponding recovery identifier that correlates to the selected transmission characteristic is selected as well. One then transmits a joint message comprising both the message content as is transmitted using the selected transmission characteristic and the recovery identifier as uniquely corresponds to the selected transmission characteristic.


Upon reception of the recovery identifier, and pursuant to a preferred approach, a particular way of receiving the transmission of the message content portion of the joint message is selected as a function thereof and then used to facilitate reception of that message content portion.


The joint message can assume any of a wide variety of forms. For example, depending upon needs and/or requirements, the joint message can comprise a single contiguous message or can comprise a plurality of discrete transmissions. The recovery identifier and the message content can be discrete with respect to one another or can, if desired, be at least partially integrated with one another.


These teachings are usable with a wide variety of different transmission characteristics and hence can provide benefits with a large number of platforms having transmission/reception agility of various kinds. It will also be seen that these teachings can be employed in conjunction with more traditional identifier/code based techniques including specifically rolling code-based techniques. So configured, security can be increased and often dramatically so. In particular, an unauthorized party will face increased difficulty with respect to viably monitoring the communications of such a system. An unauthorized party will also likely face increased difficulty with respect to accommodating and matching the transmission/reception agility of the resultant system.


These and other benefits may become clearer upon making a thorough review and study of the following detailed description. Referring now to the drawings, and in particular to FIG. 1, an exemplary process 100 provides 101 message content to be transmitted (for example, from a wireless remote control device to a movable barrier operator where the message content comprises remote control signaling, an identifier for at least one of the transmitting platform, the receiving platform, the communication system to which one or more of these elements belongs, and/or a particular communication system user (such as an individual, a particular group of individuals, a business, or some other entity of interest)). In accordance with prior art practice this message content can also comprise, if desired, one or more rolling codes. Those skilled in the art will also understand that this message content can be encrypted, or not, in accordance with the needs and/or requirements of a given application setting.


This process 100 also provides for provision 102 of a plurality of different transmission characteristics. These transmission characteristics pertain to different types of transmission. Relevant examples comprise, but are not limited to:

    • a plurality of candidate data rates;
    • a plurality of candidate spread spectrum practices (including but not limited to various spreading codes, frequency hopping patterns and/or usable (or unusable) channels, and so forth);
    • a plurality of candidate carrier modulations (including but not limited to frequency modulation, amplitude modulation, phase modulation, direct sequencing spread spectrum, frequency hopping spread spectrum, single sideband, vestigial sideband, and so forth);
    • a plurality of candidate carrier frequencies (including but not limited to specific center frequencies and corresponding information such as, but not limited to, channel width, guard band presence and/or width, and so forth);
    • a plurality of candidate joint message formats (including but not limited to integral formats, parsed formats, and so forth as will be described below in more detail);
    • a plurality of candidate data orders (where, for example, the order is changed for all remaining portions of the message, only a portion of the remaining message, or follows a pattern per message position);
    • a plurality of candidate data inversion patterns (where, for example, the inversion can be for the rest of the message, for a portion of the message, and/or follows a pattern per message position);
    • a plurality of candidate data symbols representing a data value (where, for example, the representation is modified for the whole message, a specific portion of the message, and/or follows a pattern per message position).


In a similar fashion this process 100 then further provides 103 for a correlated (or at least partially correlated) plurality of recovery identifiers (where, for example, a given recovery identifier correlates to and therefore essentially serves to identify a specific one of the transmission characteristics as was provided above). Accordingly, it will be understood that these recovery identifiers can comprise, but are not limited to:

    • particular data rate identifiers;
    • particular spread spectrum practice identifiers;
    • particular carrier modulation identifiers;
    • particular carrier frequency identifiers;
    • particular joint message format identifiers;
    • particular data order identifiers;
    • particular data inversion pattern identifiers;
    • particular symbol pattern identifiers;


      and so forth, to name but a few.


The recovery identifier can comprise, for example, a simple code where a specific value, such as a binary value, corresponds to a particular transmission characteristic. As a simplified example, when only two transmission characteristics are provided then a one-bit value will serve to identify these transmission characteristics. To illustrate, a value of “0” can correlate to a first transmission characteristic while a value of “1” can correlate to the second transmission characteristic. It would be possible, for example, for each recovery identifier to essentially point to a specific entry in a lookup table, where the specific entry itself defines the corresponding transmission characteristic.


If desired, the recovery identifier can share functionality and meaning in support of other content or capability. As an illustration, all or part of a rolling code can also serve as a recovery identifier. For example, and to continue the simple example presented above, the least significant bit of a rolling code can also serve to identify each of two provided transmission characteristics.


Pursuant to this process 100, one then selects 104 a particular one of the different transmission characteristics to thereby provide a selected transmission characteristic. This selection step 104 can be carried out in any of a wide variety of ways with a specific approach likely being dictated by the needs and/or limitations inherent to a given application context. As one example, the particular transmission characteristic can be selected essentially at random. As another example the particular transmission characteristic can be selected pursuant to a pre-selected selection pattern. The selection itself can be the result of a specific selection process or can be a part of another process (as when the particular transmission characteristic selected is dependent upon the least significant bit (or bits) of a rolling code as is derived via its own derivation process).


This process 100 then facilitates the transmission 105 of a joint message that comprises at least the recovery identifier as uniquely corresponds to the selected transmission characteristic and the previously provided message content. In a preferred approach, at least the message content portion of the joint message is transmitted using the selected transmission characteristic 106.


There are various useful ways to deploy these teachings. For example, and referring now to FIG. 2, a given joint message 200 can comprise a first portion (such as a first field) that comprises the recovery identifier 201 and a second portion (such as a second field) that comprises the message content 202 where the first and second portion comprise an essentially continuous aggregation of the recovery identifier 201 and the message content 202. When so aggregated, if desired, the two portions or fields can be essentially discrete from one another as suggested by the schematic illustration provided in FIG. 2. If desired, however, these portions can be interleaved with one another as is suggested and shown in FIG. 3. In this illustrative example, small portions comprising parts of the recovery identifier 301 and the message content 302 are interleaved with one another. This interleaving can comprise a symmetrical pattern (as is suggested by the illustration provided) or can be effected using any other pattern or interleaving criteria of choice.


In the illustrative examples provided above, the recovery identifier and the message content are aggregated with one another. It is also possible, however, for the joint message 200 to comprise a plurality of discrete messages as is suggested by the schematic depiction of FIG. 4. In this example the recovery identifier 201 is separate and distinct from the message content 202. The nature of this separation can vary with the needs and/or limitations of a given application setting. Useful examples include, but are not limited to, separation by time (as when the individual joint message portions are sent at considerably different times), carrier characteristics (as when the individual joint message portions are sent using different transmission characteristics as pertain to the carrier), specific bit patterns, and/or a specific quantity of bits.


The approaches described above can be further parsed and combined in various ways if desired. As but one illustration of many possibilities, and referring now to FIG. 5, the message content can itself be parsed into a first message content portion 502 and a second message content portion 504. In turn, the first message content portion 502 can be sent using a first corresponding transmission characteristic that is identified by a corresponding first recovery identifier 501 and the second message content portion 504 can be sent using a second corresponding transmission characteristic that is identified by a corresponding second recovery identifier 503. These various informational elements can, in turn, be aggregated or separated as described above to form the corresponding joint message 200.


Referring now to FIG. 6, a corresponding receive process 600 preferably begins with reception 601 of a joint message (such as those described above) comprising, at least in part, the recovery content (that is, reception of the recovery content portion (or at least a portion thereof) may precede reception of at least part of the message content portion in order to enable use of the recovery content portion to facilitate proper reception of that message content portion). This process 600 then facilitates selection 602 of a particular way of receiving a transmission of another portion of that joint message (which portion comprises, for example, at least a portion of the message content).


In a preferred approach this selection 602 occurs as a function, at least in part, of the recovery content as has already been received. To illustrate, when the recovery content comprises data that correlates to a first transmission characteristic (as was described above) then a way of receiving as corresponds to that first transmission characteristic can be selected. Similarly, when the recovery content comprises data that correlates to a second transmission characteristic then another way of receiving, which corresponds to that second transmission characteristic, can be selected. This process 600 then uses 603 that selected particular way of receiving to facilitate proper reception of that portion of the joint message as comprises at least a portion of the message content.



FIG. 7 illustrates one way by which these teachings can be employed. In this illustrative example, a transmitter develops (or otherwise detects a need to transmit already available) message content that is denoted here by the letter “X.” 701. In this example, the transmitter then selects a particular transmission type 702 (denoted here by the letter “A”) and the recovery identifier 703 (denoted here by the letter “A*”) which corresponds thereto. The transmitter then transmits a joint message 704 to a receiver, which joint message 704 includes both the recovery identifier “A*” 705 and the message content “X” 706. And, as per these teachings, at least a portion of the joint message 704 as comprises a portion of the message content 706 is transmitted as per the dictates of the selected transmission type “A.”


Upon receiving that portion of the joint message 704 as comprises the recovery identifier “A*” 705, the receiver can employ that information to identify and select the appropriate reception settings that permit compatible reception of that portion of the joint message 704 as comprises, at least in part, at least a part of the message content “X” 706.


So configured, a considerable increase in security occurs. In particular, it becomes increasingly difficult for an unauthorized party to spoof the receiver as mere data alone is insufficient to cause proper reception of the message content. Instead, considerable agility and flexibility with respect to types of transmission must also be supported.


Those skilled in the art will appreciate that the above-described processes are readily enabled using any of a wide variety of available and/or readily configured platforms, including partially or wholly programmable platforms as are known in the art or dedicated purpose platforms as may be desired for some applications. Referring now to FIG. 8, an illustrative approach to a particular transmission platform will be provided.


This transmission platform 800 comprises a transmitter 801 that is preferably capable of various selectable types of transmission where, as described above, these various selectable types of transmission differ from one another as a function, at least in part, of corresponding transmission characteristics. In a preferred approach a single dynamically configurable transmitter serves this purpose. If desired, however, the transmitter 801 can comprise a plurality of discrete transmitters that differ from one another in the indicated manner. In a preferred embodiment this transmitter 801 comprises a wireless transmitter.


This transmission platform 800 preferably further comprises a joint message formatter 802 having an input that operably couples to receive message content 803 (as may be stored, for example, in a memory) and another input that operably couples to receive a selected recover content indicator 804 (as may be stored, for example, in another memory). So configured, the joint message formatter 802 serves to format and otherwise provide the joint message described above. If desired, this transmission platform 800 can further comprise a transmission type selector 805 that operably couples to both the recovery content indicators 804 (to facilitate selection of a particular one of the stored indicators) and the transmitter 801 (to facilitate selection of a particular type of transmission to be used when conveying the message content portion of the joint message).


The above-described elements can comprise discrete components if desired. It is also possible, however, to view the transmission platform 800 presented in FIG. 8 as a logical view where one or more of these elements are realized via shared facilities. For example, it may be useful for many applications to use a wholly or partially programmable platform such as a microprocessor 806 to effect the described functionality. It may also be useful, at least in some application settings as when the transmission platform 800 comprises a wireless remote control for a movable barrier operator, to further provide for a user interface 807 (such as, but not limited to, one or more user-assertable buttons, switches, keys, a touch screen, or the like). Such an interface can serve, for example, as a triggering mechanism to begin the described processes.


Referring now to FIG. 9, an illustrative approach to a particular reception platform will be provided. In this illustrative embodiment the reception platform 900 comprises a receiver 901 (for example, a wireless receiver) that is preferably capable of receiving various selectable types of transmissions wherein these selectable types of transmissions differ from one another as a function, at least in part, of corresponding transmission characteristics as have been presented above. As with the above-described transmitter, this receiver 901 can comprise a single selectively agile platform in this regard or can itself be comprised of a plurality of discrete receivers that each support some, but not all, of the selectable types of transmission. Pursuant to these teachings, this receiver 901 is configured and arranged to facilitate compatible reception of a joint message such as those described herein.


This receiver 901 operably couples to a joint message processor 902 which extracts the recovery content and message content as described above from a received joint message. The recovery content, in turn, is provided to a transmission characteristic selector 903 which in turn selects, in this embodiment, a particular transmission characteristic and hence a particular type of reception technique to be employed to facilitate compatible reception of the message content portion of the joint message.


So configured, a transmitter and a corresponding receiver can each readily support the teachings set forth herein. In particular, a plurality of differing types of transmission are selectively usable to effectively encode (in a manner of speaking) message content to be conveyed between the transmitter and the receiver (which message content may comprise, for example, an instruction to be carried out via the receiver). The receiver determines a particular type of reception to employ when receiving the transmission of the message content based, at least in part, upon a recovery indicator that also comprises a part of the overall message.


Those skilled in the art will recognize that a wide variety of modifications, alterations, and combinations can be made with respect to the above described embodiments without departing from the spirit and scope of the invention, and that such modifications, alterations, and combinations are to be viewed as being within the ambit of the inventive concept.

Claims
  • 1. A method comprising: providing a message content that includes a rolling code;selecting from a plurality of different transmission characteristics a transmission characteristic based at least in part on at least a portion of the rolling code of the message content, the selected transmission characteristic including a data order;selecting from a plurality of different recovery identifiers a particular recovery identifier correlated to the selected transmission characteristic, the selected recovery identifier including a data order identifier; andwirelessly transmitting from a transmitter of a remote control to a movable barrier operator a message comprising a contiguous aggregation of the message content and the selected recovery identifier as uniquely corresponds to the selected transmission characteristic,wherein the message is configured to allow a receiver of the movable barrier operator to configure itself in response to receipt of the message.
  • 2. The method of claim 1 wherein the selected transmission characteristic further includes at least one of: a data rate;a conversion symbol seta spread spectrum practice;a carrier modulation;a bit inversion pattern;a carrier frequency;a bit interleaving pattern;a bit pattern;a joint message format;a data inversion pattern.
  • 3. The method of claim 1 wherein the selected recovery identifier further includes at least one of: a data rate identifier;a symbol conversion set identifier;a spread spectrum practice identifier;a carrier modulation identifier;a bit inversion pattern identifier;a carrier frequency identifier;a bit interleaving pattern identifier;a bit pattern identifier;a joint message format identifier;a data inversion pattern identifier.
  • 4. The method of claim 1 wherein the message content comprises, at least in part, an identifier for at least one of: a transmitting platform;a receiving platform;a communication system;a communication system user.
  • 5. The method of claim 1 wherein transmitting the message comprises transmitting a plurality of discrete messages.
  • 6. The method of claim 1 wherein transmitting the message comprises serially transmitting data elements as comprise the message.
  • 7. The method of claim 6 wherein serially transmitting the data elements as comprise the message comprises serially transmitting the data elements via a wireless connection.
  • 8. The method of claim 1 wherein the message content comprises remote control signaling.
  • 9. The method of claim 1 wherein the movable barrier operator includes a garage door operator, and wherein wirelessly transmitting the message from the transmitter of the remote control to the movable barrier operator includes wirelessly transmitting from the transmitter of the remote control to the garage door operator.
  • 10. The method of claim 1, wherein the recovery identifier comprises a least significant bit or bits of the rolling code.
  • 11. The method of claim 10, wherein the least significant bit or bits identifies the transmission characteristic.
  • 12. An apparatus comprising: a transmitter configured to provide a message content that includes a rolling code, the transmitter configured to select from a plurality of different transmission characteristics a particular transmission characteristic based at least in part on at least a portion of the rolling code of the message content, the selected transmission characteristic including a data order;the transmitter further configured to select from a plurality of different recovery identifiers a particular recovery identifier correlated to the selected transmission characteristic, the selected recovery identifier including a data order identifier;the transmitter further configured to wirelessly transmit a message to a movable barrier operator, the message comprising a continuous aggregation of the message content and the selected recovery identifier as uniquely corresponds to the selected transmission characteristic,wherein the message is configured to allow a receiver of the movable barrier operator to configure itself in response to receipt of the message.
  • 13. The apparatus of claim 12 wherein the selected transmission characteristic further includes at least one of: a data rate;a conversion symbol set;a spread spectrum practice;a carrier modulation;a bit inversion pattern;a carrier frequency;a bit interleaving pattern;a bit pattern;a data inversion pattern;a joint message format.
  • 14. The apparatus of claim 12 wherein the selected recovery identifier further includes at least one of: a data rate identifier;a symbol conversion set identifier;a spread spectrum practice identifier;a carrier modulation identifier;a bit inversion pattern identifier;a carrier frequency identifier;a bit interleaving pattern identifier;a bit pattern identifier;a data inversion pattern identifier;a joint message format identifier.
  • 15. The apparatus of claim 12 wherein the message content comprises remote control signaling.
  • 16. The apparatus of claim 12 wherein the recovery identifier comprises a least significant bit or bits of the rolling code of the message content.
  • 17. The apparatus of claim 16 wherein the least significant bit or bits identifies the transmission characteristic.
  • 18. The apparatus of claim 12 wherein the message content comprises, at least in part, an identifier for at least one of: a transmitting platform;a receiving platform;a communication system;a communication system user.
  • 19. The apparatus of claim 12 wherein the transmitter is further configured to wirelessly transmit the message by transmitting a plurality of discrete messages.
  • 20. The apparatus of claim 12 wherein the transmitter is further configured to serially transmit data elements that comprise the message.
  • 21. The apparatus of claim 20 wherein to serially transmit the data elements as comprise the message comprises serially transmitting the data elements via a wireless connection.
  • 22. The apparatus of claim 12 wherein the movable barrier operator includes a garage door operator, and wherein to wirelessly transmit the message to the movable barrier operator comprises wirelessly transmitting to the garage door operator from a remote control that includes the transmitter.
  • 23. A method comprising: providing a message content that includes a rolling code;selecting from a plurality of different transmission characteristics a transmission characteristic based at least in part on at least a portion of the rolling code of the message content, the selected transmission characteristic including a data inversion pattern;selecting from a plurality of different recovery identifiers a particular recovery identifier correlated to the selected transmission characteristic, the selected recovery identifier including a data inversion pattern identifier; andwirelessly transmitting from a transmitter of a remote control to a movable barrier operator a message comprising a continuous aggregation of the message content and the selected recovery identifier as uniquely corresponds to the selected transmission characteristic,wherein the message is configured to allow a receiver of the movable barrier operator to configure itself in response to receipt of the message.
  • 24. The method of claim 23 wherein the selected transmission characteristic further includes at least one of: a data rate;a conversion symbol seta spread spectrum practice;a carrier modulation;a bit inversion pattern;a carrier frequency;a bit interleaving pattern;a bit pattern;a joint message format;a data order.
  • 25. The method of claim 23 wherein the selected recovery identifier further includes at least one of: a data rate identifier;a symbol conversion set identifier;a spread spectrum practice identifier;a carrier modulation identifier;a bit inversion pattern identifier;a carrier frequency identifier;a bit interleaving pattern identifier;a bit pattern identifier;a joint message format identifier;a data order identifier.
  • 26. The method of claim 23 wherein the message content comprises, at least in part, an identifier for at least one of: a transmitting platform;a receiving platform;a communication system;a communication system user.
  • 27. The method of claim 23 wherein transmitting the message comprises transmitting a plurality of discrete messages.
  • 28. The method of claim 23 wherein transmitting the message comprises serially transmitting data elements as comprise the message.
  • 29. The method of claim 28 wherein serially transmitting the data elements as comprise the message comprises serially transmitting the data elements via a wireless connection.
  • 30. The method of claim 23 wherein the message content comprises remote control signaling.
  • 31. The method of claim 23 wherein the movable barrier operator includes a garage door operator, and wherein wirelessly transmitting the message from the transmitter of the remote control to the movable barrier operator includes wirelessly transmitting from the transmitter of the remote control to the garage door operator.
  • 32. The method of claim 23, wherein the recovery identifier comprises a least significant bit or bits of the rolling code.
  • 33. The method of claim 32, wherein the least significant bit or bits identifies the transmission characteristic.
  • 34. An apparatus comprising: a transmitter configured to provide a message content that includes a rolling code, the transmitter configured to select from a plurality of different transmission characteristics a particular transmission characteristic based at least in part on at least a portion of the rolling code of the message content, the selected transmission characteristic including a data inversion pattern;the transmitter further configured to select from a plurality of different recovery identifiers a particular recovery identifier correlated to the selected transmission characteristic, the selected recovery identifier including a data inversion pattern identifier;the transmitter further configured to wirelessly transmit a message to a movable barrier operator, the message comprising a contiguous aggregation of the message content and the selected recovery identifier as uniquely corresponds to the selected transmission characteristic,wherein the message is configured to allow a receiver of the movable barrier operator to configure itself in response to receipt of the message.
  • 35. The apparatus of claim 34 wherein the selected transmission characteristic further includes at least one of: a data rate;a conversion symbol set;a spread spectrum practice;a carrier modulation;a bit inversion pattern;a carrier frequency;a bit interleaving pattern;a bit pattern;a joint message format;a data order.
  • 36. The apparatus of claim 34 wherein the selected recovery identifier further includes at least one of: a data rate identifier;a symbol conversion set identifier;a spread spectrum practice identifier;a carrier modulation identifier;a bit inversion pattern identifier;a carrier frequency identifier;a bit interleaving pattern identifier;a bit pattern identifier;a joint message format identifier;a data order identifier.
  • 37. The apparatus of claim 34 wherein the message content comprises remote control signaling.
  • 38. The apparatus of claim 34 wherein the recovery identifier comprises a least significant bit or bits of the rolling code of the message content.
  • 39. The apparatus of claim 38 wherein the least significant bit or bits identifies the transmission characteristic.
  • 40. The apparatus of claim 34 wherein the message content comprises, at least in part, an identifier for at least one of: a transmitting platform;a receiving platform;a communication system;a communication system user.
  • 41. The apparatus of claim 34 wherein the transmitter is further configured to wirelessly transmit the message by transmitting a plurality of discrete messages.
  • 42. The apparatus of claim 34 wherein the transmitter is further configured to serially transmit data elements as comprise the message.
  • 43. The apparatus of claim 42 wherein to serially transmit the data elements as comprise the message comprises serially transmitting the data elements via a wireless connection.
  • 44. The apparatus of claim 34 wherein the movable barrier operator includes a garage door operator, and wherein to wirelessly transmit the message to the movable barrier operator comprises wirelessly transmitting to the garage door operator from a remote control that includes the transmitter.
RELATED APPLICATION

This is a continuation of U.S. patent application Ser. No. 11/172,525, filed Jun. 30, 2005, entitled, “Method and apparatus to facilitate message transmission and reception using different transmission characteristics,” which is incorporated by reference in its entirety.

US Referenced Citations (397)
Number Name Date Kind
D29525 Sherman Aug 1860 S
D30957 Campbell Dec 1860 S
D35364 Cox May 1862 S
2405500 Gustav Aug 1946 A
3716865 Willmott Feb 1973 A
3735106 Hollaway May 1973 A
3792446 Mc Feb 1974 A
3798359 Feistel Mar 1974 A
3798360 Feistel Mar 1974 A
3798544 Norman Mar 1974 A
3798605 Feistel Mar 1974 A
3845277 Spetz Oct 1974 A
3890601 Pietrolewicz Jun 1975 A
3906348 Willmott Sep 1975 A
3938091 Atalla Feb 1976 A
4037201 Willmott Jul 1977 A
4064404 Willmott Dec 1977 A
RE29525 Willmott Jan 1978 E
4078152 Tuckerman Mar 1978 A
4097859 Looschen Jun 1978 A
4138735 Allocca Feb 1979 A
4178549 Ledenbach Dec 1979 A
4195196 Feistel Mar 1980 A
4195200 Feistel Mar 1980 A
4196310 Forman Apr 1980 A
4218738 Matyas Aug 1980 A
4243976 Warner Jan 1981 A
4255742 Gable Mar 1981 A
4304962 Fracassi Dec 1981 A
4305060 Apple Dec 1981 A
4316055 Feistel Feb 1982 A
4326098 Bouricius Apr 1982 A
4327444 Court Apr 1982 A
4328414 Atalla May 1982 A
4328540 Matsuoka May 1982 A
RE30957 Feistel Jun 1982 E
4380762 Capasso Apr 1983 A
4385296 Tsubaki May 1983 A
4387455 Schwartz Jun 1983 A
4387460 Boutmy Jun 1983 A
4393269 Konheim Jul 1983 A
4418333 Schwarzbach Nov 1983 A
4426637 Apple Jan 1984 A
4445712 Smagala-Romanoff May 1984 A
4447890 Duwel May 1984 A
4454509 Buennagel Jun 1984 A
4464651 Duhame Aug 1984 A
4468787 Keiper Aug 1984 A
4471493 Schober Sep 1984 A
4471593 Ragland Sep 1984 A
4491774 Schmitz Jan 1985 A
4509093 Stellberger Apr 1985 A
4529980 Liotine Jul 1985 A
4535333 Twardowski Aug 1985 A
4566044 Langdon Jan 1986 A
4574247 Jacob Mar 1986 A
4578530 Zeidler Mar 1986 A
4580111 Swanson Apr 1986 A
4581606 Mallory Apr 1986 A
4590470 Koenig May 1986 A
4593155 Hawkins Jun 1986 A
4596898 Pemmaraju Jun 1986 A
4596985 Bongard Jun 1986 A
4599489 Cargile Jul 1986 A
4602357 Yang Jul 1986 A
4611198 Levinson Sep 1986 A
4623887 Welles Nov 1986 A
4626848 Ehlers Dec 1986 A
4628315 Douglas Dec 1986 A
4630035 Stahl Dec 1986 A
4633247 Hegeler Dec 1986 A
4638433 Schindler Jan 1987 A
4646080 Genest Feb 1987 A
4652860 Weishaupt Mar 1987 A
4653076 Jerrim Mar 1987 A
4670746 Taniguchi Jun 1987 A
4677284 Genest Jun 1987 A
4686529 Kleefeldt Aug 1987 A
4695839 Barbu Sep 1987 A
4703359 Rumbolt Oct 1987 A
4710613 Shigenaga Dec 1987 A
4716301 Willmott Dec 1987 A
4720860 Weiss Jan 1988 A
4723121 Van Feb 1988 A
4731575 Sloan Mar 1988 A
4737770 Brunius Apr 1988 A
4740792 Sagey Apr 1988 A
4750118 Heitschel Jun 1988 A
4754255 Sanders Jun 1988 A
4755792 Pezzolo Jul 1988 A
4758835 Rathmann Jul 1988 A
4761808 Howard Aug 1988 A
4779090 Micznik Oct 1988 A
4794268 Nakano Dec 1988 A
4794622 Isaacman Dec 1988 A
4796181 Wiedemer Jan 1989 A
4799061 Abraham Jan 1989 A
4800590 Vaughan Jan 1989 A
4802114 Sogame Jan 1989 A
4804938 Rouse Feb 1989 A
4807052 Amano Feb 1989 A
4808995 Clark Feb 1989 A
4825200 Evans Apr 1989 A
4825210 Bachhuber Apr 1989 A
4829296 Clark May 1989 A
4831509 Jones May 1989 A
4835407 Kataoka May 1989 A
4845491 Fascenda Jul 1989 A
4847614 Keller Jul 1989 A
4850046 Philippe Jul 1989 A
4855713 Brunius Aug 1989 A
4856062 Weiss Aug 1989 A
4856081 Smith Aug 1989 A
4859990 Isaacman Aug 1989 A
4870400 Downs Sep 1989 A
4878052 Schulze Oct 1989 A
4881148 Lambropoulos Nov 1989 A
4885778 Weiss Dec 1989 A
4888575 De Vaulx Dec 1989 A
4890108 Drori Dec 1989 A
4893338 Pastor Jan 1990 A
4905279 Nishio Feb 1990 A
4910750 Fisher Mar 1990 A
4912463 Li Mar 1990 A
4914696 Dudczak Apr 1990 A
4918690 Markkula Apr 1990 A
4922168 Ivaggamon May 1990 A
4922533 Philippe May 1990 A
4928098 Dannhaeuser May 1990 A
4931789 Pinnow Jun 1990 A
4939792 Urbish Jul 1990 A
4942393 Waraksa Jul 1990 A
4951029 Severson Aug 1990 A
4963876 Sanders Oct 1990 A
4979832 Ritter Dec 1990 A
4980913 Skret Dec 1990 A
4988990 Warrior Jan 1991 A
4988992 Heitschel Jan 1991 A
4992783 Zdunek Feb 1991 A
4999622 Amano Mar 1991 A
5001332 Schrenk Mar 1991 A
5021776 Anderson Jun 1991 A
5023908 Weiss Jun 1991 A
5049867 Stouffer Sep 1991 A
5055701 Takeuchi Oct 1991 A
5058161 Weiss Oct 1991 A
5060263 Bosen Oct 1991 A
5091942 Dent Feb 1992 A
5103221 Memmola Apr 1992 A
5107258 Soum Apr 1992 A
5126959 Kurihara Jun 1992 A
5136548 Claar Aug 1992 A
5144667 Pogue Sep 1992 A
5146067 Sloan Sep 1992 A
5148159 Clark Sep 1992 A
5150464 Sidhu Sep 1992 A
5153581 Hazard Oct 1992 A
5159329 Lindmayer Oct 1992 A
5168520 Weiss Dec 1992 A
5193210 Nicholas Mar 1993 A
5197061 Halbert-Lassalle Mar 1993 A
5224163 Gasser Jun 1993 A
5237614 Weiss Aug 1993 A
5252960 Duhame Oct 1993 A
5278907 Snyder Jan 1994 A
5280527 Gullman Jan 1994 A
5331325 Miller Jul 1994 A
5361062 Weiss Nov 1994 A
5363448 Koopman Nov 1994 A
5365225 Bachhuber Nov 1994 A
5367572 Weiss Nov 1994 A
5369706 Latka Nov 1994 A
5412379 Waraksa May 1995 A
5414418 Andros May 1995 A
5420925 Michaels May 1995 A
5442340 Dykema Aug 1995 A
5442341 Lambropoulos Aug 1995 A
5444737 Cripps Aug 1995 A
5463376 Stoffer Oct 1995 A
5471668 Soenen Nov 1995 A
5473318 Martel Dec 1995 A
5479512 Weiss Dec 1995 A
5485519 Weiss Jan 1996 A
5517187 Bruwer May 1996 A
5528621 Heiman Jun 1996 A
5530697 Watanabe Jun 1996 A
5554977 Jablonski Sep 1996 A
RE35364 Heitschel Oct 1996 E
5563600 Miyake Oct 1996 A
5565812 Soenen Oct 1996 A
5566359 Corrigan Oct 1996 A
5576701 Heitschel Nov 1996 A
5578999 Matsuzawa Nov 1996 A
5594429 Nakahara Jan 1997 A
5598475 Soenen Jan 1997 A
5600653 Chitre Feb 1997 A
5608723 Felsenstein Mar 1997 A
5635913 Willmott Jun 1997 A
5657388 Weiss Aug 1997 A
5673017 Dery Sep 1997 A
5678213 Myer Oct 1997 A
5680131 Utz Oct 1997 A
5686904 Bruwer Nov 1997 A
5699065 Murray Dec 1997 A
5719619 Hattori et al. Feb 1998 A
5745068 Takahashi Apr 1998 A
5774065 Mabuchi Jun 1998 A
5778348 Manduley Jul 1998 A
5838747 Matsumoto Nov 1998 A
5872519 Issa Feb 1999 A
5898397 Murray Apr 1999 A
5923758 Khamharn Jul 1999 A
5936999 Keskitalo Aug 1999 A
5937065 Simon Aug 1999 A
5942985 Chin Aug 1999 A
5949349 Farris Sep 1999 A
6012144 Pickett Jan 2000 A
6049289 Waggamon Apr 2000 A
6052408 Trompower Apr 2000 A
6070154 Tavor May 2000 A
6094575 Anderson et al. Jul 2000 A
6154544 Farris Nov 2000 A
6157719 Wasilewski Dec 2000 A
6166650 Bruwer Dec 2000 A
6175312 Bruwer Jan 2001 B1
6181255 Crimmins Jan 2001 B1
6243000 Tsui Jun 2001 B1
6275519 Hendrickson Aug 2001 B1
6414587 Fitzgibbon Jul 2002 B1
6414986 Usui Jul 2002 B1
6456726 Yu Sep 2002 B1
6463538 Elteto Oct 2002 B1
6496477 Perkins Dec 2002 B1
6535544 Partyka Mar 2003 B1
6549949 Bowman-Amuah Apr 2003 B1
6609796 Maki et al. Aug 2003 B2
6640244 Bowman-Amuah Oct 2003 B1
6688518 Valencia Feb 2004 B1
6690796 Farris Feb 2004 B1
6697379 Jacquet Feb 2004 B1
6754266 Bahl Jun 2004 B2
6810123 Farris Oct 2004 B2
6829357 Alrabady Dec 2004 B1
6850910 Yu Feb 2005 B1
6930983 Perkins Aug 2005 B2
6956460 Tsui Oct 2005 B2
6963561 Lahat Nov 2005 B1
6980518 Sun Dec 2005 B1
6980655 Farris Dec 2005 B2
6988977 Gregori Feb 2006 B2
6998977 Gregori Feb 2006 B2
7002490 Lablans Feb 2006 B2
7039397 Chuey May 2006 B2
7039809 Wankmueller May 2006 B1
7042363 Katrak May 2006 B2
7050479 Kim May 2006 B1
7050794 Chuey et al. May 2006 B2
7057494 Fitzgibbon Jun 2006 B2
7057547 Olmsted Jun 2006 B2
7068181 Chuey Jun 2006 B2
7071850 Fitzgibbon Jul 2006 B1
7088218 Chuey Aug 2006 B2
7088706 Zhang et al. Aug 2006 B2
7139398 Candelore Nov 2006 B2
7161466 Chuey Jan 2007 B2
7298721 Atarashi et al. Nov 2007 B2
7301900 Laksono Nov 2007 B1
7332999 Fitzgibbon Feb 2008 B2
7333615 Jarboe Feb 2008 B1
7336787 Unger Feb 2008 B2
7346163 Pedlow Mar 2008 B2
7353499 De Jong Apr 2008 B2
7406553 Edirisooriya et al. Jul 2008 B2
7412056 Farris Aug 2008 B2
7415618 De Jong Aug 2008 B2
7429898 Akiyama Sep 2008 B2
7447498 Chuey et al. Nov 2008 B2
7489922 Chuey Feb 2009 B2
7492898 Farris et al. Feb 2009 B2
7492905 Fitzgibbon Feb 2009 B2
7516325 Willey Apr 2009 B2
7535926 Deshpande May 2009 B1
7545942 Cohen et al. Jun 2009 B2
7548153 Gravelle et al. Jun 2009 B2
7561075 Fitzgibbon Jul 2009 B2
7564827 Das et al. Jul 2009 B2
7598855 Scalisi et al. Oct 2009 B2
7623663 Farris Nov 2009 B2
7668125 Kadous Feb 2010 B2
7741951 Fitzgibbon Jun 2010 B2
7742501 Williams Jun 2010 B2
7757021 Wenzel Jul 2010 B2
7764613 Miyake et al. Jul 2010 B2
7786843 Witkowski Aug 2010 B2
7812739 Chuey Oct 2010 B2
7839851 Kozat Nov 2010 B2
7855633 Chuey Dec 2010 B2
7999656 Fisher Aug 2011 B2
8014377 Zhang et al. Sep 2011 B2
8130079 McQuaide, Jr. et al. Mar 2012 B2
8194856 Farris Jun 2012 B2
8207818 Keller, Jr. Jun 2012 B2
8209550 Gehrmann Jun 2012 B2
8225094 Willey Jul 2012 B2
8233625 Farris Jul 2012 B2
8266442 Burke Sep 2012 B2
8276185 Messina et al. Sep 2012 B2
8284021 Farris et al. Oct 2012 B2
8290465 Ryu et al. Oct 2012 B2
8416054 Fitzgibbon Apr 2013 B2
8422667 Fitzgibbon Apr 2013 B2
8452267 Friman May 2013 B2
8463540 Hannah et al. Jun 2013 B2
8536977 Fitzgibbon Sep 2013 B2
8544523 Mays Oct 2013 B2
8581695 Carlson et al. Nov 2013 B2
8615562 Huang et al. Dec 2013 B1
8633797 Farris et al. Jan 2014 B2
8634777 Ekbatani et al. Jan 2014 B2
8645708 Labaton Feb 2014 B2
8661256 Willey Feb 2014 B2
8699704 Liu et al. Apr 2014 B2
8760267 Bos et al. Jun 2014 B2
8787823 Justice et al. Jul 2014 B2
8830925 Kim et al. Sep 2014 B2
8836469 Fitzgibbon et al. Sep 2014 B2
9082293 Wellman et al. Jul 2015 B2
9124424 Aldis Sep 2015 B2
9142064 Muetzel et al. Sep 2015 B2
9160408 Krohne et al. Oct 2015 B2
9280704 Lei et al. Mar 2016 B2
9317983 Ricci Apr 2016 B2
9336637 Neil et al. May 2016 B2
9396376 Narayanaswami Jul 2016 B1
9413453 Sugitani et al. Aug 2016 B2
9418326 Narayanaswami Aug 2016 B1
20010023483 Kiyomoto Sep 2001 A1
20020034303 Farris Mar 2002 A1
20020184504 Hughes Dec 2002 A1
20020191785 McBrearty Dec 2002 A1
20020191794 Farris Dec 2002 A1
20030056001 Mate Mar 2003 A1
20030070092 Hawkes Apr 2003 A1
20030072445 Kuhlman Apr 2003 A1
20030147536 Andivahis Aug 2003 A1
20030177237 Stebbings Sep 2003 A1
20030191949 Odagawa Oct 2003 A1
20030227370 Brookbank Dec 2003 A1
20040019783 Hawkes Jan 2004 A1
20040081075 Tsukakoshi Apr 2004 A1
20040174856 Brouet Sep 2004 A1
20040179485 Terrier Sep 2004 A1
20040181569 Attar Sep 2004 A1
20050053022 Zettwoch Mar 2005 A1
20050058153 Santhoff Mar 2005 A1
20050101314 Levi May 2005 A1
20050174242 Cohen Aug 2005 A1
20050285719 Stephens Dec 2005 A1
20060083187 Dekel Apr 2006 A1
20060109978 Farris May 2006 A1
20060176171 Fitzgibbon Aug 2006 A1
20070005806 Fitzgibbon Jan 2007 A1
20070006319 Fitzgibbon Jan 2007 A1
20070018861 Fitzgibbon Jan 2007 A1
20070058811 Fitzgibbon Mar 2007 A1
20070245147 Okeya Oct 2007 A1
20080229400 Burke Sep 2008 A1
20080297370 Farris Dec 2008 A1
20090016530 Farris Jan 2009 A1
20090021348 Farris Jan 2009 A1
20090096621 Ferlitsch Apr 2009 A1
20090176451 Yang et al. Jul 2009 A1
20090315672 Nantz et al. Dec 2009 A1
20100060413 Fitzgibbon et al. Mar 2010 A1
20100112979 Chen et al. May 2010 A1
20100125509 Kranzley et al. May 2010 A1
20100125516 Wankmueller et al. May 2010 A1
20100199092 Andrus et al. Aug 2010 A1
20100211779 Sundaram Aug 2010 A1
20110051927 Murray et al. Mar 2011 A1
20110296185 Kamarthy et al. Dec 2011 A1
20110316668 Laird Dec 2011 A1
20110316688 Ranjan Dec 2011 A1
20110317835 Laird Dec 2011 A1
20110320803 Hampel et al. Dec 2011 A1
20120054493 Bradley Mar 2012 A1
20120297681 Krupke et al. Nov 2012 A1
20130170639 Fitzgibbon Jul 2013 A1
20130268333 Ovick et al. Oct 2013 A1
20130272520 Noda et al. Oct 2013 A1
20140169247 Jafarian et al. Jun 2014 A1
20140289528 Baghdasaryan Sep 2014 A1
20150222517 McLaughlin et al. Aug 2015 A1
20150358814 Roberts Dec 2015 A1
20160021140 Fitzgibbon Jan 2016 A1
20160198391 Orthmann et al. Jul 2016 A1
20160261572 Liu et al. Sep 2016 A1
Foreign Referenced Citations (92)
Number Date Country
645228 Jan 1994 AU
710682 Sep 1999 AU
2006200340 Aug 2006 AU
2006200340 Aug 2006 AU
2008202369 Jan 2009 AU
2011218848 Sep 2011 AU
2011202656 Jan 2012 AU
2007203558 May 2014 AU
2087722 Jul 1998 CA
2193846 Feb 2004 CA
2177410 Apr 2008 CA
2443452 Jul 2008 CA
2684658 Oct 2008 CA
2708000 Dec 2010 CA
2456680 Feb 2011 CA
2742018 Dec 2011 CA
2565505 Sep 2012 CA
2631076 Sep 2013 CA
2790940 Jun 2014 CA
2596188 Jul 2016 CA
101399825 Apr 2009 CN
3234538 Mar 1984 DE
3234539 Mar 1984 DE
3244049 Sep 1984 DE
3309802 Sep 1984 DE
3309802 Sep 1984 DE
3320721 Dec 1984 DE
3332721 Mar 1985 DE
3407436 Aug 1985 DE
3407469 Sep 1985 DE
3532156 Mar 1987 DE
3636822 Oct 1987 DE
1204463 Aug 1992 DE
0043270 Jan 1982 EP
0103790 Mar 1984 EP
0154019 Sep 1985 EP
0155378 Sep 1985 EP
0244322 Nov 1987 EP
0244332 Nov 1987 EP
0311112 Apr 1989 EP
0335912 Oct 1989 EP
0372285 Jun 1990 EP
0265935 May 1991 EP
0459781 Dec 1991 EP
0857842 Aug 1998 EP
0937845 Aug 1999 EP
1024626 Aug 2000 EP
1223700 Jul 2002 EP
1313260 May 2003 EP
1421728 May 2004 EP
1625560 Feb 2006 EP
1760985 Mar 2007 EP
0771498 May 2007 EP
1865656 Dec 2007 EP
2293478 Mar 2011 EP
2149103 Dec 2011 EP
2437212 Apr 2012 EP
1875333 Jan 2013 EP
2290872 Jun 2014 EP
2800403 Nov 2014 EP
2606232 May 1988 FR
2607544 Jun 1988 FR
2685520 Jun 1993 FR
2737373 Jan 1997 FR
218774 Jul 1924 GB
1156279 Jun 1969 GB
2023899 Jan 1980 GB
2051442 Jan 1981 GB
2099195 Dec 1982 GB
2118614 Nov 1983 GB
2131992 Jun 1984 GB
2133073 Jul 1984 GB
2184774 Jul 1987 GB
2254461 Oct 1992 GB
2265482 Sep 1993 GB
2288261 Oct 1995 GB
2430115 Mar 2007 GB
2440816 Feb 2008 GB
2453383 Apr 2009 GB
H6205474 Jul 1994 JP
09322274 Dec 1997 JP
9300137 Jan 1993 WO
9301140 Jan 1993 WO
9320538 Oct 1993 WO
9400147 Jan 1994 WO
9411829 May 1994 WO
9418036 Aug 1994 WO
0010301 Feb 2000 WO
0010302 Feb 2000 WO
03010656 Feb 2003 WO
03079607 Sep 2003 WO
8908225 Oct 1991 ZA
Non-Patent Literature Citations (221)
Entry
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Dec. 29, 2016.
Australian Examiners First Report on Patent Application No. 2006202850 dated Feb. 25, 2010.
British Application No. GB1110709.1; Combined Search and Examination Report Under Sections 17 and 18(3); dated Sep. 29, 2011.
British Combined Search and Examination Report Under Sections 17 and 18(3); British Patent Application No. GB0920612.9; dated Dec. 16, 2009.
British Combined Search and Examination Report Under Sections 17 and 18(3); British Patent Application No. GB1000541.1; dated Jan. 28, 2010.
British Combined Search and Examination Report Under Sections 17 and 18(3); British Patent Application No. GB1104752.9; dated Apr. 11, 2011.
British Examination Report Under Section 17(5); British Application No. GB0715089.9 dated Nov. 28, 2007.
British Examination Report Under Section 18(3); British Patent Application No. GB0601795.8; dated Apr. 22, 2009.
British Examination Report Under Section 18(3); British Patent Application No. GB0613068.6; dated May 6, 2010.
British Examination Report Under Section 18(3); British Patent Application No. GB0613068.6; dated Nov. 26, 2010.
British Patent Application No. GB1110710.9; Combined Search and Examination Report Under Sections 17 and 18(3); dated Sep. 30, 2011.
British Search Report Under Section 17(5); British Patent Application No. GB0613068.6; dated Oct. 12, 2006.
British Search Report Under Section 17; British Patent Application No. GB0601795.8; dated May 22, 2006.
British Search Report Under Section 17; British Patent Application No. GB0613068.6; dated Aug. 23, 2006.
British Search Report Under Section 17; British Patent Application No. GB0715089.9; dated May 9, 2008.
British Search Report Under Section 18(3); British Patent Application No. GB0613068.6; dated Oct. 12, 2006.
Canadian Patent Application No. 2,551,295; Office Action dated May 6, 2013.
Examination Report Under Section 17 From British Patent Application No. GB0601795.8; dated Jan. 28, 2010.
Examination Report Under Section 17 From British Patent Application No. GB0601795.8; dated Sep. 25, 2009.
Examination Report Under Section 17 From British Patent Application No. GB0920612.9; dated Jan. 28, 2010.
Examination Report Under Section 18(3) From British Patent Application No. GB0613068.6; dated Jan. 31, 2011.
Examination Report Under Section 18(3) From British Patent Application No. GB0715089.9; dated Sep. 30, 2010.
Examination Report Under Section 18(3) from British Patent Application No. GB0715089.9 dated Apr. 11, 2011.
GB Examination Report; British Patent Application No. GB0613068.6; dated Nov. 26, 2010.
Office Action dated Mar. 21, 2011 from U.S. Appl. No. 11/172,525.
Search Report Under Section 17, Application No. GB0715089.9; dated Nov. 27, 2007.
Search Report Under Section 17; British Patent Application No. GB0715089.9; dated May 9, 2008.
Search Report Under Section 17 From British Patent Application No. GB0601795.8; dated Apr. 22, 2009.
U.S. Office Action dated Mar. 21, 2011 from U.S. Appl. No. 11/172,525.
U.S. Appl. No. 11/172,524; Office Action dated Apr. 9, 2009.
Office Action from U.S. Appl. No. 11/172,525 dated Apr. 9, 2009.
Australian Patent Application No. 2016203457; Examination Report No. 1; dated May 29, 2017.
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Dec. 27, 2017.
Australian Patent Application No. 2017265017; First Examination Report dated Oct. 8, 2018; 4 pages.
German Patent Application No. 10 2006 003 808.8; Official Action dated Oct. 9, 2018 (with translation of relevant parts); 7 pages.
Abrams, and Podell, ‘Tutorial Computer and Network Security,’ District of Columbia: IEEE, 1987. pp. 1075-1081.
Abramson, Norman. ‘The Aloha System—Another alternative for computer communications,’ pp. 281-285, University of Hawaii, 1970.
Adams, Russ, Classified, data-scrambling program for Apple II, Info-World, vol. 5, No. 3; Jan. 31, 1988.
Alexi, Werner, et al. ‘RSA and Rabin Functions: Certain Parts Are as Hard as the Whole’, pp. 194-209, Siam Computing, vol. 14, No. 2, Apr. 1988.
Allianz: Allianz-Zentrum for Technik GmbH—Detailed Requirements for Fulfilling the Specification Profile for Electronically Coded OEM Immobilizers, Issue 22, (Jun. 1994 (Translation Jul. 5, 1994).
Anderson, Ross. ‘Searching for the Optium Correlation Attack’, pp. 137-143, Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, Copyright 1995.
Arazi, Benjamin, Vehicular Implementations of Public Key Cryptographic Techniques, IEEE Transactions on Vehicular Technology, vol. 40, No. 3, Aug. 1991, 646-653.
Baran, P. Distribution Communications, vol. 9, ‘Security Secrecy and Tamper-free Communications’, Rand Corporation, 1964.
Barbaroux, Paul. ‘Uniform Results in. Polynomial-Time Security’, pp. 297-306, Advances in Cryptology—Eurocrypt 92, 1992.
Barlow, Mike, ‘A Mathematical Word Block Cipher,’ 12 Cryptologia 256-264 (1988).
Bellovin, S.M. ‘Security Problems in the TCPIIP Protocol Suite’, pp. 32-49, Computer Communication Review, New Jersey, Reprinted from Computer Communication Review, vol. 19, No. 2, pp. 32-48, Apr. 1989.
Bloch, Gilbert. Enigma Before Ultra Polish Work and the French Contribution, pp. 142-155, Cryptologia 11(3), (Jul. 1987).
Bosworth, Bruce, ‘Codes, Ciphers, and Computers: An Introduction to Information Security’ Hayden Book Company, Inc. 1982, pp. 30-54.
Brickell, Ernest F. and Stinson, Doug. ‘Authentication Codes With Multiple Arbiters’, pp. 51-55, Proceedings of Eurocrypt 88, 1988.
Bruwer, Frederick J. ‘Die Toepassing Van Gekombineerde Konvolusiekodering en Modulasie op HF-Datakommunikasie,’ District of Pretoria in South Africa Jul. 1998.
Burger, Chris R, Secure Learning RKE Systems Using KeeLoq.RTM. Encoders, TB001, 1996 Microchip Technology, Inc., 1-7.
Burmeister, Mike. A Remark on the Effiency of Identification Schemes, pp. 493-495, Advances in Cryptology—Eurocrypt 90, (1990).
Canadian Patent Application No. 2,926,281, Canadian Office Action dated Nov. 19, 2018.
Cattermole, K.W., ‘Principles of Pulse Code Modulation’ Iliffe Books Ltd., 1969, pp. 30-381.
Cerf, Vinton a ‘Issues in Packet-Network Interconnection’, pp. 1386-1408, Proceedings of the IEEE, 66(11), Nov. 1978.
Cerf, Vinton G. and Kahn, Robert E. ‘A Protocol for Packet Network Intercommunication’, pp. 637-648, Transactions on Communications, vol. Com-22, No. 5, May 1974.
Charles Watts, How to Program the HiSec(TM) Remote Keyless Entry Rolling Code Generator, National Semiconductor, Oct. 1994, 1-4.
Computer Arithmetic by Henry Jacobowitz; Library of Congress Catalog Card No. 62-13396; Copyright Mar. 1962 by John F. Rider Publisher, Inc.
Conner, Doug, Cryptographic Techniques—Secure Your Wireless Designs, EDN (Design Feature), Jan. 18, 1996, 57-68.
Coppersmith, Don. ‘Fast Evalution of Logarithms in Fields of Characteristic Two’, IT-30(4): pp. 587-594, IEEE Transactions on Information Theory, Jul. 1984.
Daniels, George, ‘Pushbutton Controls for Garage Doors’ Popular Science (Aug. 1959), pp. 156-160.
Davies, D.W. and Price, W.C. ‘Security for Computer Networks,’ John Wiley and Sons, 1984. Chapter 7, pp. 175-176.
Davies, Donald W., ‘Tutorial: The Security of Data in Networks,’ pp. 13-17, New York: IEEE, 1981.
Davis, Ben and De Long, Ron. Combined Remote Key Conrol and Immobilization System for Vehicle Security, pp. 125-132, Power Electronics in Transportation, IEEE Catalogue No. 96TH8184, (Oct. 24, 1996).
Davis, Gregory and Palmer, Morris. Self-Programming, Rolling-Code Technology Creates Nearly Unbreakable RF Security, Technological Horizons, Texas Instruments, Inc. (ECN), (Oct. 1996).
Deavours, C. A. and Reeds, James. The Enigma, Part 1, Historical Perspectives, pp. 381-391, Cryptologia, 1(4), (Oct. 1977).
Deavours, C.A. and Kruh, L. ‘The Swedish HC-9 Ciphering Machine’, 251-285, Cryptologia, 13(3): Jul. 1989.
Deavours, Cipher A., et al. ‘Analysis of the Hebern cryptograph Using Isomorphs’, pp. 246-261, Cryptology: Yesterday, Today and Tomorrow, vol. 1, No. 2, Apr. 1977.
Denning, Dorothy E. ‘Cryptographic Techniques’, pp. 135-154, Cryptography and Data Security, 1982. Chapter 3.
Denning, Dorothy E. A Lattice Model of Secure Information Flow, pp. 236-238, 240, 242, Communications of the ACM, vol. 19, No. 5, (May 1976).
Diffie and Hellman, Exhaustive Cryptanalysis of the NB.S Data Encryption Standard, pp. 74-84, Computer, Jun. 1977.
Diffie, Whitfield and Hellman, Martin E. New Directions in Cryptography, pp. 644-654, IEEE Transactions on Information Theory, vol. IT-22, No. 6, (Nov. 1976).
Diffie, Whitfield and Hellman, Martin E. Privacy and Authentication: An Introduction to Cryptography, pp. 397-427, Proceedings of the IEEE, vol. 67, No. 3 (Mar. 1979).
Diffie, Whitfield and Hellman, Martin, E. ‘An RSA Laboratories Technical Note’, Version 1.4, Revised Nov. 1, 1993.
Documents Having Confidential Information Cited by Third Party as Relevant to the Subject Matter (Obtained from Notice Pursuant to 35 U.S.C. .sctn.282, Mar. 4, 2011(NPL22)).
ElGamal, Taher. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, pp. 469-472, IEEE, Transactions on Information Theory, vol. IT-31, No. 4, (Jul. 1985).
ElGamal, Taher. A Subexponential Time Algorithm for Computing Discrete Logarithms, pp. 473-481, IEEE, Transactions on Information Theory, vol. IT-31, No. 4, (Jul. 1985).
Examination Report Under Section 18(3) for GB0502236.3 dated May 23, 2005.
Feistel, Horst, Notz, Wm. A. and Smith, J. Lynn. Some Cryptographic Techniques for Machine-to-Machine Data Communications, pp. 1545-1554, Proceedings of the IEEE, vol. 63, No. 11, (Nov. 1975).
Feistel, Horst. ‘Cryptography and Computer Privacy’, pp. 15-23, Scientific American, vol. 228, No. 5, May 1973.
Fenzl, H. and Kliner, A. Electronic Lock System: Convenient and Safe, pp. 150-153, Siemens Components XXI, No. 4, (1987).
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Sep. 11, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order; Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Notice of Motion and Motion for Leave to File Defendant Lear Corporation's Sur-Reply to Chamberlain's and JCI's Reply Memorandum in Support of Motion for Preliminary Injunction; Mar. 30, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Opposition to Lear Corporation's Motion to Stay the Effectiveness of the Preliminary Injunction Memorandum Opinion and Order Entered Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Response to Lear's Mar. 2, 2007 Supplemental Memorandum.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Response to Lear's Motion for Reconsideration of the Court's Sep. 11, 2006 Ruling Regarding Claim Construction; Oct. 4, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Surreply Memorandum in Opposition to Lear's Motion to Stay the Preliminary Injunction, Apr. 24, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Plaintiffs' Surreply Memorandum in Support of Motion for Preliminary Injunction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Reply Brief in Support of Lear's Motion for Reconsideration of the Court's Sep. 11, 2006 Ruling Regarding Claim Construction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Supplemental Memorandum in Support of Defendant Lear Corporation's Opposition to Plaintiffs' Motion for Preliminary Injunction; Mar. 2, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Deposition of Bradford L. Farris, Jan. 12, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-Cv-3449, Transcript of Deposition of Hubert E Dunsmore, Jan. 12, 2006.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Proceedings Before the Honorable James B. Moran, May 31, 2005.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Transcript of Proceedings Before the Honorable James B. Moran, May 31, 2006.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Brief of Defendant-Appellant Lear Corporation.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Brief of the Chamberlain Group, Inc. and Johnson Controls Interiors LLC; Aug. 8, 2007.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Combined Petition for Panel Rehearing and Rehearing En Banc of Chamberlain Group, Inc. and Johnson Controls Interiors LLC; Dated Mar. 19, 2008.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court for the Northern District of Illinois in Case No. 05-CV-3449, Reply Brief of Defendant-Appellant Lear Corporation, Aug. 29, 2007.
United States Court of Appeals for the Federal Circuit, Appeal from the United States District Court, Northern District of Ilinois in Case No. 05-CV-3449, Appellate Decision, Feb. 19, 2008.
United States Court, Northern District of Illinois, Eastern Division, Civil Action 05 C 3449, Notice Pursuant to 35 U.S.C. 282, Mar. 4, 2011.
United States International Trade Commission in the Matter of Certain Code Hopping Remote Control Systems, Including Components and Integrated Circuits Used Therein; Investigation No. 337-TA-417; Expert Report of Dr. V. Thomas Rhyne; (TCG019919-19959); Partially redacted; Dated Jul. 7, 1999.
United States International Trade Commission, Washington, D., Investigation No. 337-TA-417; Respondents' Answer to Complaint and Notice of Investigation, Jan. 26, 1999.
Voydock, Victor L. and Kent, Stephen T. ‘Security in High-Level Network Protocols’, IEEE Communications Magazine, pp. 12-25, vol. 23, No. 7, Jul. 1985.
Voydock, Victor L. and Kent, Stephen T. ‘Security Mechanisms in High-Level Network Protocols’, Computing Surveys, pp. 135-171, vol. 15, No. 2, Jun. 1983.
Voydock, Victor L. and Kent, Stephen T. Security Mechanisms in a Transport Layer Protocol, pp. 325-341, Computers & Security, (1985).
Watts, Charles and Harper John. How to Design a HiSec.TM. Transmitter, pp. 1-4, National Semiconductor, (Oct. 1994).
Weinstein, S.B. Smart Credit Cards: The Answer to Cashless Shopping, pp. 43-49, IEEE Spectrum, (Feb. 1984).
Weissman, C. Securtiy Controls in the ADEPT-50 Time-Sharing Syustem, pp. 119-133, AFIPS Full Joint Compuer Conference, (1969).
Welsh, Dominic, Codes and Cryptography, pp. 7.0-7.1, (Clarendon Press, 1988).
Wolfe, James Raymond, “Secret Writing—The Craft of the Cryptographer” McGraw-Hill Book Company 1970, pp. 111-122, Chapter 10.
Fischer, Elliot. Uncaging the Hagelin Cryptograph, pp. 89-92, Cryptologia, vol. 7, No. 1, (Jan. 1983).
Fragano, Maurizio. Solid State Key/Lock Security System, pp. 604-607, IEEE Transactions on Consumer Electronics, vol. CE-30, No. 4, (Nov. 1984).
G. Davis, Marcstar.TM. TRC1300 and TRC1315 Remote Control Transmitter/Receiver, Texas Instruments, Sep. 12, 1994. 1-24.
German Patent Application No. 10 2006 003 808.8; Official Action dated Feb. 14, 2019 (with translation of relevant parts); 6 pages.
Godlewski, Ph and Camion P. ‘Manipulations and Errors, Delection and Localization,’ pp. 97-106, Proceedings of Eurocrypt 88, 1988.
Gordon, Professor J., Police Scientific Development Branch, Designing Codes for Vehicle Remote Security Systems, (Oct. 1994), pp. 1-20.
Gordon, Professor J., Police Scientific Development Branch, Designing Rolling Codes for Vehicle Remote Security Systems, (Aug. 1993), pp. 1-19.
Greenlee, B.M., Requirements for Key Management Protocols in the Wholesale Financial Services Industry, pp. 22 28, IEEE Communications Magazine , Sep. 1985.
Guillou, Louis C. and Quisquater, Jean-Jacques. ‘A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory’, pp. 123-128, Advances in Cryptology-Eurocrypt 88, 1988.
Guillou, Louis C. Smart Cards and Conditional Access, pp. 481-489, Proceedings of Eurocrypt, (1984).
Habermann, A. Nico, Synchronization of Communicating Processes , pp. 171 176, Communications , Mar. 1972.
Haykin, Simon, “An Introduction to Analog and Digital Communications” 213, 215 (1989).
IEEE 100; The Authoritative Dictionary of IEEE Standards Terms, Seventh Ediciton, Published by Standards Information Network, IEEE Press, Copyright 2000.
International Search Report for PCT/US03/25308 dated Mar. 25, 2004.
ISO 8732: 1988(E): Banking Key Management (Wholesale) Annex D: Windows and Windows Management, Nov. 1988.
ITC Tutorial; Investigation No. 337-TA-417; (TCG024374-24434); Dated: Jul. 7, 1999.
Jones, Anita K. Protection Mechanisms and the Enforcement of Security Policies, pp. 228-251, Carnegie-Mellon University, Pittsburgh, PA, (1978).
Jueneman, R.R. et al. ‘Message Authentication’, pp. 29-40, IEEE Communications Magazine, vol. 23, No. 9, Sep. 1985.
Kahn, Robert E. The Organization of Computer Resources Into a Packet Radio Network, pp. 177-186, National Computer Conference, (1975).
Keeloq.RTM. Code Hopping Decoder, HCS500, 1997 Microchip Technology, Inc., 1-25.
Keeloq.RTM. Code Hopping Encoder, HCS300, 1996 Microchip Technology, Inc., 1-20.
Keeloq.RTM. NTQ 105 Code Hopping Encoder, pp. 1-8, Nanoteq (Pty.) Ltd., (Jul. 1993).
Keeloq.RTM. NTQ 125D Code Hopping Decoder, pp. 1-9, Nanoteq (pty.) Ltd., (Jul. 1993).
Kent, Stephen T. A Comparison of Some Aspects of Public-Key and Conventional Cryptosystems, pp. 4.3.1-5, ICC '79 Int. Conf. on Communications, Boston, MA, (Jun. 1979).
Kent, Stephen T. Comments on ‘Security Problems in the TCP/IP Protocol Suite’, pp. 10-19, Computer Communication Review, vol. 19, Part 3, (Jul. 1989).
Kent, Stephen T. Encryption-Based Protection Protocols for Interactive User-Computer Communication, pp. 1-121, (May 1976). (See pp. 50-53).
Kent, Stephen T. Protocol Design Consideration for Network Security, pp. 239-259, Proc. NATO Advanced Study Institute on Interlinking of Computer Networks, (1979).
Kent, Stephen T. Security Requirements and Protocols for a Broadcast Scenario, pp. 778-786, IEEE Transactions on Communications, vol. com-29, No. 6, (Jun. 1981).
Kent, Stephen T., et al. Personal Authorization System for Access Control to the Defense Data Network, pp. 89-93, Conf. Record of Eascon 82 15.sup.th Ann Electronics & Aerospace Systems Conf., Washington, D.C. (Sep. 1982).
Konheim, A.G. Cryptography: A Primer, pp. 285-347, New York, (John Wiley, 1981).
Koren, Israel, “Computer Arithmetic Algorithms” Prentice Hall, 1978, pp. 1-15.
Kruh, Louis. Device anc Machines: The Hagelin Cryptographer, Type C-52, pp. 78-82, Cryptologia, vol. 3, No. 2, (Apr. 1979).
Kruh, Louis. How to Use the German Enigma Cipher Machine: A photographic Essay, pp. 291-296, Cryptologia, vol. No. 7, No. 4 (Oct. 1983).
Kuhn, G.J., et al. A Versatile High-Speed Encryption Chip, INFOSEC '90 Symposium, Pretoria, (Mar. 16, 1990).
Kuhn. G.J. Algorithms for Self-Synchronizing Ciphers, pp. 159-164, Comsig 88, University of Pretoria, Pretoria, (1988).
Lamport, Leslie. The Synchronization of Independent Processes, pp. 15-34, Acta Informatica, vol. 7, (1976).
Lear Corporation's Memorandum of Law in Support of Its Motion for Summary Judgment; May 22, 2008.
Linn, John and Kent, Stephen T. Electronic Mail Privacy Enhancement, pp. 40-43, American Institute of Aeronautics and Astronautics, Inc. (1986).
Lloyd, Sheelagh. Counting Functions Satisfying a Higher Order Strict Avalanche Criterion, pp. 63-74, (1990).
Marneweck, Kobus. Guidelines for KeeLoq.RTM. Secure Learning Implementation, TB007, pp. 1-5, 1987 Microchip Technology, Inc.
McIvor, Robert. Smart Cards, pp. 152-159, Scientific American, vol. 253, No. 5, (Nov. 1985).
Meier, Willi. Fast Correlations Attacks on Stream Ciphers (Extended Abstract), pp. 301-314, Eurocrypt 88, IEEE, (1988).
Meyer, Carl H. and Matyas Stephen H. Cryptography: A New Dimension in Computer Data Security, pp. 237-249 (1982).
Michener, J.R. The ‘Generalized Rotor’ Cryptographic Operator and Some of Its Applications, pp. 97-113, Cryptologia, vol. 9, No. 2, (Apr. 1985).
Microchip Technology, Inc., Enhanced Flash Microcontrollers with 10-Bit A/D and nano Watt Technology, PIC18F2525/2620/4525/4620 Data Sheet, 28/40/44-Pin, .COPYRGT.2008.
Microchip v. The Chamberlain Group, Inc., (TCG019794-019873); Deposition of J. Fitzgibbon; Partially redacted; Dated: Jan. 7, 1999.
Microchip v. The Chamberlain Group, Inc., (TCG019874-019918); Deposition of J. Fitzgibbon; Dated: Mar. 16, 1999.
Microchip v. The Chamberlain Group, Inc., Civil Action No. 98-C-6138; (TCG024334-24357); Declaration of V. Thomas Rhyne; Dated: Feb. 22, 1999.
MM57HS01 HiSeC.TM. Fixed and Rolling Code Decoder, National Semiconductor, Nov. 11, 1994, 1-8.
Morris, Robert. The Hagelin Cipher Machine (M-209): Reconstruction of the Internal Settings, pp. 267-289, Cryptologia, 2(3), (Jul. 1978).
Newman, David B., Jr., et al. ‘Public Key Management for Network Security’, pp. 11-16, IEE Network Magazine, 1987.
Nickels, Hamilton, ‘Secrets of Making and Breading Codes’ Paladin Press, 1990, pp. 11-29.
Niederreiter, Harald. Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point, pp. 523-532, Proceedings of Eurocrypt 89, (1989).
NM95HSO1/NM95HSO2 HiSeC.TM. (High Security Code) Generator, pp. 1-19, National Semiconductor, (Jan. 1995).
Otway, Dave and Rees, Owen. Efficient and timely mutual authentication, ACM SIGOPS Operating Systems Review, vol. 21, Issue 1, Jan. 8-10, 1987.
Peebles, Jr., Peyton Z. and Giuma, Tayeb A.; “Principles of Electrical Engineering” McGraw Hill, Inc., 1991, pp. 562-597.
Peyret, Patrice, et al. Smart Cards Provide Very High Security and Flexibility in Subscribers Management, pp. 744-752, IEE Transactions on Consumer Electronics, 36(3), (Aug. 1990).
Postel, J. ed. ‘DOD Standard Transmission Control Protocol’, pp. 52-133, Jan. 1980.
Postel, Jonathon B., et al. The ARPA Internet Protocol, pp. 261-271, (1981).
Reed, David P. and Kanodia, Rajendra K. Synchronization with Eventcounts and Sequencers, pp. 115-123, Communications of the ACM, vol. 22, No. 2, (Feb. 1979).
Reynolds, J. and Postel, J. Official ARPA-Intemet Protocols, Network Working Groups, (Apr. 1985).
Roden, Martin S., “Analog and Digital Communication Systems,” Third Edition, Prentice Hall, 1979, pp. 282-460.
Ruffell, J. Battery Low Indicator, p. 15-165, Eleckton Electronics, (Mar. 1989). (See p. 59).
Saab Anti-Theft System: ‘Saab's Engine Immobilizing Anti-Theft System is a Road-Block for ‘Code-Grabbing’ Thieves’, pp. 1-2, Aug. 1996; http://www.saabusa.com/news/newsindex/alarm.html.
Savage. J.E. Some Simple Self-Synchronizing Digital Data Scramblers, pp. 449-498, The Bell System Tech. Journal, (Feb. 1967).
Schedule of Confidential Non-Patent Literature Documents; Apr. 1, 2008.
Seberry, J. and Pieprzyk, Cryptography—An Introduction to Computer Security, Prentice Hall of Australia, YTY Ltd, 1989, pp. 134-136.
Secure Terminal Interface Module for Smart Card Application, pp. 1488-1489, IBM: Technical Disclosure Bulletin, vol. 28, No. 4, (Sep. 1985).
Shamir, Adi. ‘Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems’, pp. 77-79, Information Processing Letters, 1983.
Shamir, Adi. Embedding cryptographic Trapdoors in Arbitrary Knapsak Systems, pp. 81-85, IEEE Transactions on Computers, vol. C-34, No. 1, (Jan. 1985).
Siegenthaler, T. Decrypting a Class of Stream Ciphers Using Ciphertext Only, pp. 81-85, IEEE Transactions on computers, vol. C-34, No. 1, (Jan. 1985).
Simmons, Gustavus, J. Message Authentication with Arbitration of Transmitter/Receiver Disputes, pp. 151-165 (1987).
Smith, J.L., et al. An Experimental Application of Crptography to a Remotely Accessed Data System, pp. 282-297, Proceedings of hte ACM, (Aug. 1972).
Smith, Jack, ‘Modem Communication Circuits.’ McGraw-Hill Book Company, 1986, Chapter 11, pp. 420-454.
Smith, Jack, ‘Modem Communication Circuits’ McGraw-Hill Book Company, 1986, Chapter 7, pp. 231-294.
Smith. J.L. The Design of Lucifer: a Cryptographic Device for Data Communications, pp. 1-65, (Apr. 15, 1971).
Soete, M. Some constructions for authentication—secrecy codes, Advances in Cryptology—Eurocrypt '88, Lecture Notes in Computer Science 303 (1988), 57-75.
Steven Dawson, Keeloq.RTM. Code Hopping Decoder Using Secure Learn, AN662, 1997 Microchip Technology, Inc., 1-16.
Svigals, J. Limiting Access to Data in an Indentification Card Having a Micro-Processor, pp. 580-581, IBM: Technical Disclosre Bulletin, vol. 27, No. 1B, (Jun. 1984).
Thatcham: The Motor Insurance Repair Research Centre, The British Insurance Industry's Criteria for Vehicle Security (Jan. 1993) (Lear 18968-19027), pp. 1-36.
Transaction Completion Code Based on Digital Signatures, pp. 1109-1122, IBM: Technical Disclosure Bulletin, vol. 28, No. 3, (Aug. 1985).
Turn, Rein. Privacy Transformations for Databank Systems, pp. 589-601, National Computer Conference, (1973).
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, Declaration of Robert Louis Stevenson, Jr., Jun. 26, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Local Rule 56.1 Statement of Undisputed Facts in Support of Their Motion for Summary Judgment of Infringement of the '056 Patent; Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Local Rule 56.1 Statement of Undisputed Facts in Support of Their Motion for Summary Judgment of Infringement of the '544 Patent; Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Memorandum of Law in Support of its Motion for Summary Judgment of Infringement of the '056 Patent, Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Memorandum of Law in Support of its Motion for Summary Judgment of Infringement of the '544 Patent, Jul. 6, 2009.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-C-3449, JCI's Memorandum Opinion and order, Nov. 24, 2010.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Defendant Lear Corporation's Answer to Plaintiffs' Second Amended Complaint, Defenses, and Counterclaim; Sep. 8, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Defendant Lear Corporation's Reply Memorandum in Support of Its Motion to Stay Effectiveness of Any Preliminary Injunction; Apr. 17, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation Memorandum of Law in Support of Its Motion for Summary Judgment of U.S. Pat. No. 7,412,056; Dec. 8, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Answer, Affirmative Defenses and Counterclaims to Plaintiffs' Amended Complaint; Oct. 24, 2005.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Memorandum of Law in Support of Its Emergency Motion to Stay the Effectiveness of the Preliminary Injunction Memorandum Opinion and Order Entered Mar. 30, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Memorandum of Law in Support of Its Motion for Summary Judgment, May 22, 2008.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Motion for Reconsideration of the Court's Sep. 11, 2006 Memorandum Opinion and Order Regarding Claim Construction.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Apr. 25, 2007.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Memorandum Opinion and Order, Feb. 20, 2007.
German Patent Application No. 10 2007 036 647.9; Official Communication dated Jul. 4, 2019, 4 pages.
German Patent Application No. 10 2006 063 085.8; Official Action dated Nov. 7, 2019 (with translation of relevant parts); 14 pages.
German Patent Application No. 10 2006 003 808.3; Official Action dated May 16, 2018; 6 pages.
Access Transmitters-Access Security System', pp. 1-2, Dated Jul. 16, 1997. htpp://www.webercreations.com/access/ security.html.
Beutelspacher, Albrecht. Advances in Cryptology—Eurocrypt 87: 'Perfect and Essentially Perfect Authentication Schemes' (Extended Abstract), pp. 167-170, Federal Republic of Germany, believed to be publicly available prior to Jun. 30, 2004.
Dijkstra, E. W. Co-Operating Sequential Processses, pp. 43-112, Programming Languages, F. Genuys. NY, believed to be publicly available prior to Jun. 30, 2004.
Dijkstra, E.W. 'Hierarchical Ordering of Sequential Processes', pp. 115-138, Acta Informatica 1: 115-138, Springer-Verlag (1971).
Hagelin C-35/C-36 (The), (1 page) Sep. 3, 1998. http://hem.passagen.se/tan01/C035.HTML.
Massey, James L. The Difficulty with Difficulty, pp. 1-4, Jul. 17, 1996. http://www.iacr.org/conferences/ec96/massey/html/framemassey.html.
U.S. District Court, Northern District of Illinois, Eastern Division, Civil Action No. 05-CV-3449, Lear Corporation's Post-Markman Brief; Dated Jun. 15, 2006.
U.S. Appl. No. 15/674,069; Office Action dated May 8, 2020, (pp. 1-9).
First Examination Report, from Australian Application No. 2019240615, dated Aug. 13, 2020; 4 pages.
U.S. Appl. No. 15/674,069; Notice of Allowance dated Sep. 30, 2020; (pp. 1-12)
Related Publications (1)
Number Date Country
20160021140 A1 Jan 2016 US
Continuations (1)
Number Date Country
Parent 11172525 Jun 2005 US
Child 14867633 US