Literature Database Entry


Muhammad Nabeel, Ali Imran Najam, Yvan Duroc and Fahad Rasool, "Multi-Tone Carrier Technique for Signal Recovery from Collisions in UHF RFID with Multiple Acknowledgments in a Slot," Proceedings of IEEE International Conference on Emerging Technologies (ICET 2013), Islamabad, Pakistan, December 2013, pp. 1–5.


In passive Radio Frequency IDentification (RFID) systems, tags do not have their own power source and they receive their operating energy from continuous modulated RF carrier transmitted by the reader. The tag while receiving this carrier randomly selects a slot and sends back its RN16 using backscatter modulation for purpose of its identification. The efficiency of the existing UHF RFID systems is limited, as only response from a single tag in a slot can be decoded successfully. If multiple tags select the same slot collision happens, information of physical layer is discarded and retransmission is executed. In this work, a multi-tone carrier wave is exploited to make the collided tag signals decodable. In addition, a novel method to acknowledge the multiple tag signals in a single slot is proposed. The system performance in terms of expected throughput is significantly improved with the use of both multi-tone carrier and the multiple acknowledgements technique at the same time.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Muhammad Nabeel
Ali Imran Najam
Yvan Duroc
Fahad Rasool

BibTeX reference

    author = {Nabeel, Muhammad and Najam, Ali Imran and Duroc, Yvan and Rasool, Fahad},
    doi = {10.1109/ICET.2013.6743530},
    title = {{Multi-Tone Carrier Technique for Signal Recovery from Collisions in UHF RFID with Multiple Acknowledgments in a Slot}},
    pages = {1--5},
    publisher = {IEEE},
    address = {Islamabad, Pakistan},
    booktitle = {IEEE International Conference on Emerging Technologies (ICET 2013)},
    month = {12},
    year = {2013},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.