2012
DOI: 10.1007/s11265-012-0705-3
|View full text |Cite
|
Sign up to set email alerts
|

A Hardware-Efficient Algorithm for Real-Time Computation of Zadoff–Chu Sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…To create a cell detector, a threshold is required to determine if multiple PSS correlations on the three Zadoff Chu sequences and at different time offsets are valid. Most PSS detectors that use a threshold skip the development entirely by saying that it is predetermined [28]. Commonly as in [24] [29], a detector uses a threshold based on the mean of the correlation results.…”
Section: A Design Challengesmentioning
confidence: 99%
“…To create a cell detector, a threshold is required to determine if multiple PSS correlations on the three Zadoff Chu sequences and at different time offsets are valid. Most PSS detectors that use a threshold skip the development entirely by saying that it is predetermined [28]. Commonly as in [24] [29], a detector uses a threshold based on the mean of the correlation results.…”
Section: A Design Challengesmentioning
confidence: 99%
“…Furthermore, the discrete Fourier transform (DFT) of a ZC sequence is another ZC sequence (see e.g. [13]). A ZC sequence of odd length L [11,12] is defined as…”
Section: Arxiv:151107316v1 [Csit] 23 Nov 2015mentioning
confidence: 99%