2009
DOI: 10.1049/el.2009.3330
|View full text |Cite
|
Sign up to set email alerts
|

Efficient computation of DFT of Zadoff-Chu sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
46
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(46 citation statements)
references
References 3 publications
0
46
0
Order By: Relevance
“…We have introduced the notationč k = [36][37][38], used in modern cellular mobile communication systems for their favorable autocorrelation properties. They are preserved under the DFT up to a prefactor and taking the complex conjugate.…”
Section: Braiding Operatorsmentioning
confidence: 99%
“…We have introduced the notationč k = [36][37][38], used in modern cellular mobile communication systems for their favorable autocorrelation properties. They are preserved under the DFT up to a prefactor and taking the complex conjugate.…”
Section: Braiding Operatorsmentioning
confidence: 99%
“…Considering the special properties of ZC sequences, an attempt to reduce the computation complexity of ZC sequences' DFT has been done in [8]. The DFT of the u th root ZC sequence x u (n) of prime length N ZC is equal to a conjugated and time-scaled version of x u (n), up to a constant factor:…”
Section: Previous Dft Of Preamble Sequencesmentioning
confidence: 99%
“…Then the efficient discrete fourier transform structures more suitable for applications of ZC sequences have been derived [8]. Nevertheless, the discrete fourier transform structures in [8] cannot always be used to reduce the number of operations in the transmitter of long term evolution user equipment, as the transmitted random access (RA) preamble can be a cyclically shifted version of the basic ZC sequences. In addition, this discrete fourier transform structures cannot avoid large storage and complex computation of complex exponential function.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, several efficient generations and correlations are also developed for PCSS [24][25][26][27][28]. The authors of [29,30] have proposed efficient calculation of fast Fourier transform (FFT) of ZC sequence. Also, an efficient correlation method for the corresponding ZCZ sequence set is developed in [13].…”
Section: Introductionmentioning
confidence: 99%