Abstract | ||
---|---|---|
In the LTE system, Zadoff---Chu (ZC) sequence is used for the generation and detection of physical random access channel (PRACH) preamble sequence. The key step of PRACH baseband signal generation is to perform a discrete Fourier transform (DFT) of ZC sequence, which is characterized by the root index u and a rotation factor p. On-line computation according to the DFT formula is adopted in traditional algorithm, which has high computational complexity and is hard to meet the real-time requirement of LTE system. In this paper, it is mainly to improve the calculation of rotation factor p in DFT formula. Based on theoretical analysis of the ZC sequence DFT property, the symmetry property and recurrence relations of its rotation factor p are derived. Hence, a small amount of the rotation factors p in a ZC sequence can be calculated off-line and stored in memory firstly. And then all the other rotation factors can be obtained by looking up the table and some simple computations. As a result, the improved ZC sequence DFT can be achieved with less computational effort at a little expense of memory space. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/s11277-016-3189-9 | Wireless Personal Communications |
Keywords | Field | DocType |
Discrete Fourier transform,TD-LTE,Zadoff–Chu sequence | Random-access channel,Baseband,Preamble,Computer science,Recurrence relation,Algorithm,Zadoff–Chu sequence,Discrete Fourier transform,Computation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
88 | 3 | 0929-6212 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dan Wang | 1 | 169 | 13.41 |
Weiping Shi | 2 | 685 | 63.00 |
Yu Liu | 3 | 3 | 2.18 |
Yong Liao | 4 | 2 | 2.07 |