DIRECT GENERATION OF DISCRETE FOURIER TRANSFORMS OF TIME-SHIFTED ZADOFF-CHU SEQUENCES

摘要

A method includes accepting input valuesu and v, respectively identifying a u th root Zadoff-Chusequence whose length is a prime number, and a v th cyclicshift for the sequence. Elements of a Discrete FourierTransform (DFT) of the v th cyclic shift of the u th rootZadoff-Chu sequence are computed using processingcircuitry, by evaluating a single respective exponentdepending on u and v in computing each of the elements.