This paper describes a new fast anti-collision algorithm for Radio Frequency Identification (RFID) systems. An efficient protocol is introduced for anti-collision of tags and readers in multi-tag multi-reader environments. The proposed anti-collision protocol is based on constructing similar binary trees topology (STT) for all readers in the collision domain. The novelty of our protocol is the Parallel Binary Splitting (PBS) identification path that will be used in the tag identification process. All readers are synchronised to reply similar information and build similar binary trees topology. The identification time is divided among the tags and the readers. One bit reply will be sent sequentially (one-to-one bit dialog) in the identification process. The tags in the overlapped reader-region will be identified one time only. The integrated treatment of the collision problem provides minimum bit transmission with minimum overhead, higher throughput, and simple logic operation. Performed computer simulations have shown that the proposed collision recovery scheme is very fast and simple