Simplification of DFT and IDFT in PRACH

Abstract

Abstract The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function by using the property of Zadoff‐Chu (ZC) sequence, and the latter is an approximation based on cubic spline interpolation, which not only reduces the IDFT points, but also is easy to construct.

Keywords

• 5G mobile communication
• computational complexity
• signal generators