This paper is a compilation of well-known results about Zadoff-Chu sequences, including all proofs with a consistent mathematical notation, for easy reference. Moreover, for a Zadoff-Chu sequence of prime length and root index , a formula is derived that allows computing the first term (frequency zero) of its discrete Fourier transform, , with constant complexity independent of the sequence length, as opposed to accumulating all its terms. The formula stems from a famous result in analytic number theory and is an interesting complement to the fact that the discrete Fourier transform of a Zadoff-Chu sequence is itself a Zadoff-Chu sequence whose terms are scaled by . Finally, the paper concludes with a brief analysis of time-continuous signals derived from Zadoff-Chu sequences, especially those obtained by OFDM-modulating a Zadoff-Chu sequence.

生成讲解博客的中文版本

生成AI智能校验的中文版本