Direct generation of discrete Fourier transforms of time-shifted Zadoff-Chu sequences

摘要

A method includes accepting input values u and v, respectively identifying a u^th root Zadoff-Chu sequence whose length is a prime number, and a v^th cyclic shift for the sequence. Elements of a Discrete Fourier Transform (DFT) of the v^th cyclic shift of the u^th root Zadoff-Chu sequence are computed using processing circuitry, by evaluating a single respective exponent depending on u and v in computing each of the elements.