相关论文: Mathematical Properties of the Zadoff-Chu Sequence…

Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one and ideal periodic autocorrelation function. Such sequences are used in cellular radio communications systems, e.g., for reference signals, synchronization signals…

Having established that Zadoff-Chu (ZC) sequences are inherently linear micro-frequency hopping (lmFH) symbols, this paper first presents an intuitive and visual exposition of the computation of the DFT and IDFT of ZC sequences using the…

Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popovi\'c, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper…

For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…

Berggren and Popovi\'c introduced quadratic-permutation-polynomial interleaved Zadoff--Chu sequences and, from exhaustive data, conjectured that all normalized QPP-interleaved Zadoff--Chu sequences are inequivalent to ordinary Zadoff--Chu…

We present a novel framework for line-of-sight (LoS) delay-Doppler (DD) estimation in dense scattering propagation environments. We present two time-frequency (TF) domain pilot sequences inspired by the Zadoff-Chu sequence that exhibit…

This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…

In this paper we derive formulas for the N-point discrete Fourier transform and the R1 x R2 finite Zak transform of multiplicative characters on Z/N, where N is an odd integer, and R1 and R2 are co-prime factors of N. In one special case…

A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…

We develop the geometry of Hurwitz continued fractions, a major tool in understanding the approximation properties of complex numbers by ratios of Gaussian integers. Based on a thorough study of the geometric properties of Hurwitz continued…

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Let $x\geq 1$ be a large integer, and let $a_0<a_1<\cdots<a_{k-1}$ be a small fixed integer $k$-tuple, and let $\mu(n)\in\{-1,0,1\}$ be the periodic Mobius function. This note shows that discrete Fourier transform analysis produces a simple…

The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves…

In this paper, we propose a first-order Fourier integrator for solving the cubic nonlinear Schr\"odinger equation in one dimension. The scheme is explicit and can be implemented using the fast Fourier transform. By a rigorous analysis, we…

This paper investigates the Schur product of constacyclic codes via the constacyclic discrete Fourier transform (DFT). We first characterize key properties of the constacyclic DFT, highlighting its differences from the ordinary DFT. We then…

We define a family of quaternary sequences over the residue class ring modulo $4$ of length $pq$, a product of two distinct odd primes, using the generalized cyclotomic classes modulo $pq$ and calculate the discrete Fourier transform (DFT)…

We present an algorithm for the forward propagation of intervals through the discrete Fourier transform. The algorithm yields best-possible bounds when computing the amplitude of the Fourier transform for real and complex valued sequences.…

The time fractional ODEs are equivalent to convolutional Volterra integral equations with completely monotone kernels. We therefore introduce the concept of complete monotonicity-preserving ($\mathcal{CM}$-preserving) numerical methods for…

The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…

An error analysis of a splitting method applied to the Zakharov system is given. The numerical method is a Lie-Trotter splitting in time that is combined with a Fourier collocation in space to a fully discrete method. First-order…