CA1337946C - Access control equipment - Google Patents

Access control equipment

Info

Publication number
CA1337946C
CA1337946C CA000594391A CA594391A CA1337946C CA 1337946 C CA1337946 C CA 1337946C CA 000594391 A CA000594391 A CA 000594391A CA 594391 A CA594391 A CA 594391A CA 1337946 C CA1337946 C CA 1337946C
Authority
CA
Canada
Prior art keywords
interrogation
transponder
transponders
signals
unit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CA000594391A
Other languages
French (fr)
Inventor
Brian John Stanier
Harold Dodd
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Identec Ltd
Original Assignee
SATELLITE VIDEO SYSTEMS Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from GB8707162A external-priority patent/GB2188476B/en
Priority to AT88302888T priority Critical patent/ATE110480T1/en
Priority to EP88302888A priority patent/EP0285419B1/en
Priority to DE3851168T priority patent/DE3851168T2/en
Priority to GB8807742A priority patent/GB2202981B/en
Application filed by SATELLITE VIDEO SYSTEMS Ltd filed Critical SATELLITE VIDEO SYSTEMS Ltd
Priority to CA000594391A priority patent/CA1337946C/en
Priority to US07/674,655 priority patent/US5339073A/en
Priority claimed from US07/674,655 external-priority patent/US5339073A/en
Publication of CA1337946C publication Critical patent/CA1337946C/en
Application granted granted Critical
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/10009Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
    • G06K7/10019Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
    • G06K7/10029Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
    • G06K7/10039Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot interrogator driven, i.e. synchronous
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G06K17/0022Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/0008General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07CTIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00Individual registration on entry or exit
    • G07C9/20Individual registration on entry or exit involving the use of a pass
    • G07C9/28Individual registration on entry or exit involving the use of a pass the pass enabling tracking or indicating presence
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07CTIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00Individual registration on entry or exit
    • G07C9/20Individual registration on entry or exit involving the use of a pass
    • G07C9/29Individual registration on entry or exit involving the use of a pass the pass containing active electronic elements, e.g. smartcards

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Toxicology (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Health & Medical Sciences (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • General Engineering & Computer Science (AREA)
  • Radar Systems Or Details Thereof (AREA)

Abstract

Access control equipment comprises an inter-rogation unit (IU) having means (14) for emitting an interrogation signal, and a plurality of transponders (e.g. T), each transponder having a stored identity code different from that of the other transponders.
This identity code comprises a plurality of fields each holding a selected information bit. The interrogation signal is controlled so as simultaneously to interrogate the fields of all transponders within range in a serial manner. A group reply signal is sent back to the inter-rogation unit from any transponder having, in the field being interrogated, a bit matching that required by the interrogation signal. The interrogation unit is arranged to determine, from the series of received reply signals, the identity of each and every valid transponder within range.

Description

~ _ 1 337946 ACCESS CONTROL EOUIPMENT

The present invention concerns access control equipment, that is electronic equipment designed to restrict unauthorised access to stored or transmitted data or to secure premises.
The control of such access is frequently afforded by the use of an interrogation unit and a transponder. At its simplest, the interrogation unit transmits an enquiry signal which may be received by any transponder within its range. The transponder is designed to modify the received signal in a 10 predetermined manner and then retransmits the modified signal for reception by the interrogation unit. The modifying of the signal may be such as simply to distinguish between any "authorised" transponder and an unauthorised one or may be characteristic of the specific transponder alone, in which latter case the modified signal received by the interrogation unit identifies that transponder and no other.
Thus, if the transponder is carried by a person, vehicle, animal or piece of equipment then the interrogation unit is enabled to permit or reject access of a specific person 20 or vehicle to controlled premises or to control access of a person or equipment to stored data. For example, when the equipment is capable of receiving transmitted data, it may be permitted to do so only when it has been identified or authorised by a correctly responding transponder.
Many systems of operating such equipment are known.
For example, the interrogation unit may permanently or at intervals create a signal or field that will cause any transponder within range to identify itself. In a second system, any transponder coming within range will be caused to 30 transmit an identifying signal to the interrogation unit. In a further alternative a transmission is initiated from the transponder and the interrogation unit processes the information so conveyed.
In such systems there is generally no problem in making 35 a positive identification of a particular transponder, so long as that transponder is the only one within range of the _ 2 interrogation unit, or the only one signalling the interrogation unit at a given time. Unless one of these criteria is met, then there can be difficulties in resolving the signals from the responders.
A further difficulty arises when the system protocol is such as to cause a transponder to transmit its same identifying signal more than once when traversing any interrogation field.
Under these circumstances, the signal could be monitored by an unauthorised person, and thereafter reproduced in order to gain illicit access.
The present invention seeks to avoid these difficulties.
In accordance with this invention, there is provided access control equipment comprising an interrogation unit 15 having means for emitting an interrogation signal, and a plurality of transponders having means for receiving the interrogation signal, each transponder having a stored identity code different from that of the other transponders, the identity code comprising a plurality of fields each holding an information bit selected from a plurality of possible bits, - means for controlling the interrogation signal so that it simultaneously interrogates the fields of all transponders within range in a serial manner, means for sending a group reply signal to the interrogation unit from any transponder 25 having in the field being interrogated a bit matching that required by the interrogation signal, and means in the interrogation unit for converting the series of group reply signals to the encrypted identification codes of those transponders within range.
It will be seen that the equipment can operate irrespective of the number of transponders within range. The interrogation unit will analyse the series of group reply signals and will be informed by those signals of the identity codes of those transponders present. The responses are thus 35 unable to interfere, and there is clear resolution of the signals. Furthermore, it will be appreciated that a transponder only transmits an identity code once in one whole interrogation sequence. Further interrogation requires a different identity code from the same transponder thus _ 3 rendering it extremely difficult for an unauthorised person successfully to monitor and decipher that code. During most of the sequence each transponder simply sends a group reply signal.
Preferably each identity code is a binary word, each field comprising one bit, either 0 or 1. Other codes could be used, but binary is clearly the simplest. The interrogation and response sequence is preferably computer controlled, both in the interrogation unit and in the transponder, and binary identity logic obviously simplifies such control.
All responders sending a group reply signal in response to interrogation of a particular field will do so simultaneously, desirably with an identical signal. It would be possible to have the responders reply serially, each with 15 a different signal falling within a group but this is not as rapid a method as simultaneous reply.
When binary logic is used, the transponders are effectively divided into classes and sets, and the interrogation is effectively a binary tree search.
An embodiment of this invention will now be described by way of example only and with reference to the accompanying drawings, in which:
FIGURE 1 is a diagrammatic block diagram of access control equipment, showing an interrogation unit and one of a 25 plurality of transponders of the equipment;
FIGURE 2 is a diagram to illustrate a tree search form of the interrogation process where only one transponder is present in the field of the interrogation unit;
FIGURE 3 is a similar diagram to illustrate the tree 30 search when two transponders are present;
FIGURE 4 is a diagram to illustrate the data exchange for a 16-bit identifying code of the transponder;
FIGURE 5 is a similar diagram to illustrate the data exchange when a new 16-bit seed is transmitted on each search;
35 and FIGURE 6 is a similar diagram but where the transponder is arranged to return a hidden transponder code at the end of the search.
Referring to Figure 1, there is shown an access control equipment comprising an interrogation unit IU and a plurality of transponders, which may be in the form of tags, one only being shown at T. The interrogation unit IU comprises a microprocessor 10 one function of which is to generate interrogation signals and apply these to a pulse length modulator 12, which applies the modulated signals to a transmitter 14. The transmitter includes a coil for inductively coupling with a coil of a receiver 20 of the transponder or tag T. Receiver 20 of the transponder applies 10 its received signal to a demodulator 22, the demodulated signal being applied to a microprocessor 24. This is able to refer to a memory 26 containing an identifying code of the transponder. The microprocessor 24 determines when a reply is to be made, in which case it provides a reply signal to a phase shift modulator 28 driving a transmitter 30. A coil of this transmitter is inductively coupled with a coil of a receiver 16 of the interrogation unit and a demodulator 18 serves to recover the reply signal and pass this to the microprocessor 10 of the interrogation unit for decoding and identifying the 20 transponder or transponders within range. The transmitting channel from the interrogation unit to the transponders may typically operate at 132 kHz and the reply channel may typically operate at 66 kHz.
The identifying code of each transponder may simply 25 comprise a binary word. In use, the interrogation unit conducts a search by simultaneously interrogating the bits of all transponders within range in a serial manner. If any one or more transponders within range has a bit of pre-determined value (e.g. 1) at the interrogated position in the binary word, 30 that transponder (or those transponders) will transmit a reply simply to indicate this. Then the search proceeds by interrogating another position in the binary word to see if any transponder within range has a bit of predetermined value at that position, and so on. By decoding the reply signals 35 received from this succession of interrogations, the microprocessor 10 in the interrogation unit can determine the identifying code of each transponder which is within range.
The interrogation process may take the form of a binary tree search. For example, in Figure 2 a single transponder with code 5 is assumed to be present. The identification commences by enquiring whether the transponder is a member of set (1,2,3,4) or set (5,6,7,8). The transponder responds to the latter and sends a first group reply signal. At level two 5 of the search the choice is between (5,6) or (7,8) and (5,6) and is identified whereupon a second group reply signal is sent. Finally, the transponder is recognised as (5) after the sending of a third group reply signal and analysis by the interrogation unit. It may be convenient to regard the 10 transponder identity as a binary number and each level of the search establishing 1 bit of the number. An n-bit number requires an n-level search and can identify 1 of 2n transponders.
Only one interrogation is actually needed to establish 15 to which set a single transponder belongs to each level. So n levels need n interrogations. Even for small n the search time is better than or equivalent to a simple polling of every single transponder identity code, but for higher values of n the saving becomes very large. For example, identification of 1 transponder from 65536 is possible with just 16 interrogations.
The simple search outlined above for a single transponder needs to be modified if multiple transponders are present. Every member of a set must respond to the IU when interrogated. This has three implications.
(a) If more than one member of a set is present all will respond. To avoid conflict they must either send identical replies simultaneously (so that the IU sees only one effective reply) or they may send different replies in sequence. The former is faster and does not require any timing or arbitration scheme.
(b) One or more transponders may be present in both sets at a tree level. It is then necessary to have two effective interrogations at each level instead of the single interrogation which was adequate for the single transponder case.
(c) The IU must remember when members of both sets at a given level are present and search both branches of the tree from that node to identify all the transponders present.

Figure 3 shows a possible search route for the case where both transponder 5 and transponder 8 are present.
The simplest (and fastest) tree search requires that the IU sends an interrogation data word whose length is the 5 minimum needed to identify the search level. At level 1 only 1 bit is needed. Level 2 needs 2 bits etc. The final level requires an n-bit word.
In principle the reply need only be a 1-bit word at any and every level. However it is preferable for the transponder 10 to do some processing of the incoming data and a 4-bit reply is a suitable compromise between speed and complexity. Very little time can be allowed between receipt of the incoming data and the appropriate reply to avoid impeding the search and a simple pseudo-random sequence generation process yielding the 4-bit reply is an adequate compromise between speed and security at this stage. this form of data exchange is shown in Figure 4 for the example of a 16-bit tag code.
For security it is desirable that the transponder replies differ on successive searches. A simple way of ensuring 20 this is to provide a new seed for the pseudo-random sequence generation at the beginning of each search. The seed would be generated by the IU (and could itself be part of a pseudo-random sequence). Transmission of (say) a 16-bit seed can replace the 1st level interrogation. This word can also be 25 used as a synchronising signal to the transponder(s) for the start of a search.
The search pattern then becomes as shown in Figure 5.
Note that the interrogation words for levels 2-16 can be reduced by 1 bit.
The transponder identity code revealed by the tree search is not in itself secure. It (or something equivalent to it) could possibly be deduced from a study of the search pattern and the corresponding replies. The security at this stage comes from the correct electronic and numerical forms of 35 the replies and their relation to the interrogation data as determined by the transponder processor program. This is effectively the group reply signals and the code may be termed the public transponder identity code.
Further security is provided by a verification procedure in which a transponder replies to the final interrogation with a 16-bit reply (say) generated from the seed provided at the beginning of the search and an internally stored or hidden 16-bit code (say) and possibly from the public 5 transponder identity code. According to the stored algorithm this can only occur at the last search level because only then can no more than one transponder reply at a time.
The hidden code is derived from the public transponder code and a system key or code by any suitable algorithm. The 10 IU could then regenerate the proper hidden code and the appropriate transponder identified by the search.
The use of a key in the latter method allows customising a transponder set to a particular installation.
For example, if the key is a 16-bit number then the total 15 effective transponder code becomes 32 bits i.e. 4 x 109 different transponder identities. (65536 transponders in each of 65536 installations).
Figure 6 shows the information exchange for a typical single transponder search including the initial seed 20 transmission and the final hidden transponder identity verification. The total data transmission to the transponder in this example requires 136 bits and the replies need 152 bits in this case.
The public and hidden transponder identities are held in the memory 26 of each transponder and are programmable. At initial power-up during manufacture, the identity codes will be set to some known values.
Programming after manufacture, and at any subsequent time, may be accomplished by transmitting the new identity 30 codes to a transponder using an extension of the data exchange protocol outlined above.
For security reasons the programming messages are only accepted by a transponder immediately following a successful search and verification procedure and must contain sufficient 35 error detection to avoid false programming.
The transponders utilised in the invention are desirably encapsulated transponders as described in GB-A-2164825 (British patent application published March 26, 1986), but utilising either a microchip processor and memory or -customised large scale integrated circuits instead of the logic elements shown in that document. Each transponder may or may not incorporate its own battery, but if a battery is incorporated the transponder is capable of switching from and 5 to a standby, power conserving mode in response to the presence or absence of a signal from the interrogation unit.
It will be appreciated that in the equipment described, the interrogation unit uniquely identifies each and every valid transponder present within the range during one complete interrogation cycle. Preferably, as described above, the transponder reply signals differ on successive interrogation cycles and on successive search steps within each cycle, being encrypted according to a different control code (the seed) transmitted at the beginning of each cycle.

9 l 337946 For security reasons the progr~mming mess~ges are only accepted by a transponder immerli~t~ly following a successful search and verification procedure and must contain sufficient error detection to avoid false progr~mm1ng.
The transponders lltili7e~1 in the invention are desirably encapsulated transponders as described in GB-A-2164825 (British patent application published March 26, 1986), but ~1tili7ing either a microchip processor and memory or customized large scale integrated circuits in~te~l of the logic elements shown in that docllm~nt Each transponder may or may not incorporate its own battery, 0 but if a battery is incorporated the transponder is capable of switching from and to a standby, power conserving mode in response to the presence or absence of a signal from the interrogation unit.
It will be appreciated that in the equipment described, the interrogation unit uniquely i~entifies each and every valid transponder present within the range during one complete interrogation cycle. Preferably, as described above, the transponder reply signals differ on successive interrogation cycles and on successive search steps within each cycle, being encrypted according to a dirrerent control code (the seed) transmitted at the beginning of each cycle.

~, ,,

Claims (3)

1) Access control equipment comprising an interrogation unit and a plurality of transponders, the interrogation unit being arranged to determine the identity or identities of any transponder or transponders present within a detection range of the interrogation unit, the interrogation unit having means for transmitting successive cycles of interrogation signals, each transponder storing an identity code different from those of the other transponders, said identity code comprising a plurality of fields holding information bits, and each transponder having means for receiving the interrogation signals from the interrogation unit and transmitting reply signals in response thereto, in which each said cycle of interrogation signals transmitted by the interrogation unit are controlled to interrogate simultaneously all transponders within said detection range in a serial, field-by-field manner, the transponders are arranged to send group reply signals in response to each interrogation signal if they have, in the field being interrogated by said interrogation signal, bit values matching those required by the interrogation signal, so that the group reply signals which are transmitted in response to successive interrogation signals of each cycle indicate to the interrogation unit to which of successively smaller groups of identity codes the transponders belong, and the interrogation unit is arranged to determine, from the succession of group reply signals which it receives in response to each cycle of interrogation signals, the identity code of the or each transponder which is present within the detection range, and is also arranged such that the group reply signals sent by the or each transponder differ on successive interrogation cycles.
2) Access control equipment as claimed in claim 1, in which the reply signals of the or each transponder are encrypted according to a different control code transmitted by the interrogation unit at the beginning of each said cycle of interrogation signals.
3) Access control equipment as claimed in claim 2, in which a said transponder within said detection range is arranged to reply to a final interrogation signal of each said cycle with an encoded signal generated from said control code transmitted at the beginning of the interrogation cycle and from a further identification code and an algorithm both stored by that transponder.
CA000594391A 1987-03-25 1989-03-21 Access control equipment Expired - Fee Related CA1337946C (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
EP88302888A EP0285419B1 (en) 1987-03-31 1988-03-30 Access control equipment
AT88302888T ATE110480T1 (en) 1987-03-31 1988-03-30 ACCESS CONTROL DEVICE.
DE3851168T DE3851168T2 (en) 1987-03-31 1988-03-30 Access control device.
GB8807742A GB2202981B (en) 1987-03-31 1988-03-31 Access control equipment
CA000594391A CA1337946C (en) 1987-03-25 1989-03-21 Access control equipment
US07/674,655 US5339073A (en) 1987-03-31 1991-03-25 Access control equipment and method for using the same

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
GB8707162A GB2188476B (en) 1986-03-28 1987-03-25 Piano-type musical instrument
CA000594391A CA1337946C (en) 1987-03-25 1989-03-21 Access control equipment
US07/674,655 US5339073A (en) 1987-03-31 1991-03-25 Access control equipment and method for using the same

Publications (1)

Publication Number Publication Date
CA1337946C true CA1337946C (en) 1996-01-16

Family

ID=27168248

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000594391A Expired - Fee Related CA1337946C (en) 1987-03-25 1989-03-21 Access control equipment

Country Status (1)

Country Link
CA (1) CA1337946C (en)

Similar Documents

Publication Publication Date Title
EP0285419B1 (en) Access control equipment
EP1088284B1 (en) Anti-collision tag apparatus and system
EP0696011B1 (en) Apparatus and method for identifying multiple transponders
US6456191B1 (en) Tag system with anti-collision features
US5929801A (en) Method for repeating interrogations until failing to receive unintelligible responses to identify plurality of transponders by an interrogator
US7486172B2 (en) Enhanced identification protocol for RFID systems
US5543798A (en) Method of providing a synchronized data stream suitable for use in a combined FDX and HDX RF-ID system
US6876294B1 (en) Transponder identification system
DE69321073D1 (en) Capture a variety of items
WO2004032025A1 (en) Rfid system and method including tag id compression
WO2009088153A1 (en) Tag identification method, tag anti-collision method, rfid tag
GB2259227A (en) Improvements in or relating to transponders
US4075631A (en) System for identifying objects equipped with an automatic transponder
KR100689048B1 (en) Encoding/decoding system for coherent signal interference reduction
US7102488B2 (en) Method for selecting transponders
US5101208A (en) IFF authentication system
US5883592A (en) Method and apparatus for remotely identifying an electronically coded article
CA1337946C (en) Access control equipment
EP0831618B1 (en) Improvements in or relating to information/data transfer systems
CA2266337C (en) Tag system with anti-collision features
US7246237B2 (en) Method and device for the generation of several channels in an IFF type system
KR100300264B1 (en) Transmitter, system for remotely recognizing electrically encoded articles, and method therefor
JP2002516499A (en) Electronic system for identifying multiple transponders
JP2000076396A (en) Method and system for multiple reading for dynamic set of tag by synchronization of communication between tag and reader

Legal Events

Date Code Title Description
MKLA Lapsed