2013
DOI: 10.1186/1687-3963-2013-8
|View full text |Cite
|
Sign up to set email alerts
|

Automatic leaking carrier canceller adjustment techniques

Abstract: In this contribution, four automatic adjustment algorithms for leakage carrier cancellation in radio frequency identification (RFID) readers are compared: full search, gradient search, fast and direct I/Q algorithms. Further, we propose two enhanced adjustment procedures. First, we analytically calculate the performance of the fast adjustment algorithm in the presence of noise and derive its theoretical bias. We compare the theoretical results with the numerical results from accompanying simulations. Further, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…In addition, it is suitable for scenarios with ideal ambient noise and circuit noise [24]. On the other hand, the local search algorithm puts less requirement on the power detector as long as it shows a monotone but not necessarily linear input-output relation [25]. So, the design requirements of the power detector can be appropriately relaxed.…”
Section: Self-jammer Cancellation Algorithmmentioning
confidence: 99%
“…In addition, it is suitable for scenarios with ideal ambient noise and circuit noise [24]. On the other hand, the local search algorithm puts less requirement on the power detector as long as it shows a monotone but not necessarily linear input-output relation [25]. So, the design requirements of the power detector can be appropriately relaxed.…”
Section: Self-jammer Cancellation Algorithmmentioning
confidence: 99%
“…If the cancellation level has only a single maximum in the dynamic range of Vi and Vq, the algorithm is able to achieve a desired cancellation level C below this maximum, using a standard iterative gradient search method [8] with line search optimization.…”
Section: B Cancellation Algorithmmentioning
confidence: 99%
“…For now, we assume G I to be constant, this topic is further treated in Section IV. If no LCC is used G I =1, if it is misadjusted or not optimized for broadband operation values of G I < 1 are probable [19].…”
Section: B Reverse Link Limitmentioning
confidence: 99%