2018
DOI: 10.1109/tase.2016.2614134
|View full text |Cite
|
Sign up to set email alerts
|

Collision Detection and Signal Recovery for UHF RFID Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…The authors in [11] employs a MMSE receiver which is capable of recovering 2 colliding tags (M = 2, J = 2) and obtain a throughput value of 0.841. In [12], voltage clustering is applied for the constellation points with a throughput value of 0.85 under the simulation setup M = 3, J = 2. With the proposed approach, we show that it is possible to decode 4 tags out of 4 colliding ones (M = 4, J = 4) by improving throughput value to the 1.756.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The authors in [11] employs a MMSE receiver which is capable of recovering 2 colliding tags (M = 2, J = 2) and obtain a throughput value of 0.841. In [12], voltage clustering is applied for the constellation points with a throughput value of 0.85 under the simulation setup M = 3, J = 2. With the proposed approach, we show that it is possible to decode 4 tags out of 4 colliding ones (M = 4, J = 4) by improving throughput value to the 1.756.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Later, they extend their work by also proposing a channel estimation technique using the post-preamble symbols in [11]. In [12], the number of tag estimation is coupled with a channel estimation technique for collision recovery and [13] studies code designs to recover tag collisions given the number of colliding tags.…”
Section: Introductionmentioning
confidence: 99%
“…It is independent of the sequence number and makes use of dynamic frame time slots. It is built on the concepts of probability and slotting [ 22 , 23 ]. As shown in Figure 13 , the specific flows of the Q algorithm are as follows:…”
Section: Methodsmentioning
confidence: 99%