SUMMARYWe present a new radio frequency identification tag anti‐collision algorithm in this paper. The main idea of this algorithm is that we should find the collided bit at first, and every tag contains a register RC, which has length the same as the tag's ID length to store the conflict bit, then all the subsequent processing are based on the conflict bit. In this new algorithm, tag uses a binary pulse string to transfer data to the reader, compared with the traditional query tree‐based algorithms, which is based on the tag's ID; this new algorithm is more efficient and requires fewer read cycles for tag's identification. Copyright © 2013 John Wiley & Sons, Ltd.