CN101436244B - Method for recognizing answering machine, transponder and information identification system - Google Patents
Method for recognizing answering machine, transponder and information identification system Download PDFInfo
- Publication number
- CN101436244B CN101436244B CN2007101772061A CN200710177206A CN101436244B CN 101436244 B CN101436244 B CN 101436244B CN 2007101772061 A CN2007101772061 A CN 2007101772061A CN 200710177206 A CN200710177206 A CN 200710177206A CN 101436244 B CN101436244 B CN 101436244B
- Authority
- CN
- China
- Prior art keywords
- transponder
- module
- prefix
- stack
- identification information
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 241001515094 Inquisitor Species 0.000 claims description 96
- 238000001514 detection method Methods 0.000 claims description 6
- 230000000295 complement effect Effects 0.000 claims description 5
- 239000002699 waste material Substances 0.000 abstract description 4
- 230000007547 defect Effects 0.000 abstract 1
- 230000005540 biological transmission Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 6
- 230000004044 response Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 230000002950 deficient Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- CVOFKRWYWCSDMA-UHFFFAOYSA-N 2-chloro-n-(2,6-diethylphenyl)-n-(methoxymethyl)acetamide;2,6-dinitro-n,n-dipropyl-4-(trifluoromethyl)aniline Chemical compound CCC1=CC=CC(CC)=C1N(COC)C(=O)CCl.CCCN(CCC)C1=C([N+]([O-])=O)C=C(C(F)(F)F)C=C1[N+]([O-])=O CVOFKRWYWCSDMA-UHFFFAOYSA-N 0.000 description 1
- XEEYBQQBJWHFJM-UHFFFAOYSA-N Iron Chemical compound [Fe] XEEYBQQBJWHFJM-UHFFFAOYSA-N 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
Images
Landscapes
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention provides a method for identifying a responder and an interrogator as well as an information identification system thereof. The method comprises the following steps: according to collision information, a bit value which can be identified is acquired; the bit value is stored in the storing equipment comprising a byte stack; and according to the bit value stored in the storing equipment, the tag ID is read out. The method and the system can overcomes the defects of slow prefix increasing speed existing in prior art, effectively speed up the prefix increasing speed, further improve identification efficiency of the responder, reduce power consumption of the responder, fully utilize the ID transmitted by the responder each time and avoid waste of resources.
Description
Technical field
The present invention relates to the network communications technology field, relate in particular to a kind of method, inquisitor and information identification system of discerning transponder.
Background technology
Radio-frequency (RF) identification (RFID) system generally comprises transponder (tag) and inquisitor (Interrogator).Transponder is the carrier of storage rfid system data, and each transponder has unique identification information (ID); The main task of inquisitor is that the control radio-frequency module is launched reading order to transponder, and receives replying that transponder returns, it is decoded, afterwards with decoded information transmission to background host computer for processing.
Under the pattern of an inquisitor to a plurality of transponders, rfid system need identify all transponders in the certain limit faster, because transponder passive work under inquisitor control, and all transponders are operated in same frequency range, so how effectively to avoid the also fast as far as possible intact all transponders of identification of information collision in the transponder identifying, become the gordian technique of rfid system.
What use in existing EPC (EIectronic Product Code, the electronic product code) standard is query tree (Query tree) and time slot A LOHA algorithm.Query tree algorithm adopts the prefix matching method by turn the electronic code of transponder to be mated identification, and as shown in Figure 1, operation steps is as follows:
Step 100, initialization inquisitor prefix stack, initial prefix is 0 and 1; Execution in step 101;
If the prefix of tag is identical with the stack top data of the prefix stack that inquisitor sends, then this tag makes response to inquisitor, sends the ID of described tag;
If the stack top of the prefix stack that the prefix of tag and inquisitor send is inequality, then tag does not respond;
If described quantity is 1, execution in step 104;
If described quantity is greater than 1, execution in step 105;
If described quantity is 0, execution in step 106;
Here need to prove, " collision " of Chu Xianing is as lay special stress on not in this article, refer to " position collision ", promptly in once replying, corresponding place value difference in the id information of a plurality of tag that send id information to inquisitor is as in once replying, there are two tag to send id information to inquisitor, the i position of the id information of a tag (i is an integer) is 0, and the i position of the id information of another tag is 1, and then the i position of the id information of these two tag bumps.Be identified and refer in once replying, corresponding place value in the id information of a plurality of tag that send id information to inquisitor is identical, as in once replying, two tag that send id information to inquisitor are arranged, the k position of the id information of these two tag (k is an integer) is 0 or be 1, and then the k position of these two tag can be discerned by inquisitor;
Repeated execution of steps 102 is empty to step 106 until the inquisitor prefix stack.
In realizing process of the present invention, the inventor finds that there is following problem at least in above-mentioned prior art:
In the existing Query tree algorithm, when the collision detection position, even continuously the continuous multidigit of ID of tag does not bump, also need these positions of not colliding are detected by turn, all tag that need when at every turn detecting to reply send the ID of self, caused the waste of the communication resource, and when the transponder number was big, in the operating process of existing recognition methods, the probability that the short prefix of length bumps was very big, the prefix growth rate is slow, has hindered the raising of recognition efficiency.
Summary of the invention
Embodiments of the invention provide a kind of method and inquisitor and information identification system of discerning transponder, can improve the prefix growth rate, make full use of the each ID that sends of transponder.
Embodiments of the invention are to be achieved through the following technical solutions:
A kind of method of discerning transponder comprises:
Obtain the collision information of transponder identification information in the compass of competency;
According to described collision information, obtain the place value that can be identified in the transponder identification information;
According to the position of described place value in the identification information of transponder, with the continuation field of place value as an element, according to order from back to front, described element is deposited in the memory device successively, described memory device is the byte stack;
According to the described place value that stores in the memory device, the transponder in the identification compass of competency.
A kind of inquisitor comprises:
Obtain information module: be used to obtain the collision information of transponder identification information in the compass of competency,, obtain the place value that can be identified in the transponder identification information according to described collision information;
Memory module: be used for according to the described place value of obtaining information module output in the position of the identification information of transponder, with the continuation field of described place value as an element, according to order from back to front, described element is deposited in the byte stack successively, and described memory module is the byte stack;
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
A kind of information identification system, described system comprises:
Transponder is used to identify Item Information, has identification information;
Inquisitor is used to discern the described transponder in the compass of competency;
Described inquisitor comprises:
Obtain information module: be used to obtain the collision information of described transponder identification information in the compass of competency,, obtain the place value that can be identified in the described transponder identification information according to described collision information;
Memory module: be used for according to the described place value of obtaining information module output in the position of the identification information of transponder, with the continuation field of described place value as an element, according to order from back to front, described element is deposited in the byte stack successively, and described memory module is the byte stack;
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
The technical scheme that is provided by the embodiment of the invention described above as can be seen, embodiments of the invention provide a kind of method and inquisitor and information identification system of discerning transponder, solved the slow defective of prefix growth rate in the prior art, the growth rate that adds block prefix effectively, thereby improved the recognition efficiency of transponder, reduced the power consumption of transponder; Make full use of the ID that transponder sends, avoided the waste of resource.
Description of drawings
The method flow diagram of the identification transponder that Fig. 1 provides for prior art;
The method flow diagram of the identification transponder that Fig. 2 provides for the embodiment of the invention;
The storehouse that the method for the identification transponder that Fig. 3 provides for the embodiment of the invention reads inquisitor in the process changes synoptic diagram;
The synoptic diagram of the method recognition efficiency of the transponder that Fig. 4 provides for the embodiment of the invention and the method recognition efficiency of original Query tree transponder contrast situation;
Fig. 5 for the embodiment of the invention provide the structural representation of inquisitor.
Embodiment
The described method that the embodiment of the invention provides at first is described below.
The embodiment of the invention provides a kind of method of discerning transponder, specifically can may further comprise the steps:
Step 1, inquisitor require the tag (transponder) in its compass of competency to send its ID (unique identification information of transponder just);
Step 2, described all tag send the ID of self to inquisitor according to the requirement of inquisitor;
Step 3, inquisitor receive the ID that described all tag send;
After step 4, inquisitor receive the ID of described all tag transmissions, detect the collision situation of described ID;
Step 5, inquisitor obtains collision information according to the collision situation of described ID, has which position to bump among the ID of described all tag that described collision information refers to, the information which position can be identified; Form that described collision information can be tabulated occurs, and form that also can non-tabulation occurs;
Step 6, inquisitor be according to described collision information, the place value that acquisition can be identified; Here " place value that can be identified " refers to the value of the position that can be identified, and is generally 0 or 1;
Store described place value, described place value is stored in the memory device; When described memory device was the byte stack, described place value was according to from back to front sequential storage; The continuation field of described place value deposits the byte stack in as an element;
Step 7, initialization inquisitor prefix stack, inquisitor sends the stack top data of prefix stack to all tag;
Step 8, tag receives the stack top data of the prefix stack of inquisitor transmission, judges whether the prefix of tag is identical with the stack top data of the prefix stack of the inquisitor that receives; If the prefix of tag is identical with the stack top data of the prefix stack of inquisitor, then described tag sends self ID to inquisitor; If the prefix of tag is different with the stack top data of the prefix stack of inquisitor, then described tag does not respond inquisitor.
According to described place value, read the ID of tag; This step comprises: identical and present bit (is in the id information of a plurality of tag when the stack top data of the prefix of more than one tag and the prefix stack of inquisitor, the current detected position that whether bumps) when not bumping, take out an element from known storage device, described element is to be stored in the place value that can be identified in the memory device, the continuous described collision information; Described element is added to after the last position of present bit, be stored in the stack top of inquisitor prefix stack as new prefix.
Illustrate below in conjunction with Fig. 2 the technical scheme of the embodiment of the invention to need to prove that here among this embodiment, above-mentioned collision information occurs with tabular form that be the collision information tabulation, what memory device adopted is the byte stack; The concrete operations step is:
Step 200, inquisitor require all tag transmission ID in the system, and all tag send self ID to inquisitor, execution in step 201;
Step 201, inquisitor receive the ID that all tag send, and detect the collision situation of described ID, execution in step 202;
Step 202 obtains the collision information tabulation of described ID, and is as follows:
XXX__XX______……__X__XXXX___XXXXX
Wherein, " _ " expression unknown bits, " X " represents known bits, known bits is the position that can be correctly validated, and can obtain its place value;
According to the tabulation of described collision information, obtain the place value that can be correctly validated among the described ID, execution in step 203;
Step 203, with described place value according to from back to front order, store in the byte stack standby successively by continuation field; Execution in step 204;
Step 204, the prefix stack of initialization inquisitor, as the initial value of prefix stack is 0 and 1 as described in being provided with, inquisitor sends the stack top data of prefix stack to all tag, as 0; Execution in step 205;
Step 205, tag receives the stack top data of described prefix stack, judges whether the prefix of tag is identical with the stack top data of the prefix stack of the inquisitor that receives:
If the prefix of tag is identical with the stack top of the prefix stack of inquisitor, then execution in step 206; Otherwise, execution in step 207;
Step 206, tag sends the ID of self, execution in step 208;
Step 207, tag does not respond, execution in step 213;
Step 208, inquisitor receives the ID that tag sends, and judges the quantity of the tag that makes response according to described ID:
If the quantity of described tag is 1, then execution in step 209;
If the quantity of described tag is greater than 1, then execution in step 210;
If the quantity of described tag is 0, then execution in step 213;
Step 209, the quantity of described ID is 1, illustrates that the prefix that a tag is only arranged is identical with the stack top data of the prefix stack of inquisitor, at this moment, but this tag of inquisitor Direct Recognition; Execution in step 213 then;
Step 210, the quantity of described ID illustrate that greater than 1 a plurality of (in other words more than one) prefix of tag is identical with the stack top data of the prefix stack of inquisitor, at this moment, whether the present bit that inquisitor need detect described a plurality of tag bumps, if bump, then execution in step 211; Otherwise, execution in step 212;
Step 211, collision situation are handled: will collide (being the present bit of the ID of the tag under a collision situation) place value preceding, known ID and mend 0 and 1 respectively, and put into the stack top of inquisitor prefix stack, execution in step 213 as new prefix;
Step 212, the non-collision situation is handled: eject a field from the known byte stack, after adding to non-collision position (being the present bit of the prefix of the tag under the non-collision situation) place value preceding, known ID, put into the stack top of the prefix stack of inquisitor, execution in step 213 as new prefix;
Step 213, inquisitor continues to send the stack top data of prefix stack, execution in step 205;
Repeated execution of steps 205 is empty to step 213 until the inquisitor prefix stack.
In order to be illustrated more clearly in the technical scheme that the embodiment of the invention provides, illustrate when adopting the technical scheme that the embodiment of the invention provides that below in conjunction with Fig. 3 and Fig. 4 the storehouse that reads inquisitor in the ID process of tag changes.
For example, after step 200-step 203, tag all in the known system all send self ID to inquisitor, inquisitor obtains the collision information tabulation of the ID of described tag: in the id information of known tag, front three is ' 010 ', fourth, fifth the unknown, six, seven is ' 10 ', below be example just with the process that reads of the first seven in the id information of tag, illustrate that this reads in the process, the storehouse of inquisitor changes:
Because the front three of the id information of tag can be identified, and is ' 010 ', so directly prefix stack is initialized as ' 010 ' (the prefix stack situation of the very first time among Fig. 3);
At this moment, the stack top of the prefix stack that inquisitor sends is ' 010 ', because the 4th the unknown of known tag, promptly bump, thereby identification tag id information in the 4th the time, at first mend ' 0 ' and ' 1 ' respectively afterwards, will ' 0100 ' be stored in the prefix stack of inquisitor as new prefix, shown in the prefix stack situation of second time among Fig. 3 with ' 0101 ' ' 010 '; At this moment, ' 0100 ' is the stack top of the prefix stack of inquisitor, it being ejected, send to the tag in the compass of competency, is ' 0100 ' if having the prefix of a plurality of tag this moment, then inquisitor need judge whether present bit (the 5th) bumps, because the 5th collision so need add ' 1 ' and ' 0 ' respectively after ' 0100 ', forms two new prefix data, be updated to prefix stack, shown in the prefix stack situation of the 3rd time correspondence among Fig. 3.
Next, need the 6th in the id information of identification tag, because the 6th known, promptly this moment tag six of present bit-Di-do not bump, directly from the known byte stack, eject by the 6th, the 7th element of forming ' 10 ', it is added to ' 01000 ' shown in the 3rd the prefix stack stack top of the storehouse among Fig. 4 afterwards, form ' 0100010 ', to ' 0100010 ' as new prefix, be stored in the prefix stack stack top of inquisitor, shown in the prefix stack situation of the 4th time among Fig. 3.
Hence one can see that, adopt prior art Query tree algorithm read the id information of tag the time, need one one to chase after gradually and read, send out certain stack top prefix, if collision then this prefix ID is increased by one (0 or 1) increases by two prefix elements in storehouse; If collision does not promptly have only 0 (or 1), then after this prefix, increase by 0 (or 1), in storehouse, increase a prefix element; When adopting the technical scheme that the embodiment of the invention provides because some known bits have been arranged, when not bumping, can directly be increased to prefix to known bits after, thereby it is just passable in fact only need to detect the position of those real collisions.
Therefore, the technical scheme that adopts the embodiment of the invention to provide, the number of times that can save a large amount of time, minimizing information is transmitted; Owing to realize space (contactless) coupling of radiofrequency signal between tag and the inquisitor by coupling element; In coupling channel,, realize NE BY ENERGY TRANSFER and exchanges data according to sequential relationship; Thereby in fact the number of times of minimizing information transmission be exactly the power consumption that has reduced tag, improves recognition efficiency.
When tag quantity is fewer, the technical scheme effect that adopts the embodiment of the invention to provide is remarkable, this is because tag quantity is few, then the figure place of colliding in the id information of tag is just few, identical figure place is just many, the byte that can store in advance in the known byte storehouse is just many, thereby efficient improves, effect is remarkable; When tag is a fairly large number of, the efficient that technical scheme increased that adopts the embodiment of the invention to provide can be tending towards a stationary value, this is because except some identical parts (as vendor code etc.), other position all bumps in the id information of tag, thereby the recognition efficiency value can be stabilized in a value; As shown in Figure 4.
The embodiment of the invention also provides a kind of inquisitor, as shown in Figure 5, comprises and obtains information module, memory module and identification module:
Obtain information module, be used to obtain transponder identification information (being the ID of tag) collision information in its compass of competency, according to described collision information, the place value that can be identified among the ID of acquisition tag is exported described place value; The described information module that obtains further can comprise detection module and can discern the place value acquisition module, wherein,
Detection module is used to detect the collision situation of the ID of all tag that receive, obtains collision information, with described collision information output;
Can discern the place value acquisition module, be used to receive the described collision information of described detection module output, according to described collision information, the place value that acquisition can be identified is exported described place value.
Memory module and is obtained information module and is connected, and is used to store the described place value that can discern the output of place value acquisition module; Described memory module can be the byte stack, also can be the memory device of other non-byte stacks, propose in embodiments of the present invention with storehouse (or byte stack) storage known byte just based on the existing storehouse of prior art of the present invention, can discern place value if increase memory stores, need with existing storehouse cooperating, can discern place value if increase a new storehouse storage, then correspondingly reduce the communication frequency of tag.
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
Described identification module comprises prefix stack module, sending module, receiver module, obtains the element module, complementary element module and collision judgment module, and identification module further comprises successfully identification module and prefix stack update module, wherein,
The prefix stack module is used to store the prefix data that is used to discern transponder;
Sending module is used to send the stack top data of prefix stack module;
Receiver module is used to receive the identification information that the identification information prefix transponder identical with described stack top data sends;
The collision judgment module is used for receiving under the situation of the identification information that more than one transponder sends at described receiver module, judges whether the present bit of described more than one transponder bumps, the output judged result; In this case, to the quantity of the tag of inquisitor response greater than 1, these tag send ID to inquisitor simultaneously, and therefore, what receiver module received is the overlapped information of the ID of a plurality of tag transmissions, if described overlapped information has only carrier wave, and do not have level to change, as level signal or from high to low, illustrate that then the present bit of described a plurality of tag bumps from low to high, if described overlapped information has level to change, illustrate that then the present bit of described a plurality of tag does not bump;
Obtain the element module, be used for receiving the identification information that more than one transponder sends at described receiver module, and the collision judgment module is judged under the situation that the present bit of the identification information of more than one transponder do not bump, obtain the element corresponding with present bit from memory module, described element is the continuous place value in the described memory device;
The complementary element module is used for described element is added to after the present bit, is stored in described prefix stack module as new prefix.
The success identification module is used for discerning the relevant information of corresponding transponder when described receiver module receives the identification information that a transponder sends;
The prefix stack update module, be used for receiving the identification information that more than one transponder sends at described receiver module, and the collision judgment module is judged under the situation that the present bit of the identification information of more than one transponder bumps, behind the last position of the present bit of stack top data, add 0 and 1 respectively, form two new prefix data, and described new prefix data is upgraded into described prefix stack module; Described prefix stack update module also can be the prefix updates module, as long as can realize upgrading the function of prefix data.
Embodiments of the invention also provide a kind of information identification system, comprise transponder and inquisitor:
Transponder is used to identify Item Information, has identification information;
Inquisitor is used to discern the described transponder in the compass of competency;
Described inquisitor comprises and obtains information module, memory module and identification module:
Obtain information module: be used to obtain the collision information of described transponder identification information in the compass of competency,, obtain the place value that can be identified in the described transponder identification information according to described collision information;
Memory module: be used to store the described place value of obtaining information module output;
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
Described identification module comprises: the prefix stack module is used to store the prefix data that is used to discern transponder; Sending module is used to send the stack top data of prefix stack module; Receiver module is used to receive the identification information that the identification information prefix transponder identical with described stack top data sends; The collision judgment module is used for receiving under the situation of the identification information that more than one transponder sends at described receiver module, judges whether the present bit of described more than one transponder bumps, the output collision judgment result; Obtain the element module, be used for receiving the identification information that more than one transponder sends at described receiver module, and under the situation that the present bit of identification information prefix does not bump, obtain the element corresponding with present bit from memory module, described element is the continuous place value in the described memory device; The complementary element module is used for described element is added to after the present bit, is stored in described prefix stack module as new prefix.
Described identification module can further include: successful identification module is used for discerning the relevant information of corresponding transponder when described receiver module receives the identification information that a transponder sends; The prefix stack update module, be used for receiving the identification information that more than one transponder sends at described receiver module, and under the situation that the present bit of identification information bumps, behind the last position of the present bit of stack top data, add 0 and 1 respectively, form two new prefix data, and described new prefix data is upgraded into described prefix stack module.
Comprehensively above-mentioned, the embodiment of the invention provides a kind of method and inquisitor and information identification system of discerning transponder, avoided solving the slow defective of prefix growth rate in the prior art, the growth rate that adds block prefix effectively, thereby improved the recognition efficiency of transponder, reduced the power consumption of transponder; Make full use of the each ID that sends of transponder, avoided the waste of resource.
So far, the technical scheme that the present invention only provides with the specific embodiment explanation embodiment of the invention, but the present invention is not only limited to this, and all obtain collision information, the place value that acquisition can be identified based on basis; According to described place value, read the technical scheme of the ID of tag, no matter which kind of form of employing, all within protection scope of the present invention.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the conversion that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claims.
Claims (12)
1. a method of discerning transponder is characterized in that, comprising:
Obtain the collision information of transponder identification information in the compass of competency;
According to described collision information, obtain the place value that can be identified in the transponder identification information;
According to the position of described place value in the identification information of transponder, with the continuation field of place value as an element, according to order from back to front, described element is deposited in the memory device successively, described memory device is the byte stack;
According to the described place value that stores in the memory device, the transponder in the identification compass of competency.
2. method according to claim 1 is characterized in that, the described step of obtaining collision information further comprises before:
Transponder in compass of competency sends reading order;
Receive the identification information that the transponder in the compass of competency sends according to described reading order;
Detect the collision situation of described identification information.
3. method according to claim 1 is characterized in that, discerns the step of described transponder and comprises according to storing described place value in the memory device into:
Initialization inquisitor prefix stack, the transponder in compass of competency sends the stack top data of described inquisitor prefix stack;
Receive the identification information that the identification information prefix transponder identical with described stack top data sends; When identical and present bit described more than one transponder identification information does not bump when the stack top data of more than one transponder identification information prefix and described inquisitor prefix stack, take out the element corresponding with present bit from described memory device, described element is to be stored in a continuation field in the described memory device, described place value;
Described element is added to after the last position of present bit, deposit into described inquisitor prefix stack, continue the identification transponder according to the data in the described inquisitor prefix stack after upgrading as new prefix.
4. method according to claim 3 is characterized in that, the described identification information that transponder sends is the residue identification information after whole identification informations of transponder remove the prefix identical with stack top data.
5. method according to claim 3 is characterized in that, also comprises behind the identification information that the described reception identification information prefix transponder identical with described stack top data sends:
When the prefix of a transponder identification information is identical with the stack top data of prefix stack, then discern this transponder; Upgrade the prefix stack stack top data, the step that repeats to send stack top data, the transponder in the compass of competency is discerned;
Identical and present bit bumps when the stack top data of the prefix of an above transponder identification information and prefix stack, then behind the last position of the present bit of stack top data, add 0 and 1 respectively, form two new prefix data, and described new prefix data is upgraded into prefix stack; Continue the identification transponder according to the data in the prefix stack after upgrading.
6. an inquisitor is characterized in that, described inquisitor comprises:
Obtain information module: be used to obtain the collision information of transponder identification information in the compass of competency,, obtain the place value that can be identified in the transponder identification information according to described collision information;
Memory module: be used for according to the described place value of obtaining information module output in the position of the identification information of transponder, with the continuation field of described place value as an element, according to order from back to front, described element is deposited in the byte stack successively, and described memory module is the byte stack;
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
7. inquisitor according to claim 6 is characterized in that, the described information module that obtains further comprises:
Detection module is used to detect the collision situation of the identification information of all transponders that receive, and obtains collision information;
Can discern the place value acquisition module, be used to receive the described collision information of described detection module output, according to described collision information, the place value that acquisition can be identified.
8. inquisitor according to claim 6 is characterized in that, described identification module comprises:
The prefix stack module is used to store the prefix data that is used to discern transponder;
Sending module is used to send the stack top data of prefix stack module;
Receiver module is used to receive the identification information that the identification information prefix transponder identical with described stack top data sends;
The collision judgment module is used for receiving under the situation of the identification information that more than one transponder sends at described receiver module, judges whether the present bit of the identification information of described more than one transponder bumps;
Obtain the element module, be used for judged result in described collision judgment module and be under the situation that present bit do not bump, obtain the element corresponding with present bit from described memory module, described element is to be stored in the described memory module, a continuation field of described place value;
The complementary element module is used for described element is added to after the last position of present bit, is stored in described prefix stack module as new prefix.
9. inquisitor according to claim 8 is characterized in that, described identification module further comprises:
The success identification module is used for discerning the relevant information of corresponding transponder when described receiver module receives the identification information that a transponder sends;
The prefix stack update module, be used for receiving the identification information that more than one transponder sends at described receiver module, and under the situation that the present bit of identification information bumps, behind the last position of the present bit of stack top data, add 0 and 1 respectively, form two new prefix data, and described new prefix data is upgraded into described prefix stack module.
10. an information identification system is characterized in that, described system comprises:
Transponder is used to identify Item Information, has identification information;
Inquisitor is used to discern the described transponder in the compass of competency;
Described inquisitor comprises:
Obtain information module: be used to obtain the collision information of described transponder identification information in the compass of competency,, obtain the place value that can be identified in the described transponder identification information according to described collision information;
Memory module: be used for according to the described place value of obtaining information module output in the position of the identification information of transponder, with the continuation field of described place value as an element, according to order from back to front, described element is deposited in the byte stack successively, and described memory module is the byte stack;
Identification module: be used for the described place value of storing, discern described transponder according to memory module.
11. system according to claim 10 is characterized in that, described identification module comprises:
The prefix stack module is used to store the prefix data that is used to discern transponder;
Sending module is used to send the stack top data of prefix stack module;
Receiver module is used to receive the identification information that the identification information prefix transponder identical with described stack top data sends;
The collision judgment module is used for receiving under the situation of the identification information that more than one transponder sends at described receiver module, judges whether the identification information present bit of described more than one transponder bumps, the output judged result;
Obtain the element module, be used for receiving the identification information that more than one transponder sends at described receiver module, and under the situation that the present bit of the identification information of described more than one transponder does not bump, obtain the element corresponding from memory module with present bit, described element is to be stored in the described memory module, a continuation field of described place value;
The complementary element module is used for described element is added to after the last position of present bit, is stored in described prefix stack module as new prefix.
12. system according to claim 11 is characterized in that, described identification module further comprises:
The success identification module is used for discerning the relevant information of corresponding transponder when described receiver module receives the identification information that a transponder sends;
The prefix stack update module, be used for receiving the identification information that more than one transponder sends at described receiver module, and under the situation that the present bit of identification information bumps, behind the last position of the present bit of stack top data, add 0 and 1 respectively, form two new prefix data, and described new prefix data is upgraded into described prefix stack module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101772061A CN101436244B (en) | 2007-11-12 | 2007-11-12 | Method for recognizing answering machine, transponder and information identification system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101772061A CN101436244B (en) | 2007-11-12 | 2007-11-12 | Method for recognizing answering machine, transponder and information identification system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101436244A CN101436244A (en) | 2009-05-20 |
| CN101436244B true CN101436244B (en) | 2011-04-20 |
Family
ID=40710678
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101772061A Expired - Fee Related CN101436244B (en) | 2007-11-12 | 2007-11-12 | Method for recognizing answering machine, transponder and information identification system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101436244B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106970936B (en) * | 2017-02-09 | 2020-07-03 | 阿里巴巴集团控股有限公司 | Data processing method and device and data query method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1313974A (en) * | 1998-06-22 | 2001-09-19 | 乔治·伦纳德·鲍威尔 | Anti-collision tag apparatus and system |
| CN101079096A (en) * | 2007-06-13 | 2007-11-28 | 华南理工大学 | Multiple tag dynamic bit arbitration anti-collision method for RFID system |
-
2007
- 2007-11-12 CN CN2007101772061A patent/CN101436244B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1313974A (en) * | 1998-06-22 | 2001-09-19 | 乔治·伦纳德·鲍威尔 | Anti-collision tag apparatus and system |
| CN101079096A (en) * | 2007-06-13 | 2007-11-28 | 华南理工大学 | Multiple tag dynamic bit arbitration anti-collision method for RFID system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101436244A (en) | 2009-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100378732C (en) | Anti-collision method and system using optimized binary search tree | |
| CN1706205B (en) | System and method for minimizing unwanted re-negotiation of a passive RFID tag | |
| US20050237159A1 (en) | RFID tag systems, RFID tags and RFID processes with reverse link burst mode | |
| CN103208019B (en) | Be applicable to the multiway tree anti-collision algorithm of rfid system | |
| CN101866413B (en) | Multi-label anti-collision method based on grouping mechanism and jumping dynamic binary recognition | |
| US20050237157A1 (en) | RFID tag systems, RFID tags and RFID processes with branch node indexing | |
| EP1929433A1 (en) | Method for identifying tags using adafitve binary tree splitting technique in rfid system and rfid system therefor | |
| CN105488446A (en) | System and method for identifying multiple RFID tags in sealed metal environment | |
| CN1845125A (en) | Anti-collision system and method for simultaneously reading multi label | |
| CN101923625A (en) | Tag anti-collision method and system | |
| US20050237158A1 (en) | RFID tag systems, RFID tags and RFID processes using N-ary FSK | |
| CN101071471A (en) | Multi-label collision-proof method | |
| CN105046181A (en) | Deterministic anti-collision algorithm based on multi-prefix matching of query tree method | |
| CN101369305A (en) | Circuit and its model for validating anti-collision function of radio frequency identification tag chip | |
| CN101324916B (en) | Label recognition anti-collision method for RFID system | |
| CN100390808C (en) | Solution for multiple labels collision in RF recognition system | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| KR100842959B1 (en) | Scanning-based tag identification method in rfid systems | |
| CN101436244B (en) | Method for recognizing answering machine, transponder and information identification system | |
| CN102663332B (en) | Multi-label anti-collision guiding identification method for RFID system | |
| CN103927506A (en) | RIFD anti-collision method based on dynamic timeslot conflict tracking tree | |
| CN101436243B (en) | Conflict solution method for recognizing multiple radio frequency labels | |
| CN103679096A (en) | Optimized RFID anti-collision method | |
| Wang et al. | A novel anti-collision algorithm with dynamic tag number estimation for RFID systems | |
| CN101324915B (en) | Electronic label recognition method, radio frequency recognition system and electronic label |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: BEIJING ZHIXUN HUOBAN TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO., LTD. Effective date: 20150605 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518129 SHENZHEN, GUANGDONG PROVINCE TO: 100193 HAIDIAN, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20150605 Address after: 100193 Beijing City, northeast of Haidian District, South Road, No. 29, building 3, room 4, room 4516 Patentee after: Beijing wisdom partner Technology Co., Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: Huawei Technologies Co., Ltd. |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Beijing wisdom partner Technology Co., Ltd. Document name: Notification of Termination of Patent Right |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110420 Termination date: 20161112 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |