Your browser does not support JavaScript!

Efficient computation of DFT of Zadoff-Chu sequences

Efficient computation of DFT of Zadoff-Chu sequences

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An important property of a Zadoff-Chu (ZC) sequence is derived, namely that the discrete Fourier transform (DFT) of a ZC sequence is a time-scaled conjugate of the ZC sequence, multiplied by a constant factor. This result has many practical applications. For example, it can be used to generate 3GPP LTE access preambles more efficiently than the standard suggests as it allows the DFT of a ZC sequence of prime length P to be computed with P instead of PlogP arithmetic operations.


    1. 1)
      • , : `Physical Layer for Ultra Mobile Broadband (UMB) Air Interface Specification', C, S0084-001-0 V3.0, Tech, 2008.
    2. 2)
      • C. Rader . Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE , 6 , 1107 - 1108
    3. 3)
      • 3GPP: ‘Evolved Universal Terrestrial Radio Access (E-UTRA); Physical Channels and Modulation (Release 8)’, TS 36.211 V8.1.0 (2007-11), 2007.
    4. 4)
      • R. Frank . Polyphase codes with good nonperiodic correlation properties. IEEE Trans. Inf. Theory , 1 , 43 - 45
    5. 5)

Related content

This is a required field
Please enter a valid email address