WO1998021685A2 - Analyseur de corbeille d'achat - Google Patents

Analyseur de corbeille d'achat Download PDF

Info

Publication number
WO1998021685A2
WO1998021685A2 PCT/DE1997/001565 DE9701565W WO9821685A2 WO 1998021685 A2 WO1998021685 A2 WO 1998021685A2 DE 9701565 W DE9701565 W DE 9701565W WO 9821685 A2 WO9821685 A2 WO 9821685A2
Authority
WO
WIPO (PCT)
Prior art keywords
transponders
transponder
numbers
time
request
Prior art date
Application number
PCT/DE1997/001565
Other languages
German (de)
English (en)
Other versions
WO1998021685A3 (fr
Inventor
Rainer Glaschick
Joachim Burchart
Günter Baitz
Original Assignee
Siemens Nixdorf Informationssysteme Ag
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
Application filed by Siemens Nixdorf Informationssysteme Ag filed Critical Siemens Nixdorf Informationssysteme Ag
Priority to EP97935477A priority Critical patent/EP0937290A2/fr
Priority to JP52200598A priority patent/JP2001504608A/ja
Publication of WO1998021685A2 publication Critical patent/WO1998021685A2/fr
Publication of WO1998021685A3 publication Critical patent/WO1998021685A3/fr

Links

Classifications

    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07FCOIN-FREED OR LIKE APPARATUS
    • G07F7/00Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
    • G07F7/02Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by keys or other credit registering devices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/067Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components
    • G06K19/07Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips
    • G06K19/0723Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips the record carrier comprising an arrangement for non-contact communication, e.g. wireless communication circuits on transponder cards, non-contact smart cards or RFIDs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K19/00Record carriers for use with machines and with at least a part designed to carry digital markings
    • G06K19/06Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
    • G06K19/067Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components
    • G06K19/07Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips
    • G06K19/077Constructional details, e.g. mounting of circuits in the carrier
    • G06K19/07749Constructional details, e.g. mounting of circuits in the carrier the record carrier being capable of non-contact communication, e.g. constructional details of the antenna of a non-contact smart card
    • 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
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/30Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/34Payment architectures, schemes or protocols characterised by the use of specific devices or networks using cards, e.g. integrated circuit [IC] cards or magnetic cards
    • G06Q20/343Cards including a counter
    • GPHYSICS
    • G07CHECKING-DEVICES
    • G07GREGISTERING THE RECEIPT OF CASH, VALUABLES, OR TOKENS
    • G07G1/00Cash registers
    • G07G1/0036Checkout procedures
    • G07G1/0045Checkout procedures with a code reader for reading of an identifying code of the article to be registered, e.g. barcode reader or radio-frequency identity [RFID] reader

Definitions

  • the invention relates to the automatic detection of goods arranged arbitrarily in a shopping cart.
  • EP 0 281 142 B1 For the identification of individual objects, a system is proposed in EP 0 281 142 B1, in which a transponder is fastened to the objects and is queried by a verifier. However, it is assumed that there is only a maximum of one transponder in the test field.
  • EP 0 181 327 B1 shows a resonance tag which is passively recognized by field weakening.
  • Texas Instruments offers a transponder system under the name TIRIS. This system works without a battery in the transponder.
  • the tester generates a high-frequency field of 134.2 kHz for 50 ms, which is rectified in the transponder and charges a capacitor. The energy stored in it is used to transfer a data packet of 128 bits back in 20ms after a synchronization pause of 20ms. For the correct functioning of the system it is also with This system requires that only one transponder is available within the antenna range.
  • the transmission pulse contains data signals that contain address information.
  • the transponder only reacts if the address information matches the address information stored in it. This means that there can be more than one transponder in the antenna range.
  • the control unit of the tester must test the possible addresses, one after the other. This procedure only makes sense if the number of possible addresses is small or only one address is needed at all. The method is unusually long for the detection of a small, non-predeterminable subset of perhaps a maximum of 50 transponders out of a total of several thousand.
  • the object of the invention is to provide a transponder system in which a plurality of transponders of a large total amount can be present in the antenna range and yet, without changing the transponders locally, at least detect the presence of each of the transponders in a shorter time than by trying out the total possible amount .
  • 1 is a circuit diagram of a transponder
  • Fig. 2 shows an arrangement of the elements of a transponder in printed circuit technology. Detailed description of the invention
  • the goods receive a label that is equipped with a sending and receiving device and a data processing device. Such an arrangement is referred to as a transponder if it sends out a response to a signal from a tester.
  • the commodity number used in the following is not a commodity number like the well-known EAN code in the context of the following description, but a number that numbers the individual piece to be sold so that several pieces can also be distinguished.
  • FIG. 1 The basic circuit of such a transponder is shown schematically in FIG. 1 and a possible embodiment in printed circuit technology in FIG. 2.
  • a coil L and a capacitor C form an oscillating circuit, the coil L being designed as a planar conductor coil on an insulating base plate BP.
  • An integrated circuit IS is placed on this coil at the contact points KO, K1 and K2, the connection points of which are connected to the coil, for example with conductive adhesive.
  • Connection point KO is the reference potential.
  • a resonance capacitor C and a damping resistor Rr are connected to terminal Kl.
  • Connection point K2 supplies, via a diode D, a supply voltage buffered by a capacitor Cs for an amplifier V and a processor unit ⁇ C.
  • Connection point K2 is designed as a tap so that the resonance circuit is not excessively damped; however, it can also be omitted, so that the diode D is connected to the terminal.
  • An AC signal is also picked up at one of the two connections, which signal is amplified by the amplifier V, rectified if necessary and evaluated by the processor ⁇ C.
  • the processor ⁇ C in turn, can provide a damping resistor Rr to the resonant circuit via a transistor Tr connect in parallel. Instead of the damping resistor Rr, a capacitor can also be used, so that the resonant circuit is not damped but detuned.
  • the processor ⁇ C can be designed, for example, as a customer-specific circuit (ASIC) or as a hybrid module using commercially available modules.
  • connection Kx is also shown, with which a goods number can be programmed. For this purpose, the connection is repeated many times; only three are shown in FIG. 2 for the sake of clarity.
  • Y By cutting the connection indicated by Y, a binary word is transferred to the processor ⁇ C.
  • This programming is used when the IS circuit is manufactured in identical pieces and has a simple, non-programmable structure. If the circuit IS can be individualized by means of electrically programmable cells, for example in an electrically programmable read-only memory (EPROM), only the one connection Kx is required. Since the individualization can take place before the connection of the integrated circuit IS to the base plate BS, the connection shown in FIG. 2 with the reference potential in the installed state is also useful.
  • a tester (not shown) sends an alternating electromagnetic field, the frequency of which is the resonant frequency, for example 4.7 MHz, of the resonant circuit formed by L and C. Then an alternating voltage forms at the tap K2, which on the one hand charges the capacitor Cs via the diode D.
  • this capacitor can also be designed as a high-capacitance gold foil capacitor and can be connected in a known manner externally from the IS via additional conductor tracks.
  • the circuits V and ⁇ P which are designed for low power consumption in CMOS technology, begin to work.
  • the processor ⁇ P recognizes that an alternating field is present. If the tester interrupts or modulates the alternating field, the processor ⁇ P recognizes these changes. For example, brief interruptions in the transmission field serve as bits of serial data transmission using the asynchronous method. The supply voltage is maintained due to the buffering effect of the capacitor. It is only necessary to provide sufficient times before and, if necessary, between the characters of the asynchronous transmission in order to obtain a sufficient operating voltage.
  • a simple solution is to send each byte twice in succession, inverting each bit for the second transmission. The start bit is an interruption, the stop bit or s are no interruptions, so that a duty cycle of 50% is achieved. Amplitude modulation instead of blanking is also possible.
  • MFM modified frequency modulation
  • GRC group recording codes
  • the tester Following a transmission from the tester to the transponder, the tester maintains the transmission field constantly, but monitors the strength of the transmission field.
  • the transponder now switches the damping resistor Rr to the resonant circuit through the transistor Tr. This weakens the field. In particular, this can take place at a regular frequency of, for example, 120 kHz, which is Can be more easily filtered through AC amplifiers.
  • bit signals are transmitted by known methods such as the asynchronous method, which then allow, for example, a data rate of 12 kbaud.
  • the lower retransmission bandwidth is not disadvantageous in the method to be used.
  • the transponder can take energy from the high-frequency field by means of the antenna and store it in the storage capacitor Cs. After the tester has been switched off, the circuit in the transponder feeds itself from the storage capacitor and in turn sends out data signals.
  • an output connection of the processor ⁇ C is connected directly to the contact Kl and thus to the resonant circuit and can thus excite the resonant circuit to vibrate. Circuits for this with or without using the tap are generally known.
  • This oscillation circuit can be excited at the same frequency on which the transponder was addressed, so that a high data transmission rate is possible.
  • the amount of data that can be transferred is limited by the storage capacity of the capacitor, whose energy must be sufficient to send the entire amount of data.
  • transponder If there are several transponders in the transmitter field of a tester, this is possible without any problems in the direction of transmission from the tester to the transponder. It is only necessary to ensure that the coils of the transponders are not so closely coupled that a resonance shift occurs. In particular, the spools of the labels must not lie on top of one another. In the case of application to a shopping cart, the simplest solution is to provide a compartment division there and to place only one marked item in each compartment. Alternatively, the transponder can be covered with neutral material so that the required minimum distance is maintained becomes. The energy of a transmission field of sufficient size, which safely includes a shopping cart, can easily supply several transponders with an energy requirement of, for example, 100 ⁇ W each. All transponders receive the same data pattern. A collision occurs only when the return channel is used, which acts in the sense of a switched oration.
  • the processor module can be constructed very simply as a customer-specific circuit (ASIC), which essentially consists of a shift register with the number of bits corresponding to a commodity number and a comparator of the same width, as well as some reset and delay circuits of a known type If the number received is identical to the coded commodity number, the output signal is activated. With a few possible commodity codes, this method is cheap because it is very simple and the time for the return channel is short.
  • ASIC customer-specific circuit
  • a first solution uses a modification of the Aloha process.
  • the problem in the Aloha network is that several transmitters independently of one another want to reach a common receiver, which functions as an echo relay, without explicit synchronization of the transmitters being possible. This poses the problem of the collision of the signals emitted by the various transmitters.
  • the solution of the Aloha network is to provide the transmitter's data packets with redundancy and to expect an acknowledgment from the receiving relay station. That remains
  • Random backup made a new attempt to send.
  • the Aloha network appears to be unusable at all, because there one receiver faces several transmitters with regard to collisions, while in the invention a testing transmitter faces several transponder receivers.
  • a closer look reveals, however, that the collisions occur during the return, in which the verifier acts as the receiver and the transponder as the transmitter.
  • the use of the Aloha method is problematic, since a collision of several transmitters in the Aloha network is the exception because the transmitters do not begin to transmit in a correlated manner.
  • the tester's signal triggers the transmission signals in the transponders, which all correlate with them, namely begin transmission at the same time.
  • the process for a first solution using the Aloha process begins with the verifier switching on the field signal and thus supplying the transponders with energy.
  • switching on the field signal already serves as a request;
  • this field signal is also used to transmit messages to the transponders.
  • the messages are encoded in such a way that at least one of the codes has the effect of the general query to be described below.
  • the field is switched off again before the transponder replies or not depends on the transmission method used for the retransmission. As soon as a transponder is ready for operation, the time for possible retransmissions has been reached and a random waiting time has been waited, it sends its commodity code on the return channel.
  • the goods numbers are protected by a known code with error detection. All correctly recognized goods numbers are recorded in a list by the verifier. After the longest waiting period, when no more responses arrive, a request is sent again. The transponders in turn respond with their commodity numbers, but in a different order due to the random waiting time of the random generators. This will correctly transfer other commodity numbers and add them to the list. As soon as the list of commodity numbers remains unchanged, it is assumed that all commodities have been entered and the checkout process is initiated. If the field signal is accepted as a request, there must be a waiting time between two transmissions and at least be recognizable by the processor on the transponder.
  • the waiting time can be dimensioned such that all transponders have become deenergized and do not distinguish the reactivation of the energy from the first activation.
  • the advantage of this arrangement is that it is special Simplicity.
  • the amplifier is omitted; all that is required as processor ⁇ C is a clock generator, a reset circuit and a shift register which is loaded with the goods number and acts on the transistor Tr bit by bit in the fixed clock.
  • Another feedback shift register generates a pseudo-random sequence in a known manner and thus a random waiting time per transponder.
  • a combinatorial network is used to generate and send an error-recognizable code from the goods number programmed via the external connections. The use of an error-correcting code is possible, albeit at a higher cost, although there is still a risk of incorrect error correction.
  • each transponder can be expanded in such a way that it also detects the weak fields of other transmitting transponders and thereupon does not begin to transmit despite the expiry of the random time. Since another transponder is transmitting, the verifier will definitely make another request, so that the transponder will be queried again in any case. Furthermore, the transmitting transponder can detect collisions, especially when coding by carrier blanking, if an adjacent transponder transmits, even though the transponder detecting the collision wanted to cause a transmission pause. The losing transponder then cancels the shipment. These two measures can drastically reduce the number of harmful collisions. However, since this results in a priority for commodity numbers with many one bits in the binary-coded form, there is a significant risk in the simple implementation that transponders are not recognized, so that these variants are preferably used with the further training courses.
  • each transponder can at least temporarily store a cancellation bit. This is easily possible as long as the operating voltage is maintained in the storage capacitor. If the verifier now sends the list of the already recognized commodity numbers at the beginning of the request, each transponder can determine by comparison that his commodity number has already been recognized. With this, he sets a memory bit and no longer replies with the transmission of his goods number. The number of transponders competing for the transmission channel or channels thus decreases with each attempt. In particular, a quick and reliable end criterion is given by the fact that no transponder reacts to the request. The only disadvantage is that the complete list of recognized transponders must be transmitted each time. Another disadvantage is that an incorrectly recognized commodity number is not deleted and thus a non-existent commodity would be collected.
  • the method is supplemented in that a verification phase is carried out after the detection phase.
  • the verifier sends out all goods numbers individually with a note that a receipt is required. Each addressed transponder acknowledges the goods number. If the receipt is missing, then the item number is incorrectly recognized as being present.
  • the processors in the transponders query the storage capacitor. If there is a charge on the capacitor, this transponder no longer takes part in the response to the unspecific query, which increases the probability of detection. If necessary, the charge in the capacitor is refreshed so that further queries can be made. After several runs, all goods are then recorded.
  • An integrated capacitor can also serve as the storage capacitor, as is known from dynamic digital memories or from the memory elements referred to as EEPROM or EAROM.
  • a second storage capacitor can also be provided, which supplies only one CMOS memory cell, which can then store the cancellation over a long period of time.
  • the tester gives a start signal by briefly weakening the field, which causes the transponders to transmit.
  • This variant can be used in particular if the return channel from the transponder to the verifier is designed by field weakening. Since the tester continues to transmit energy to the transponders, the period in which the transponders send their data can be longer than in the cases where the energy is stored in a capacitor in the transponder.
  • the start signal can of course not only consist of a single bit in the form of a field weakening, but also as the end of a predetermined bit sequence of the message from the reviewer, which serves as a transmission release for the transponders.
  • An alternative variant divides the time after the transmission into time slots and assigns each transponder accordingly one of these time slots according to its commodity code.
  • a transponder then counts the time slots and transmits in the assigned time slot.
  • the transponder uses the frequency of the transmission field as a time base and uses field weakening or a much lower frequency as the response.
  • a one-out-of-n code is used, where n is the number of possible transponders. It is used as a binary word of, for example, 5000 bits for 5000 article numbers. With the specified data rate of 12 kBps in the return channel, all transponders can be identified within half a second.
  • this method is sensitive to individual interference pulses. By combining it with the aforementioned methods, for example by temporarily invalidating the recognized numbers, the security can be increased or the speed can be increased compared to the aforementioned methods. Also, the acknowledgment signal does not have to be boolean, but must either contain the commodity number itself or contain a checksum derived therefrom, for example a CRC-16, which are also referred to as the signature of the commodity number.
  • the commodity number is not completely coded out, but rather, like a hash code, several commodity numbers occupy a common time slot, this can take longer and thus be less prone to failure. Since there are far fewer transponders than commodity numbers, most of these time slots will be statistically unoccupied. The tester only needs to query the commodity numbers possible for the occupied time slots. In contrast to the hash code, however, multiple occupancy of a time slot is desirable since the verifier must in any case test all the goods numbers of the time slot. For this reason, the commodity numbers should be assigned, for example, in such a way that the special offers fall within a common time slot or that common product groups have common time slots. It also makes sense for different manufacturers to occupy different time slots if the offer includes similar products from different manufacturers, because copies of the same type are predominantly bought from the same product.
  • Protection against interference pulses is also possible by using the Walsh or Rademacher function if the verifier evaluates the field weakening or the field strength of the received return signals not only in a binary manner but also quantitatively in terms of size. Since the distance between the transponders is less than that between the verifier and a transponder, the field monitoring of all transponders is approximately the same. The responses of the individual transponders are thus superimposed.
  • the commodity number is not shown in the 1-out-of-n code, but coded as a Walsh function.
  • the known Walsh functions represent a set of orthogonal step functions, the superposition of which can be broken down by a calculation process similar to a Fourier analysis.
  • a signal processor such as the TMS320 from Texas Instruments can be used in the tester, for example, so that the Walsh analysis is carried out in a short time. Since the Walsh functions are orthogonal to one another, the mean value of multiplying the received signal by a Walsh function provides the field strength of the transmitting transponder that used this Walsh function, or zero if the Walsh function was not included in the broadcast . Individual interference pulses are thus integrated over the entire transmission period and thus filtered out. Since a set of 2 n transponders always requires 2 n bits, the same applies to simple 1-out-of-n coding for 8192 articles, a response of 8192 bits is required, which is synchronized with the transmission signal.
  • Another variant of the invention uses time slots which contain several bits of the reply.
  • the tester sends an unspecific request, i.e. he switches on the high-frequency field and starts the request by briefly weakening the field, e.g. 1ms duration.
  • the receivers wait a time determined by a random generator between 0 and 5 seconds in steps of 0.1 seconds, so that about 50 time slots arise.
  • the waiting time can be advantageous, but does not have to be derived from the field frequency of the verifier.
  • the respective transponder sends its response, which fits completely into a time slot. Any retransmission method, including frequency shifting, is possible because there is no partial collision. Using the checksum in the response packet, the tester can recognize response packets without collision and acknowledge the transponder.
  • An improvement is achieved if an orbital retransmission method such as field weakening is used and the clock for the retransmission is derived from the frequency of the transmission field, so that a defined oration of the response takes place. If two transponders collide in a time slot, this is determined via the checksum. In the processing unit of the verifier, attempts are made to test whether the received bit pattern contains one of the frequently used commodity numbers. If this is the case, this product will be canceled by a specific request with a receipt. Alternatively, a code is used, the checksum of which makes it possible to determine whether exactly two values are required. This is the case, for example, with error-correcting codes in which the error syndrome is then represents second code word. A simple, but not very efficient, solution is to use 1-aus n as code again, in which the decoder does not falsify information.
  • a newly assigned article number can be checked to see whether its use with any of the already existing article numbers leads to a loss of information and, if necessary, can be modified until a clear disassembly is possible.
  • Commodity numbers with this property can be calculated in advance at times when there is no sale and thus the computing power of the goods settlement system is not required.
  • This "hit list” is advantageously adapted dynamically during operation by evaluating the number of goods devalued, for example since the beginning of the day or in the last hour, and adding the most frequent items to the "hit list” or forming them.
  • Another variant of the preselection breaks down the commodity number into a part that represents the commodity type or an article number, and a counting field that marks the individual item.
  • the verifier sends a request for each type of goods, so that in the subsequent phase to determine the individual copies only who participate in this commodity code and thus the probability of a collision is reduced.
  • both a commodity number and a mask are transmitted, only the bits of the commodity number contained in the mask being taken into account in the comparison.
  • An alternative to this is to specify a range of commodity numbers by means of two commodity numbers, namely the upper and lower bound.
  • a binary search is possible, which is to be used in particular for commodity numbers that are approximately equally distributed.
  • an average collision-free query is achieved after only 5 queries.
  • the bits of the mask are not used in the usual order, but in a previously determined order in which a good statistical distribution is achieved.
  • the commodity number begins with a manufacturer number, so that the associated bits have little distinctive character.
  • the statistical correlation of the bit positions with that in the computer stored inventory list determined.
  • the first bit positions in the query are those whose frequency is as close as possible to 50%.
  • the actual or estimated number of goods on sale can also be used to weight the individual goods numbers with this number.
  • the number of tests with binary selection is significantly lower, e.g. when using time slots on average by the number of time slots as a factor because the number of transponders is effectively distributed over the time slots.
  • a number of 32 transponders is distributed over, for example, 8 time slots, so that effectively only 4 transponders can collide each time and the goods numbers can be determined in an average of 4 queries.
  • the acknowledgment response for very long goods numbers can be based on a signature, i.e. Checksum of a general nature, the commodity number can be limited. As soon as the search space is limited enough by the binary search, the signature can be fully sufficient to determine the goods number.
  • each transponder has a unique number.
  • a first solution to this is to use Walsh functions and to make the distance between the verifier and the transponders much larger, for example by a factor of 10, than the distance of the transponders among themselves.
  • a reference transponder is attached to the shopping cart, the response field strength of which serves as a reference. If a transponder is present more than once, the Walsh analysis will determine the corresponding factor for this number, since two transponders then have an effect twice as great in the verifier as one. It would also make sense here to arrange a transmitter near the shopping basket and two or more receivers away from the shopping cart so that it is located approximately in the middle between the receivers.
  • a device can also be attached to the shopping cart which allows the position of the shopping cart to be measured.
  • the signals can then be better correlated by the known distance.
  • any of the recognition methods can also be used if a step is used in which all recognized transponder numbers are individually tested and the strength of the response signal. is evaluated as the number of transponders.
  • transponders have a predetermined commodity number, but when queried by a random number generator, they give themselves a temporary copy number, which can also be stored over several request cycles if necessary.
  • An alternative form determines the number of identical transponders with the same goods number from the size of the field strength of the return signal.
  • the knowledge is used that the receiver for the return signal can easily be arranged in such a way that the distance to the transponders is significantly further than the distance between the transponders. Since the field strength is quadratic with the stand decreases, with respect to the square of the distance, all transponders are approximately the same distance from the receiver and thus the reception field strength is proportional to the number of transponders.
  • a reference transponder is attached to the shopping cart, which delivers a comparison signal whose field strength corresponds to a single transponder.
  • the reference transponder is activated independently of the transponders to be determined and that the transponders to be determined all send their return signal at the same time.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Toxicology (AREA)
  • Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Business, Economics & Management (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Accounting & Taxation (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Radar Systems Or Details Thereof (AREA)
  • Cash Registers Or Receiving Machines (AREA)

Abstract

La présente invention porte sur un procédé permettant d'identifier individuellement plusieurs transpondeurs ayant par paires des numéros d'identification différents sur un grand nombre au total, dans le champ d'un même testeur. Le testeur émet une interrogation spécifique et une interrogation non spécifique, et les transpondeurs émettent des réponses filtrées par diverses mesures ou avec un décalage dans le temps.
PCT/DE1997/001565 1996-11-08 1997-07-24 Analyseur de corbeille d'achat WO1998021685A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP97935477A EP0937290A2 (fr) 1996-11-08 1997-07-24 Analyseur de corbeille d'achat
JP52200598A JP2001504608A (ja) 1996-11-08 1997-07-24 ショッピングバスケットスキャナ

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19646153.7 1996-11-08
DE1996146153 DE19646153A1 (de) 1996-11-08 1996-11-08 Warenkorbabtaster

Publications (2)

Publication Number Publication Date
WO1998021685A2 true WO1998021685A2 (fr) 1998-05-22
WO1998021685A3 WO1998021685A3 (fr) 1998-07-23

Family

ID=7811076

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE1997/001565 WO1998021685A2 (fr) 1996-11-08 1997-07-24 Analyseur de corbeille d'achat

Country Status (4)

Country Link
EP (1) EP0937290A2 (fr)
JP (1) JP2001504608A (fr)
DE (1) DE19646153A1 (fr)
WO (1) WO1998021685A2 (fr)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8538801B2 (en) 1999-02-19 2013-09-17 Exxonmobile Research & Engineering Company System and method for processing financial transactions
DE19950554A1 (de) * 1999-10-20 2001-04-26 Tuev Man Service Gmbh Unterneh Verfahren zum Beschreiben eines Produktinformationssystems zur Verwaltung produktspezifischer Informationen sowie entsprechendes System
DE19955464A1 (de) * 1999-11-08 2001-07-19 Heinz Brych Vorrichtung zur Detektion und Identifikation von Gegenständen
US7129840B2 (en) 2002-09-03 2006-10-31 Ricoh Company, Ltd. Document security system
US7424974B2 (en) 2002-09-03 2008-09-16 Ricoh Company, Ltd. Techniques that facilitate tracking of physical locations of paper documents
US7884955B2 (en) 2002-09-03 2011-02-08 Ricoh Company, Ltd. Techniques for performing actions based upon physical locations of paper documents
US7506250B2 (en) 2002-09-03 2009-03-17 Ricoh Company, Ltd. Techniques for determining electronic document information for paper documents
US6860422B2 (en) 2002-09-03 2005-03-01 Ricoh Company, Ltd. Method and apparatus for tracking documents in a workflow
US7652555B2 (en) 2002-09-03 2010-01-26 Ricoh Company, Ltd. Container for storing objects
DE10254151A1 (de) * 2002-11-20 2004-06-17 Siemens Ag Verfahren zur kollisionsfreien Datenübertragung zwischen Schreib-/Lese-Geräten (SLG) und einem mobilen Datenspeicher (MDS) sowie Schreib-/Lese-Geräten (SLG), mobiler Datenspeicher (MDS) und Identifikationssystem für ein derartiges Verfahren
DE10309419A1 (de) * 2003-03-05 2004-09-16 Leopold Kostal Gmbh & Co Kg Verfahren und Einrichtung zur Identifikation eines mobilen Transponders
DE102004018541A1 (de) 2004-04-14 2005-11-17 Atmel Germany Gmbh Verfahren zum Auswählen eines oder mehrerer Transponder
DE102004046865B4 (de) * 2004-09-27 2018-01-25 Infineon Technologies Ag Identifikations-Datenträger, Lese-Vorrichtung, Identifikations-System und Verfahren zum Betreiben eines Identifikations-Systems
EP1659549A1 (fr) 2004-11-23 2006-05-24 Wincor Nixdorf International GmbH Méthode et agencement pour la collecte de données d'articles
US8325019B2 (en) 2010-09-13 2012-12-04 Ricoh Company, Ltd. Motion tracking techniques for RFID tags

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4471345A (en) * 1982-03-05 1984-09-11 Sensormatic Electronics Corporation Randomized tag to portal communication system
EP0285419A2 (fr) * 1987-03-31 1988-10-05 Identec Limited Equipement de contrôle d'accès
WO1994019781A1 (fr) * 1993-02-16 1994-09-01 N.V. Nederlandsche Apparatenfabriek Nedap Systeme d'identification servant a detecter une pluralite de repondeurs d'identification dans un champ d'interrogation et a determiner leurs positions
GB2283600A (en) * 1993-11-02 1995-05-10 Nippon Denso Co Communication system
EP0689151A2 (fr) * 1994-05-31 1995-12-27 Kipp, Ludwig Système pour stockage et communication d'information
EP0696011A2 (fr) * 1994-07-27 1996-02-07 Texas Instruments Deutschland Gmbh Appareil et méthode pour l'identification d'une multiplicité de transpondeurs
US5539394A (en) * 1994-03-16 1996-07-23 International Business Machines Corporation Time division multiplexed batch mode item identification system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2259227B (en) * 1991-08-30 1995-10-18 Marconi Gec Ltd Improvements in or relating to transponders
US5557280A (en) * 1992-08-26 1996-09-17 British Technology Group Limited Synchronized electronic identification system
US5508705A (en) * 1994-01-10 1996-04-16 Spiess; Newton E. Vehicle identification classification and communication system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4471345A (en) * 1982-03-05 1984-09-11 Sensormatic Electronics Corporation Randomized tag to portal communication system
EP0285419A2 (fr) * 1987-03-31 1988-10-05 Identec Limited Equipement de contrôle d'accès
WO1994019781A1 (fr) * 1993-02-16 1994-09-01 N.V. Nederlandsche Apparatenfabriek Nedap Systeme d'identification servant a detecter une pluralite de repondeurs d'identification dans un champ d'interrogation et a determiner leurs positions
GB2283600A (en) * 1993-11-02 1995-05-10 Nippon Denso Co Communication system
US5539394A (en) * 1994-03-16 1996-07-23 International Business Machines Corporation Time division multiplexed batch mode item identification system
EP0689151A2 (fr) * 1994-05-31 1995-12-27 Kipp, Ludwig Système pour stockage et communication d'information
EP0696011A2 (fr) * 1994-07-27 1996-02-07 Texas Instruments Deutschland Gmbh Appareil et méthode pour l'identification d'une multiplicité de transpondeurs

Also Published As

Publication number Publication date
EP0937290A2 (fr) 1999-08-25
DE19646153A1 (de) 1998-05-14
JP2001504608A (ja) 2001-04-03
WO1998021685A3 (fr) 1998-07-23

Similar Documents

Publication Publication Date Title
DE69909258T2 (de) Lesegerät zur identifizierung von gegenständen
DE69233023T2 (de) Elektronisches Identifizierungssystem
EP0755026B1 (fr) Procédé d'identification automatique d'un nombre inconnu de transpondeurs par un lecteur et dispositif d'identification pour la mise en oeuvre de ce procédé
DE112005000319B4 (de) Auswahl- und Arbitrationsverfahren und -system
EP1415263B1 (fr) Procede de transmission de donnees entre un appareil de lecture/d'ecriture et une memoire de donnees, application d'un procede dans un systeme d'identification, appareil de lecture/d'ecriture et memoire de donnees mobile pour un tel systeme d'identification
DE69923645T2 (de) Elektronisches Identifizierungssystem
DE69622213T2 (de) Elektronisches Identifizierungssystem
EP0937290A2 (fr) Analyseur de corbeille d'achat
DE69020105T2 (de) Datenübertragungssystem.
DE69531569T2 (de) System zum Speichern und Übertragen von Information
DE3851168T2 (de) Zugangskontrolleinrichtung.
DE69736078T2 (de) Spreizspektrum-Frequenzsprunglesesystem
DE69528246T2 (de) Elektronisches Identifizierungssystem
DE69116946T2 (de) Verfahren und Gerät zur Radioidentifizierung und Zielverfolgung
DE69524494T2 (de) Vorrichtung und Verfahren zur Identifizierung mehrerer Transponder
DE602004010838T2 (de) System zum erkennen von hochfrequenz-identifikationsetiketten
EP0029560B1 (fr) Procédé pour détecter et compter des objets
WO2005101288A2 (fr) Procede de selection d'un ou plusieurs transpondeurs
DE69931298T2 (de) Verfahren und System zum mehrmaligen Lesen einer Sammlung von Etiketten mit verschiedenen Identifikationskodes
EP1526474B1 (fr) Procédé pour sélectionner un ou plusieurs transpondeurs
DE60308529T2 (de) Antikollisionsverfahren mit zeitschlitzen mit verarbeitung von informationen, die die zeitschlitze markieren
EP2087455B1 (fr) Dispositif et procédé d'acquisition de données
DE69617673T2 (de) Kommunikationsdatenformat
EP1586917A2 (fr) Méthode pour faire un choix entre un ou plusieurs répondeurs
DE60130816T2 (de) RFID-Transponder

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): JP US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: A3

Designated state(s): JP US

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1997935477

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 09297858

Country of ref document: US

ENP Entry into the national phase

Ref country code: JP

Ref document number: 1998 522005

Kind code of ref document: A

Format of ref document f/p: F

WWP Wipo information: published in national office

Ref document number: 1997935477

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1997935477

Country of ref document: EP