Patent ID: 11966807
Assignee: NANJING UNIVERSITY OF INFORMATION SCIENCE AND TECHNOLOGY
Field: Computer technology (Electrical engineering)
Classification: CPC G  Y | IPC G

Claim 5:
6. The multi-tag concurrent identification method for a query tree based on feature groups according to claim 1, wherein in the step 2, when 1<m<k, mapping steps of the mapping data returned by the tag specifically comprises:
step 2.11, inputting m-bit original data, the data is represented as b=bm-1bm-2 . . . b0 and mapped M-bit data is represented as P=PM-1PM-2 . . . P0, wherein M=2m, both bi and Pi represent certain binary numbers; initializing to make P0-bit in P as 1, rest bits as 0, and j as 0;
step 2.12, calculating r=bj×2j, circularly shifting P to the left by r bits to obtain an updated P, and executing j=j+1; and
step 2.13: judging whether a value of j is equal to m, if yes, ending a mapping process and taking an output of P at this time as a final mapping data; otherwise, a skip is made to the step 2.12.